Network Coding in Disruption Tolerant Networks

Publisher Summary Disruption Tolerant Network (DTN) scenarios often arise from mobile wireless networks, where due to limited transmission power, fast node mobility, sparse node density, and frequent equipment failures, there is often no contemporaneous path from the source to the destination node(s). It reviews research works that studied the benefits of applying random linear coding (RLC) to DTNs. First, it reviews traditional non-coding routing schemes for broadcast and unicast applications in DTNs, and the basic operations of RLC. After introducing the design space of DTN routing, then focuses on the performance evaluation of RLC based routing schemes for broadcast communication and unicast communication. For both communications, the RLC based schemes improve the trade-off between energy expenditure and delivery performance. In addition, research efforts in the performance modeling of RLC schemes, priority coding protocol, RLC based secure unicast scheme are also discussed. For both communication models, the RLC based scheme provides better trade-off between energy consumption and delivery performance. The performance metrics for evaluating different broadcast routing schemes include: energy efficiency , often measured by the total number of transmissions required to transmit a packet to all receivers; packet delivery ratio , the fraction of packets that are received by all the destinations; and packet delivery delay .

[1]  Zygmunt J. Haas,et al.  The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way) , 2003, MobiHoc '03.

[2]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[3]  Éva Tardos,et al.  Algorithm design , 2005 .

[4]  Ling-Jyh Chen,et al.  A hybrid routing approach for opportunistic networks , 2006, CHANTS '06.

[5]  Christos Gkantsidis,et al.  Network coding for large scale content distribution , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[6]  Xiaojun Lin,et al.  Optimal immediately-decodable inter-session network coding (IDNC) schemes for two unicast sessions with hard deadline constraints , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[7]  Mooi Choo Chuah,et al.  An encounter-based multicast scheme for disruption tolerant networks , 2009, Comput. Commun..

[8]  Brian D. Davison,et al.  OS-multicast: On-demand Situation-aware Multicasting in Disruption Tolerant Networks , 2006, 2006 IEEE 63rd Vehicular Technology Conference.

[9]  Muriel Médard,et al.  Algebraic gossip: a network coding approach to optimal multiple rumor mongering , 2006, IEEE Transactions on Information Theory.

[10]  Robert Simon,et al.  A Simulation Analysis of Multicasting in Delay Tolerant Networks , 2006, Proceedings of the 2006 Winter Simulation Conference.

[11]  Muriel Medard,et al.  Network Coding for Delay Tolerant Networks with Byzantine Adversaries , 2009, ArXiv.

[12]  I. Reed,et al.  Polynomial Codes Over Certain Finite Fields , 1960 .

[13]  R. Koetter,et al.  The benefits of coding over routing in a randomized setting , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[14]  Jörg Widmer,et al.  Network coding for efficient communication in extreme networks , 2005, WDTN '05.

[15]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[16]  Brian Gallagher,et al.  MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[17]  Baochun Li,et al.  Differentiated Data Persistence with Priority Random Linear Codes , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).

[18]  Cauligi S. Raghavendra,et al.  Spray and wait: an efficient routing scheme for intermittently connected mobile networks , 2005, WDTN '05.

[19]  Paolo Giaccone,et al.  Optimal routing and scheduling for deterministic delay tolerant networks , 2009, 2009 Sixth International Conference on Wireless On-Demand Network Systems and Services.

[20]  Peter Sanders,et al.  Polynomial time algorithms for multicast network code construction , 2005, IEEE Transactions on Information Theory.

[21]  Zygmunt J. Haas,et al.  A new networking model for biological applications of ad hoc sensor networks , 2006, IEEE/ACM Transactions on Networking.

[22]  Frank R. Kschischang,et al.  Coding for Errors and Erasures in Random Network Coding , 2007, IEEE Transactions on Information Theory.

[23]  Tracey Ho,et al.  Network Coding with a Cost Criterion , 2004 .

[24]  Zygmunt J. Haas,et al.  Resource and performance tradeoffs in delay-tolerant wireless networks , 2005, WDTN '05.

[25]  Andrei Z. Broder,et al.  Using multiple hash functions to improve IP lookups , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[26]  Tracey Ho,et al.  Byzantine modification detection in multicast networks using randomized network coding , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[27]  Aline Carneiro Viana,et al.  A Content-based Network Coding to Match Social Interest Similarities in Delay Tolerant Networks , 2009 .

