A Turnover based Adaptive HELLO Protocol for Mobile Ad Hoc and Sensor Networks

We present a turnover based adaptive HELLO protocol (TAP), which enables nodes in mobile networks to dynamically adjust their HELLO messages frequency depending on the current speed of nodes. To the best of our knowledge, all existing solutions are based on specific assumptions (e.g., slotted networks) and/or require specific hardware (e.g., GPS) for speed evaluation. One of the key aspects of our solution is that no additional hardware is required since it does not need this speed information. TAP may be used in any kind of mobile networks that rely on HELLO messages to maintain neighborhood tables and is thus highly relevant in the context of ad hoc and sensor networks. In our solution, each node has to monitor its neighborhood table to count new neighbors whenever a HELLO is sent. This turnover is then used to adjust HELLO frequency. To evaluate our solution, we propose a theoretical analysis based on some given assumptions that provides the optimal turnover when these assumptions hold. Our experimental results demonstrate that when this optimal value is used as the targeted turnover in TAP, the HELLO frequency is correctly adjusted and provides a good accuracy with regards to the neighborhood tables.

[1]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

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

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

[4]  Gregory A. Hansen,et al.  The Optimized Link State Routing Protocol , 2003 .

[5]  Carles Gomez,et al.  AHR: a two-state adaptive mechanism for link connectivity maintenance in AODV , 2006, REALMAN '06.

[6]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

[7]  Mukesh Singhal,et al.  Hello protocols for ad-hoc networks: overhead and accuracy tradeoffs , 2005, Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks.

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

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

[10]  Thomas Kunz,et al.  The Impact of a Realistic Physical Layer Model , 2003, ADHOC-NOW.

[11]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[12]  I.D. Chakeres,et al.  The utility of hello messages for determining link connectivity , 2002, The 5th International Symposium on Wireless Personal Multimedia Communications.

[13]  Gustavo Alonso,et al.  Probabilistic Protocols for Node Discovery in Ad Hoc Multi-channel Broadcast Networks , 2003, ADHOC-NOW.

[14]  이상하,et al.  임베디드 리눅스를 이용한 OLSR(Optimized Link State Routing Protocol)구현에 관한 연구 , 2009 .

[15]  Arnaud Troël Prise en compte de la mobilité dans les interactions de proximité entre terminaux à profils hétérogènes , 2004 .