Towards efficient and practical network coding in delay tolerant networks

Network coding techniques offer an emerging solution to efficient data transmission in Delay Tolerant Networks (DTN). To date, abundant techniques have been developed on exploiting network coding in DTN, however, most of them bring additional overhead due to the extra coded message redundancy. In this paper, we analyze the coded message redundancy issue, and then propose NTC, an efficient network coding scheme for DTN. In NTC, a novel metric named ''redundancy ratio'' is introduced within the anti-entropy message exchange process. We also discuss the design and implementation of practical NTC in detail. To evaluate the performance of our proposed NTC scheme, we implement NTC in ONE, the current state-of-the-art simulator for DTN. Simulation results show that, comparing with existing schemes, our proposed NTC scheme has significant advantages in enhancing the message delivery ratio and reducing the transmission overhead.

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

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

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

[4]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[5]  Jörg Ott,et al.  The ONE simulator for DTN protocol evaluation , 2009, SIMUTools 2009.

[6]  Mostafa Ammar,et al.  Routing in Space and Time in Networks with Predictable Mobility , 2004 .

[7]  J. Lacan,et al.  Rethinking reliability for long-delay networks , 2008, 2008 IEEE International Workshop on Satellite and Space Communications.

[8]  Özgür B. Akan,et al.  InterPlaNetary Internet: state-of-the-art and research challenges , 2003, Comput. Networks.

[9]  Salil S. Kanhere,et al.  HUBCODE: message forwarding using hub-based network coding in delay tolerant networks , 2009, MSWiM '09.

[10]  Lei Tang,et al.  SMART: A selective controlled-flooding routing for delay tolerant networks , 2007, 2007 Fourth International Conference on Broadband Communications, Networks and Systems (BROADNETS '07).

[11]  Cauligi S. Raghavendra,et al.  Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).

[12]  K. Jain,et al.  Practical Network Coding , 2003 .

[13]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

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

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

[16]  Giovanni Pau,et al.  Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking , 2007, MobiSys 2007.

[17]  Marvin Theimer,et al.  Managing update conflicts in Bayou, a weakly connected replicated storage system , 1995, SOSP.

[18]  Gabriel Wainer,et al.  Proceedings of the 2nd International Conference on Simulation Tools and Techniques , 2009 .

[19]  Jingfeng Xue,et al.  Advanced PROPHET Routing in Delay Tolerant Network , 2009, 2009 International Conference on Communication Software and Networks.

[20]  Rabin K. Patra,et al.  Routing in a delay tolerant network , 2004, SIGCOMM '04.

[21]  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.

[22]  Jingfeng Xue,et al.  Spray and Wait Routing Based on Average Delivery Probability in Delay Tolerant Network , 2009, 2009 International Conference on Networks Security, Wireless Communications and Trusted Computing.