Contact Graph Routing with Network Coding for LEO Satellite DTN Communications

In Delay/Disruption Tolerant Networks (DTNs), most previous works proposed to re-forward data and recalculate the route between the local node and one of its neighbors depending on the priority of message. However, some lower priority messages in a contact are replaced by the higher priority messages, which leads to the lower throughput and higher data loss rate. In this paper, we focus on the route selection process with the consideration of network coding in Low Earth Orbit (LEO) satellite DTN communications, and propose an improved Contact Graph Routing (CGR) scheme by introducing the Destination based Network Coding (DNC), namely DNC-CGR, to improve the network throughput and reduce the number of messages in the Inter-Satellite Links (ISLs). Simulation results show that the proposed DNC-CGR scheme can significantly improve network performance in comparison to the existing CGR schemes.

[1]  Scott C. Burleigh,et al.  Bundle Protocol Specification , 2007, RFC.

[2]  Baosheng Wang,et al.  NCSR: Multicast transport of BGP for geostationary Satellite network based on Network Coding , 2015, 2015 IEEE Aerospace Conference.

[3]  Esther Jennings,et al.  Enhancing Contact Graph Routing for Delay Tolerant Space Networking , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[4]  Scott Burleigh.  Contact Graph Routing , 2010 .

[5]  Min Wang,et al.  Joint Opportunistic Network Coding and Opportunistic Routing for Correlated Data Gathering in Wireless Sensor Network , 2013, 2013 IEEE 78th Vehicular Technology Conference (VTC Fall).

[6]  Juan A. Fraire,et al.  Design challenges in contact plans for disruption-tolerant satellite networks , 2015, IEEE Communications Magazine.

[7]  Jie Wu,et al.  Predict and relay: an efficient routing in disruption-tolerant networks , 2009, MobiHoc '09.

[8]  Carlo Caini,et al.  Application of Contact Graph Routing to LEO satellite DTN communications , 2012, 2012 IEEE International Conference on Communications (ICC).

[9]  Jie Wu,et al.  Universal Network Coding-Based Opportunistic Routing for Unicast , 2015, IEEE Transactions on Parallel and Distributed Systems.

[10]  Marina Ruggieri,et al.  Contact Graph Routing enhancements for delay tolerant space communications , 2014, 2014 7th Advanced Satellite Multimedia Systems Conference and the 13th Signal Processing for Space Communications Workshop (ASMS/SPSC).

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

[12]  Naoto Kadowaki,et al.  Technologies and applications of future satellite networking [Guest Editorial] , 2015, IEEE Commun. Mag..

[13]  Muriel Medard,et al.  On Randomized Network Coding , 2003 .

[14]  Hayoung Oh,et al.  A network coding aware routing with considering traffic load balancing for the multi-hop wireless networks , 2016, 2016 International Conference on Information Networking (ICOIN).

[15]  Scott Burleigh,et al.  Analysis of the contact graph routing algorithm: Bounding interplanetary paths , 2012 .

[16]  Igor Bisio,et al.  Contact graph routing in DTN space networks: overview, enhancements and performance , 2015, IEEE Communications Magazine.

[17]  Pablo G. Madoery,et al.  On the Design and Analysis of Fair Contact Plans in Predictable Delay-Tolerant Networks , 2014, IEEE Sensors Journal.

[18]  Haitham S. Cruickshank,et al.  Delay- and Disruption-Tolerant Networking (DTN): An Alternative Solution for Future Satellite Networking Applications , 2011, Proceedings of the IEEE.

[19]  Peter Han Joo Chong,et al.  Simulation study of routing attacks under network coding environment , 2016, 2016 IEEE International Conference on Communications (ICC).

[20]  Christos Gkantsidis,et al.  Anatomy of a P2P Content Distribution system with Network Coding , 2006, IPTPS.