Implementing Forward and Drop Policies for Improving PRoPHET's Routing Performance

Routing protocols for delay tolerant network are designed to operate in an environment where there is no stable end to end path. The DTN research has focused primarily on the performance of routing protocols that build on a Store-Carry-Forward manner without consideration of a physical buffer limitation. Therefore, the need of a message sorting and drop policy according to priorities is very critical and favorable in such restricted environments. In this paper, we present effective forward and drop policies to improve the performance of the PRoPHET routing protocol. These forward and drop policies are applied on the PRoPHET version 2 routing protocol, which is currently commonly used as routing protocol for practical implementations of DTN middlewares. In this paper, we propose a stopping rule for the forward strategy in PRoPHET together with a dynamic drop policy. By this, we optimize the routing performance based on reducing the number of relayed messages while keeping a desired delivery ratio. To further improve the resource conservation, we propose new rules for message forwarding when encountering nodes. A forwarding error approximation is used to give the optimal threshold of the forwarding decision. In addition, we propose a dynamic drop policy which considers delay and overhead of the message based on multiple parameters. Simulation results show that the PRoPHET protocol with our new forward and drop policies gives better performance improvement in terms of relayed messages.

[1]  Kalman Graffi,et al.  Analysis of Buffer Management Policies for Opportunistic Networks , 2016, 2016 25th International Conference on Computer Communication and Networks (ICCCN).

[2]  Jörg Ott,et al.  Simulating Mobility and DTNs with the ONE (Invited Paper) , 2010, J. Commun..

[3]  Reiner Kolla,et al.  A Method for Self-Organizing Communication in WSN Based Localization Systems: HashSlot , 2007 .

[4]  Chai Kiat Yeo,et al.  Probabilistic Routing Based on History of Messages in Delay Tolerant Networks , 2011, 2011 IEEE Vehicular Technology Conference (VTC Fall).

[5]  Daru Pan,et al.  A comprehensive-integrated buffer management strategy for opportunistic networks , 2013, EURASIP J. Wirel. Commun. Netw..

[6]  Thrasyvoulos Spyropoulos,et al.  Message Drop and Scheduling in DTNs: Theory and Practice , 2012, IEEE Transactions on Mobile Computing.

[7]  Ralf Steinmetz,et al.  AntSec, WatchAnt, and AntRep: Innovative Security Mechanisms for Wireless Mesh Networks , 2007, 32nd IEEE Conference on Local Computer Networks (LCN 2007).

[8]  Ling-Jyh Chen,et al.  PRoPHET+: An Adaptive PRoPHET-Based Routing Protocol for Opportunistic Network , 2010, 2010 24th IEEE International Conference on Advanced Information Networking and Applications.

[9]  Mohamed El-Kamili,et al.  New Forwarding Strategy for PROPHET Routing in Delay Tolerant Networks , 2013, NETYS.

[10]  Marco Conti,et al.  From opportunistic networks to opportunistic computing , 2010, IEEE Communications Magazine.

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

[12]  Anders Lindgren,et al.  The evolution of a DTN routing protocol - PRoPHETv2 , 2011, CHANTS '11.

[13]  Ralf Steinmetz,et al.  Overlay Bandwidth Management: Scheduling and Active Queue Management of Overlay Flows , 2007 .

[14]  Ralf Steinmetz,et al.  A security framework for wireless mesh networks , 2011, Wirel. Commun. Mob. Comput..

[15]  Shuhui Yang,et al.  Ferry Enhanced Improved PRoPHET Routing Protocol , 2015, 2015 IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems.

[16]  Kalman Graffi.  PeerfactSim.KOM: A P2P system simulator — Experiences and lessons learned , 2011, 2011 IEEE International Conference on Peer-to-Peer Computing.

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

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

[19]  Soontae Kim,et al.  Enhanced buffer management policy that utilises message properties for delay-tolerant networks , 2011, IET Commun..

[20]  Keecheon Kim,et al.  Distance-based PRoPHET routing protocol in Disruption Tolerant Network , 2013, 2013 International Conference on ICT Convergence (ICTC).

[21]  Abdul Hanan Abdullah,et al.  Reactive Weight Based Buffer Management Policy for DTN Routing Protocols , 2015, Wirel. Pers. Commun..

[22]  Anders Lindgren,et al.  Probabilistic Routing Protocol for Intermittently Connected Networks , 2012, RFC.