Team for Research in
Ubiquitous Secure Technology

Citation
Anna Kacewicz, Stephen Wicker. "Redundancy Minimizing Techniques for Robust Transmission in Wireless Networks". Talk or presentation, 11, November, 2008.

Abstract
Wireless networks are being increasingly used to download/transmit a large amount of data. This data is subject to deterioration because it is sent through the air rather than a more reliable medium. Not only are wireless networks susceptible to noise, but are also more vulnerable to malicious or un-cooperating nodes. The messages sent across a wireless network should be received without error in a short amount of time regardless of the increased disturbance levels. Hence, it is useful to devise coding methods and algorithms to ensure message integrity across wireless channels. While redundancy increases network robustness, it also reduces network efficiency. This suggests the importance of minimally increasing the message length as to guarantee an aspired degree of network reliability. In this paper we consider a multiple path wireless network through which a source-destination pair would like to communicate. Moreover, the presence of adversaries on some paths may cause information to be lost or corrupted. We model the presence of a malicious node as an erasure channel. The erasure channel is a type of a wireless channel, in which packets forwarded through that channel are either fully received or erased with a certain probability. For security purposes, we assume that the message is encrypted by a standard encryption technique. The erasure channel assumption is feasible since the encryption allows the destination node to validate data it receives, meaning that if the node receives corrupted data then that data will be thrown out and treated as an erasure. Malicious nodes may also steal messages, causing the receiving node to observe an erasure. The path erasure probabilities are associated with the degree to which they can be trusted. Redundancy is vital in erasure channels since it allows perfect decoding even with some erasures. Our goal is to devise a coding method to guarantee robustness in a network with known path distributions. Wireless networks such as mobile ad hoc networks or sensor networks have frequent changes in topology due to link failures, physical obstructions, network intrusions, etc. Dependability on these sorts of networks requires dynamic algorithms which quickly determine routing, redundancy, etc. for deviations in the network. Thus, it is important that our robustness algorithm determine parameters dynamically. Our main contribution includes the design of two algorithms MRAET (exponential time) and MRAPT (polynomial time) to determine minimum redundancy and optimal symbol allocation to attain a probability of success. We compare the performance of the algorithms with respect to each other and the desired success level. Also, we design MDS, LT, and Raptor code parameters to work in the algorithms. We implement them using the MRAET algorithm and evaluate their performance.

Electronic downloads

• 7%20-%20Kacewicz.pdf · application/pdf · 174 kbytes

• HTML

  Anna Kacewicz, Stephen Wicker. <a
  href="http://www.truststc.org/pubs/478.html"
  ><i>Redundancy Minimizing Techniques for Robust
  Transmission in Wireless Networks</i></a>, Talk
  or presentation,  11, November, 2008.

• Plain text

  Anna Kacewicz, Stephen Wicker. "Redundancy Minimizing
  Techniques for Robust Transmission in Wireless
  Networks". Talk or presentation,  11, November, 2008.

• BibTeX

  @presentation{KacewiczWicker08_RedundancyMinimizingTechniquesForRobustTransmissionIn,
      author = {Anna Kacewicz and Stephen Wicker},
      title = {Redundancy Minimizing Techniques for Robust
                Transmission in Wireless Networks},
      day = {11},
      month = {November},
      year = {2008},
      abstract = {Wireless networks are being increasingly used to
                download/transmit a large amount of data. This
                data is subject to deterioration because it is
                sent through the air rather than a more reliable
                medium. Not only are wireless networks susceptible
                to noise, but are also more vulnerable to
                malicious or un-cooperating nodes. The messages
                sent across a wireless network should be received
                without error in a short amount of time regardless
                of the increased disturbance levels. Hence, it is
                useful to devise coding methods and algorithms to
                ensure message integrity across wireless channels.
                While redundancy increases network robustness, it
                also reduces network efficiency. This suggests the
                importance of minimally increasing the message
                length as to guarantee an aspired degree of
                network reliability. In this paper we consider a
                multiple path wireless network through which a
                source-destination pair would like to communicate.
                Moreover, the presence of adversaries on some
                paths may cause information to be lost or
                corrupted. We model the presence of a malicious
                node as an erasure channel. The erasure channel is
                a type of a wireless channel, in which packets
                forwarded through that channel are either fully
                received or erased with a certain probability. For
                security purposes, we assume that the message is
                encrypted by a standard encryption technique. The
                erasure channel assumption is feasible since the
                encryption allows the destination node to validate
                data it receives, meaning that if the node
                receives corrupted data then that data will be
                thrown out and treated as an erasure. Malicious
                nodes may also steal messages, causing the
                receiving node to observe an erasure. The path
                erasure probabilities are associated with the
                degree to which they can be trusted. Redundancy is
                vital in erasure channels since it allows perfect
                decoding even with some erasures. Our goal is to
                devise a coding method to guarantee robustness in
                a network with known path distributions. Wireless
                networks such as mobile ad hoc networks or sensor
                networks have frequent changes in topology due to
                link failures, physical obstructions, network
                intrusions, etc. Dependability on these sorts of
                networks requires dynamic algorithms which quickly
                determine routing, redundancy, etc. for deviations
                in the network. Thus, it is important that our
                robustness algorithm determine parameters
                dynamically. Our main contribution includes the
                design of two algorithms MRAET (exponential time)
                and MRAPT (polynomial time) to determine minimum
                redundancy and optimal symbol allocation to attain
                a probability of success. We compare the
                performance of the algorithms with respect to each
                other and the desired success level. Also, we
                design MDS, LT, and Raptor code parameters to work
                in the algorithms. We implement them using the
                MRAET algorithm and evaluate their performance.},
      URL = {http://www.truststc.org/pubs/478.html}
  }
  

Posted by Jessica Gamble on 23 Jan 2009.
For additional information, see the Publications FAQ or contact webmaster at www truststc org.