Movement Speed Based Inter-probe Times for Neighbour Discovery in Mobile Ad-Hoc Networks

It is widely known that topology, wireless range, and the movement patterns of devices often impose severe limitations on the ability of devices to communicate in Mobile Wireless Ad-hoc Networks (MANETs). However, there has been less research into the effect of devices’ movement speeds on network connectivity. In this paper we will look at two commonly used MANET movement patterns, Working Day Movement (WDM) and Random Walk Movement (RWM). This report will demonstrate using both of these movement patterns, that the time between neighbour discovery scans called the inter-probe time, can have a drastic effect on network connectivity. We will suggest a mechanism to choose inter-probe times based on the movement speeds of devices which can efficiently detect more than 99% of encounters between mobile devices carried by pedestrians. We will then propose a dynamic approach (PISTONS) which allows devices to alter inter-probe times based on context whilst preserving much of the network connectivity.

[1]  Ness B. Shroff,et al.  Delay and Capacity Trade-Offs in Mobile Ad Hoc Networks: A Global Perspective , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[2]  Simin Nadjm-Tehrani,et al.  Adding Redundancy to Replication in Window-aware Delay-tolerant Routing , 2010, J. Commun..

[3]  H. Izumikawa,et al.  Energy-efficient adaptive interface activation for Delay/Disruption Tolerant Networks , 2010, 2010 The 12th International Conference on Advanced Communication Technology (ICACT).

[4]  Donald F. Towsley,et al.  Performance Modeling of Epidemic Routing , 2006, Networking.

[5]  Jörg Ott,et al.  Working day movement model , 2008, MobilityModels '08.

[6]  Jongmin Shin,et al.  Asynchronous probing scheme for the optimal energy-efficient neighbor discovery in opportunistic networking , 2009, 2009 IEEE International Conference on Pervasive Computing and Communications.

[7]  Wei Wang,et al.  Opportunistic Energy-Efficient Contact Probing in Delay-Tolerant Applications , 2009, IEEE/ACM Transactions on Networking.

[8]  Kenneth N. Brown,et al.  Exploiting Rush Hours for Energy-Efficient Contact Probing in Opportunistic Data Collection , 2011, 2011 31st International Conference on Distributed Computing Systems Workshops.

[9]  Xuemin Shen,et al.  Adaptive Asynchronous Sleep Scheduling Protocols for Delay Tolerant Networks , 2011, IEEE Transactions on Mobile Computing.

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

[11]  Albert-László Barabási,et al.  Understanding individual human mobility patterns , 2008, Nature.

[12]  Pan Hui,et al.  People are the network : experimental design and evaluation of social-based forwarding algorithms , 2008 .

[13]  Jongmin Shin,et al.  An Energy-Optimal Scheme for Neighbor Discovery in Opportunistic Networking , 2009, 2009 6th IEEE Consumer Communications and Networking Conference.

[14]  Bhaskar Krishnamachari,et al.  Findings from an empirical study of fine-grained human social contacts , 2009, 2009 Sixth International Conference on Wireless On-Demand Network Systems and Services.

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

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

[17]  Gang Feng,et al.  How Contact Probing Affects the Transmission Capacity and Energy Consumption in DTNs , 2011, 2011 IEEE International Conference on Communications (ICC).

[18]  George Varghese,et al.  Experiments in Mobile Social Networking , 2008 .