Adaptive Network Coding With Noisy Packets

Shirish S. Karande, Kiran Misra, Muhammad U. Ilyas, Hayder Radha

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper we study the problem of employing network coding in presence of bit corruptions in the packets. We consider a network model within which a minimal amount of processing is employed at intermediate nodes. Under such a paradigm the efficiency of a network coding function, is dependent on the bit-error rates (BER) observed in the packets. Hence under time-varying channel conditions the network coding functions need to adapt in accordance to the channel state associated with the packets. We propose a systematic optimization approach to design an adaptive network coding (ANC) scheme which facilitates efficient exchange of mutually independent information. Under the proposed scheme the intermediate nodes relay the packets with or without piggybacking, depending on the corruption in the received packets and in accordance to pre-designed exchange rules. We illustrate the performance benefits of the proposed optimizations on the basis of channel models derived from actual 802.11 b and 802.15.4 measurements.
Original languageEnglish
Title of host publication2007 41st Annual Conference on Information Sciences and Systems
PublisherIEEE
Pages259-264
Number of pages6
ISBN (Print)1-4244-1037-1
DOIs
Publication statusPublished - 16 Mar 2007
Event2007 41st Annual Conference on Information Sciences and Systems - Baltimore, MD, USA
Duration: 14 Mar 200716 Mar 2007

Conference

Conference2007 41st Annual Conference on Information Sciences and Systems
Period14/03/0716/03/07

Keywords

  • Adaptive systems
  • Network coding
  • Bit error rate
  • Network topology
  • Wireless networks
  • Design optimization
  • Relays
  • Time-varying channels
  • Broadcasting
  • Performance gain

Fingerprint

Dive into the research topics of 'Adaptive Network Coding With Noisy Packets'. Together they form a unique fingerprint.

Cite this