[28]  Mostafa Ammar,et al.  Multicasting in delay tolerant networks: semantic models and routing algorithms , 2005, WDTN '05.

[29]  G. Neglia,et al.  On the Benefits of Random Linear Coding for Unicast Applications in Disruption Tolerant Networks , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[30]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[31]  Zongpeng Li,et al.  On achieving optimal throughput with network coding , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[32]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

[33]  Sachin Katti,et al.  The Importance of Being Opportunistic: Practical Network Coding for Wireless Environments , 2005 .

[34]  Anindya Iqbal,et al.  Energy efficient broadcasting in wireless Ad hoc networks , 2009 .

[35]  Yong Wang,et al.  Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet , 2002, ASPLOS X.

[36]  Muriel Medard,et al.  How good is random linear coding based distributed networked storage , 2005 .

[37]  Yunfeng Lin,et al.  Performance modeling of network coding in epidemic routing , 2007, MobiOpp '07.

[38]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[39]  Rabin K. Patra,et al.  Using redundancy to cope with failures in a delay tolerant network , 2005, SIGCOMM '05.

[40]  Fang Zhao,et al.  Signatures for Content Distribution with Network Coding , 2007, 2007 IEEE International Symposium on Information Theory.

[41]  C. Fragouli,et al.  Efficient Broadcasting Using Network Coding , 2008, IEEE/ACM Transactions on Networking.

[42]  Fang Zhao,et al.  Minimum-cost multicast over coded packet networks , 2005, IEEE Transactions on Information Theory.

[43]  Yunnan Wu,et al.  Information Exchange in Wireless Networks with Network Coding and Physical-layer Broadcast , 2004 .

[44]  T. Spyropoulos,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[45]  Yang Zhang,et al.  CarTel: a distributed mobile sensor computing system , 2006, SenSys '06.

[46]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[47]  Jörg Widmer,et al.  Network coding: an instant primer , 2006, CCRV.

[48]  Thrasyvoulos Spyropoulos,et al.  Optimal Buffer Management Policies for Delay Tolerant Networks , 2008, 2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[49]  Margaret Martonosi,et al.  Erasure-coding based routing for opportunistic networks , 2005, WDTN '05.

[50]  Pan Hui,et al.  Pocket Switched Networking: Challenges, Feasibility and Implementation Issues , 2005, WAC.

[51]  Arun Venkataramani,et al.  DTN routing as a resource allocation problem , 2007, SIGCOMM '07.

[52]  Amit Kumar,et al.  Connectivity and inference problems for temporal networks , 2000, STOC '00.

[53]  Baochun Li,et al.  Stochastic analysis of network coding in epidemic routing , 2008, IEEE Journal on Selected Areas in Communications.

[54]  Maria Udén,et al.  Providing connectivity to the Saami nomadic community , 2002 .

[55]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[56]  Brian Neil Levine,et al.  A survey of practical issues in underwater networks , 2006, MOCO.

[57]  Chen Avin,et al.  Tight bounds for algebraic gossip on graphs , 2010, 2010 IEEE International Symposium on Information Theory.

[58]  Ger Koole,et al.  The message delay in mobile ad hoc networks , 2005, Perform. Evaluation.

[59]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2002, IEEE/ACM Transactions on Networking.

[60]  Donald F. Towsley,et al.  Bounds on the Gain of Network Coding and Broadcasting in Wireless Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[61]  Christina Fragouli,et al.  Low-complexity energy-efficient broadcasting in wireless ad-hoc networks using network coding , 2005 .

[62]  Francesco De Pellegrini,et al.  Dynamic control of Coding in Delay Tolerant Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[63]  Donald F. Towsley,et al.  Performance modeling of epidemic routing , 2006, Comput. Networks.

[64]  Muriel Médard,et al.  XORs in the Air: Practical Wireless Network Coding , 2006, IEEE/ACM Transactions on Networking.

[65]  Baochun Li,et al.  How Practical is Network Coding? , 2006, 200614th IEEE International Workshop on Quality of Service.

[66]  K. Psounis,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case , 2008, IEEE/ACM Transactions on Networking.

[67]  Daniel A. Spielman,et al.  Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.

[68]  Baochun Li,et al.  Efficient Network Coded Data Transmissions in Disruption Tolerant Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[69]  Yunnan Wu,et al.  Minimum-energy multicast in mobile ad hoc networks using network coding , 2004, Information Theory Workshop.

[70]  Eli Upfal,et al.  Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .