A neighbor detection algorithm based on multiple virtual mobile nodes for mobile ad hoc networks

We introduce an algorithm that implements a time-limited neighbor detector service in mobile ad hoc networks. The time-limited neighbor detector enables a mobile device to detect other nearby devices in the past, present and up to some bounded time interval in the future. In particular, it can be used by a new trend of mobile applications known as proximity-based mobile applications. To implement the time-limited neighbor detector, our algorithm uses n=2k virtual mobile nodes where k is a non-negative integer. A virtual mobile node is an abstraction that is akin to a mobile node that travels in the network in a predefined trajectory. In practice, it can be implemented by a set of real nodes based on a replicated state machine approach. Our algorithm implements the neighbor detector for real nodes located in a circular region. We also assume that each real node can accurately predict its own locations up to some bounded time interval predict in the future. The key idea of the algorithm is that the virtual mobile nodes regularly collect location predictions of real nodes from different subregions, meet to share what they have collected with each other and then distribute the collected location predictions to real nodes. Thus, each real node can use the distributed location predictions for neighbor detection. We show that our algorithm is correct in periodically well-populated regions. We also define the minimum value of predict for which the algorithm is correct. Compared to the previously proposed solution also based on the notion of virtual mobile nodes, our algorithm has two advantages: (1) it tolerates the failure of one to all virtual mobile nodes; (2) as n grows, it remains correct with smaller values of predict. This feature makes the real-world deployment of the neighbor detector easier since with the existing prediction methods, location predictions usually tend to become less accurate as predict increases. We also show that the cost of our algorithm (in terms of communication) scales linearly with the number of virtual mobile nodes.

[1]  Norihisa Suzuki,et al.  Shared memory multiprocessing , 1992 .

[2]  Jennifer L. Welch,et al.  Reliable neighbor discovery for mobile ad hoc networks , 2014, Ad Hoc Networks.

[3]  Gustavo Alonso,et al.  Probabilistic protocols for node discovery in ad-hoc, single broadcast channel networks , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[4]  Steven A. Borbash,et al.  Birthday protocols for low energy deployment and flexible neighbor discovery in ad hoc wireless networks , 2001, MobiHoc '01.

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

[6]  Paul G. Spirakis,et al.  Fundamental control algorithms in mobile networks , 1999, SPAA '99.

[7]  Waylon Brunette,et al.  Data MULEs: modeling a three-tier architecture for sparse sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[8]  Ravi Jain,et al.  Location prediction algorithms for mobile wireless systems , 2003 .

[9]  François Ingelrest,et al.  A Turnover based Adaptive HELLO Protocol for Mobile Ad Hoc and Sensor Networks , 2007, 2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems.

[10]  Ravi Jain,et al.  Evaluating location predictors with extensive Wi-Fi mobility data , 2004, INFOCOM.

[11]  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.

[12]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[13]  Benoît Garbinato,et al.  Neighbor Detection Based on Multiple Virtual Mobile Nodes , 2016, 2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP).

[14]  G. C. Shephard,et al.  Tilings and Patterns , 1990 .

[15]  Benoît Garbinato,et al.  Improving Neighbor Detection for Proximity-Based Mobile Applications , 2013, 2013 IEEE 12th International Symposium on Network Computing and Applications.

[16]  Ellen W. Zegura,et al.  Message ferry route design for sparse ad hoc networks with mobile nodes , 2006, MobiHoc '06.

[17]  Hari Balakrishnan,et al.  6th ACM/IEEE International Conference on on Mobile Computing and Networking (ACM MOBICOM ’00) The Cricket Location-Support System , 2022 .

[18]  Paul G. Spirakis,et al.  An efficient communication strategy for ad-hoc mobile networks , 2001, PODC '01.

[19]  Benoît Garbinato,et al.  Effective and efficient neighbor detection for proximity-based mobile applications , 2015, Comput. Networks.

[20]  R. Phillips,et al.  The asymptotic distribution of lattice points in Euclidean and non-Euclidean spaces , 1982 .

[21]  Karthik Lakshmanan,et al.  U-connect: a low-latency energy-efficient asynchronous neighbor discovery protocol , 2010, IPSN '10.

[22]  Ellen W. Zegura,et al.  A message ferrying approach for data delivery in sparse mobile ad hoc networks , 2004, MobiHoc '04.

[23]  Qun Li,et al.  Sending messages to mobile users in disconnected ad-hoc wireless networks , 2000, MobiCom '00.

[24]  Adrian Holzer,et al.  Developing, Deploying and Evaluating Protocols with ManetLab , 2013, NETYS.

[25]  Mostafa H. Ammar,et al.  Message ferrying: proactive routing in highly-partitioned wireless ad hoc networks , 2003, The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems, 2003. FTDCS 2003. Proceedings..

[26]  Nancy A. Lynch,et al.  Virtual Mobile Nodes for Mobile Ad Hoc Networks , 2004, DISC.

[27]  Adrian Holzer,et al.  Spotcast -- A Communication Abstraction for Proximity-Based Mobile Applications , 2012, 2012 IEEE 11th International Symposium on Network Computing and Applications.

[28]  Ger Koole,et al.  The message delay in mobile ad hoc networks , 2005, Perform. Evaluation.

[29]  David Simplot-Ryl,et al.  An energy efficient adaptive HELLO algorithm for mobile ad hoc networks , 2013, MSWiM.

[30]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

[31]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[32]  Martin Vetterli,et al.  Locating Nodes with EASE: Mobility Diffusion of Last Encounters in Ad Hoc Networks , 2003, INFOCOM.

[33]  Emad Aboelela.  OSPF: Open Shortest Path First , 2003 .

[34]  Robin Kravets,et al.  Searchlight: helping mobile devices find their neighbors , 2011, MobiHeld '11.

[35]  Ravi Jain,et al.  Predictability of WLAN Mobility and Its Effects on Bandwidth Provisioning , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

[37]  Cecilia Mascolo,et al.  NextPlace: A Spatio-temporal Prediction Framework for Pervasive Systems , 2011, Pervasive.

[38]  Ellen W. Zegura,et al.  Controlling the mobility of multiple data transport ferries in a delay-tolerant network , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[39]  Zygmunt J. Haas,et al.  A new networking model for biological applications of ad hoc sensor networks , 2006, TNET.

[40]  Jennifer L. Welch,et al.  Autonomous virtual mobile nodes , 2005, SPAA.

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

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

[43]  Srdjan Capkun,et al.  Mobility helps security in ad hoc networks , 2003, MobiHoc '03.

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

[45]  Daniel Gatica-Perez,et al.  Contextual conditional models for smartphone-based human mobility prediction , 2012, UbiComp.

[46]  Waylon Brunette,et al.  Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks , 2003, Ad Hoc Networks.

[47]  I. Martin Isaacs.  Geometry for College Students , 2000 .

[48]  Benoît Garbinato,et al.  Using Virtual Mobile Nodes for Neighbor Detection in Proximity-Based Mobile Applications , 2014, 2014 IEEE 13th International Symposium on Network Computing and Applications.

[49]  David E. Culler,et al.  Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications , 2008, SenSys '08.