Team for Research in
Ubiquitous Secure Technology

Citation
Anna Kacewicz, Stephen Wicker. "Optimizing Redundancy Using MDS Codes and Dynamic Symbol Allocation in Mobile Ad Hoc Networks". Proceedings of the 43rd Annual Conference on Information Sciences and Systems (CISS), Princeton University, March, 2008.

Abstract
Sensor networks are susceptible to attacks by adversaries, making it necessary to design algorithms to ensure that the network can recover and successfully transmit data. We consider the design of a network in which packet transmissions between two nodes are to guarantee a certain probability of success. There are N independent paths between the two nodes, each path having a fixed probability of success which represents an a priori estimate of the security of the path. The original message is encoded using a maximum-distance separable code. We find the minimum redundancy and optimal path symbol allocation for the 3-path case based on a desired success probability and the path success probabilities. Two algorithms are presented for determining the minimum required redundancy – an exponential time algorithm (MRAET) and a polynomial time algorithm (MRAPT). We show that MRAET is optimal in several cases, and that both algorithms perform very well.

Electronic downloads

• PacketRegions.pdf · application/pdf · 131 kbytes

• HTML

  Anna Kacewicz, Stephen Wicker. <a
  href="http://www.truststc.org/pubs/329.html"
  >Optimizing Redundancy Using MDS Codes and Dynamic Symbol
  Allocation in Mobile Ad Hoc Networks</a>, Proceedings
  of the 43rd Annual Conference on Information Sciences and
  Systems (CISS), Princeton University, March, 2008.

• Plain text

  Anna Kacewicz, Stephen Wicker. "Optimizing Redundancy
  Using MDS Codes and Dynamic Symbol Allocation in Mobile Ad
  Hoc Networks". Proceedings of the 43rd Annual
  Conference on Information Sciences and Systems (CISS),
  Princeton University, March, 2008.

• BibTeX

  @inproceedings{KacewiczWicker08_OptimizingRedundancyUsingMDSCodesDynamicSymbolAllocation,
      author = {Anna Kacewicz and Stephen Wicker},
      title = {Optimizing Redundancy Using MDS Codes and Dynamic
                Symbol Allocation in Mobile Ad Hoc Networks},
      booktitle = {Proceedings of the 43rd Annual Conference on
                Information Sciences and Systems (CISS)},
      organization = {Princeton University},
      month = {March},
      year = {2008},
      abstract = {Sensor networks are susceptible to attacks by
                adversaries, making it necessary to design
                algorithms to ensure that the network can recover
                and successfully transmit data. We consider the
                design of a network in which packet transmissions
                between two nodes are to guarantee a certain
                probability of success. There are N independent
                paths between the two nodes, each path having a
                fixed probability of success which represents an a
                priori estimate of the security of the path. The
                original message is encoded using a
                maximum-distance separable code. We find the
                minimum redundancy and optimal path symbol
                allocation for the 3-path case based on a desired
                success probability and the path success
                probabilities. Two algorithms are presented for
                determining the minimum required redundancy – an
                exponential time algorithm (MRAET) and a
                polynomial time algorithm (MRAPT). We show that
                MRAET is optimal in several cases, and that both
                algorithms perform very well.},
      URL = {http://www.truststc.org/pubs/329.html}
  }
  

Posted by Anna Kacewicz on 30 Mar 2008.
For additional information, see the Publications FAQ or contact webmaster at www truststc org.