Asymmetric Spray Based Routing for Delay Tolerant Networks

The framework of Delay Tolerant Networks (DTNs) has recently received an extensive attention and widely implemented, ranging from Wireless Sensor Networks (WSNs) to Interplanetary Networks. It has been applied in military communication, scientific research and exploration. Due to the characteristic of long delay, intermittent disruption, limitation of buffer space and energy, the traditional routing algorithms in the Internet do not perform well in DTNs. Since most of the existing DTN routing algorithms are based on the replication mechanism to achieve the high delivery ratio. In this paper, we propose an asymmetric spray algorithm based on the limited number of replication with the consideration of utility metric. In addition, we also design an adaptive replication function to optimize the dropped messages due to the insufficient encounter duration. Simulation results show the effectiveness of our asymmetric spray approach. In combination with the other designed functions, our proposed algorithm achieve a better performance than the state of the art algorithms.

[1]  Mads Haahr,et al.  Social network analysis for routing in disconnected delay-tolerant MANETs , 2007, MobiHoc '07.

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

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

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

[5]  David Tse,et al.  Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[6]  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).

[7]  Stephen Farrell,et al.  DTN: an architectural retrospective , 2008, IEEE Journal on Selected Areas in Communications.

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

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