Message routing on potential-fields in forwarding-based DTNs

In delay (or disruption) tolerant networks(DTNs), the physical network is partitioned and the topology changes by node contacts. In most cases, there are no globally synchronized topology information available, which makes routing in DTNs challenging. To enable message routing without topology, we take potential-based routing(PBR) approach. We define potential-based message forwarding (PBMF) model and potential field construction method, which can be implemented in autonomously and distributed manner. We also discuss message overflow phenomenon, which should be considered in the deployment phase. This work assumes forwarding-based message delivery because of its lightweightness in delivery management. We developed a prototype system and evaluated (1) the behavior of potential-field and message delivery and (2) the model of message overflow. We also carried out a 100-node scale simulation and found that compared to epidemic routing, (3) about 50% of delivery was performed within three times of the best delivery latency and (4) the usage of message storage was reduced to 1%.

[1]  Thierry Turletti,et al.  Utility-based Message Replication for Intermittently Connected Heterogeneous Networks , 2007, 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

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

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

[4]  Paul D. Amer,et al.  The transport layer: tutorial and survey , 1999, CSUR.

[5]  Xiangchuan Chen,et al.  Enabling Disconnected Transitive Communication in Mobile Ad Hoc Networks , 2001 .

[6]  Hiroshi Esaki,et al.  Mobility entropy and message routing in community-structured delay tolerant networks , 2008, AINTEC '08.

[7]  Michael J. Demmer,et al.  DTLSR: delay tolerant routing for developing regions , 2007, NSDR '07.

[8]  Bernhard Plattner,et al.  Density-Based vs. Proximity-Based Anycast Routing for Mobile Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

[10]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

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

[12]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[13]  Jaideep Srivastava,et al.  PWave: A Multi-source Multi-sink Anycast Routing Framework for Wireless Sensor Networks , 2007, Networking.

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

[15]  Anindya Basu,et al.  Routing using potentials: a dynamic traffic-aware routing algorithm , 2003, SIGCOMM '03.

[16]  Chao Chen,et al.  Evaluating contacts for routing in highly partitioned mobile networks , 2007, MobiOpp '07.

[17]  Nick McKeown,et al.  Routing in a highly dynamic topology , 2005, 2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005..