Density-Aware Message Spraying for routing in Delay Tolerant Networks

It is challenging to react to dynamically changing of network topology for routing schemes in Delay Tolerant Networks (DTNs). The main concern about routing in DTNs is to minimize delivery delay while maintaining low overhead. In this paper, we propose a DTN routing scheme Density-Aware Message Spraying (DAMS). The scheme is based on the idea of exploiting spatial node distribution and encounter history to predict the expected number of nodes within the coverage area of a node. Every node dynamically chooses the number of copies by itself. Simulation results show that DAMS has good performance and low overhead in sparse scenarios.

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

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

[3]  Paolo Santi,et al.  The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks , 2003, IEEE Trans. Mob. Comput..

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

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

[6]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[7]  Mads Haahr,et al.  Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs , 2009, IEEE Transactions on Mobile Computing.

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

[9]  Christian Wagner,et al.  The Spatial Node Distribution of the Random Waypoint Mobility Model , 2002, WMAN.

[10]  Christian Bettstetter.  Topology properties of Ad hoc networks with random waypoint mobility , 2003, MOCO.

[11]  Zhensheng Zhang,et al.  Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges , 2006, IEEE Communications Surveys & Tutorials.

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

[13]  Lei Tang,et al.  Selective Message Forwarding in Delay Tolerant Networks , 2009, Mob. Networks Appl..

[14]  Boleslaw K. Szymanski,et al.  Cost-Effective Multiperiod Spraying for Routing in Delay-Tolerant Networks , 2010, IEEE/ACM Transactions on Networking.

[15]  Anders Lindgren,et al.  Probabilistic Routing in Intermittently Connected Networks , 2004, SAPIR.

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

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

[18]  Hannes Hartenstein,et al.  Stochastic properties of the random waypoint mobility model: epoch length, direction distribution, and cell change rate , 2002, MSWiM '02.

[19]  Mingyan Liu,et al.  Random waypoint considered harmful , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[20]  Marcelo Dias de Amorim,et al.  The Accordion Phenomenon: Analysis, Characterization, and Impact on DTN Routing , 2009, IEEE INFOCOM 2009.

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

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

[23]  Cauligi S. Raghavendra,et al.  Performance analysis of mobility-assisted routing , 2006, MobiHoc '06.

[24]  Jorma T. Virtamo,et al.  Spatial node distribution of the random waypoint mobility model with applications , 2006, IEEE Transactions on Mobile Computing.