New Forwarding Strategy for PROPHET Routing in Delay Tolerant Networks

Delay tolerant networks DTNs are based on the concept of store-carry and forward protocols: a node may store a message in its buffer and carry it for a long period of time, until an appropriate forwarding opportunity arises. DTNs are able to provide communication services in areas where there is no guarantee that a fully connected path between source and destination exists at any time, and seek to address the technical routing issues in wireless networks. Traditional routing protocols are unable to deliver messages between hosts in such conditions. In this paper, we address the problem of routing in DTNs and propose a new forwarding strategy based on the predictability control of a probabilistic routing model. This strategy increase the number of received messages without increasing the rate of relayed messages, which is more suitable regarding the battery power limitation of mobile nodes. Simulation results show that our new forwarding strategy performs better than the PROPHET routing solution well known by the research community.

[1]  Oliver Brock,et al.  MV routing and capacity building in disruption tolerant networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[2]  P. S. Sastry,et al.  Estimator Algorithms for Learning Automata , 1986 .

[3]  Jie Wu,et al.  An Efficient Prediction-Based Routing in Disruption-Tolerant Networks , 2012, IEEE Transactions on Parallel and Distributed Systems.

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

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

[6]  M. Boudguig,et al.  New predictability concept for routing in DTN , 2012, 2012 International Conference on Multimedia Computing and Systems.

[7]  Alexander Pelov Mobility models for wireless networks , 2009 .

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