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

Abstract

Abstract-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.

Mobility Prediction Based Neighborhood Discovery in Mobile Ad Hoc Networks

“…Through extensive simulation, we study the performance of ARH using real mobility trace data, in comparison with the best known competitive hello protocol TAP (Turnover based Adaptive hello Protocol) [9]. Our simulation results indicate that both protocols require a short learning curve to stabilize.…”

“…ARH evolves along with network dynamics, and seamlessly tunes itself to the optimal configuration on the fly using local knowledge only. Through simulation, we demonstrate the effectiveness and efficiency of ARH, in comparison with the only competitive protocol TAP (Turnover based Adaptive hello Protocol) [9]. With a small model order, ARH achieves the same high neighborhood discovery performance as TAP, with dramatically reduced message overhead (about 50% lower 'hello' rate).…”

Distribution of the Maximum Waiting time of a Hello Message in Ad hoc Networks

“…Proof The proof is based on the factorization methods (see section 2.2, in particular the expressions (4) and (6)). …”

“…The nodes transmit regularly the Hello messages to indicate their presences to their neighborhood. The Hello messages play a very important role in the data transmission between the Ad hoc nodes and also in their localization [3]- [4].…”

A novel family of geometric planar graphs for wireless ad hoc networks

“…Two nodes are neighbors (i.e., have an edge in between) if and only if they are within each other's transmission range (i.e., unit disk). Periodic 'hello' message is a basic ad hoc networking technique for neighborhood discovery [6]. By this technique, each node is able to gather the location information of all neighboring nodes.…”