MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Probabilistic Protocols for Node Discovery in Ad-Hoc, Single Broadcast Channel Networks
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Hello Protocols for Ad-Hoc Networks: Overhead and Accuracy Tradeoffs
WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
AHR: a two-state adaptive mechanism for link connectivity maintenance in AODV
REALMAN '06 Proceedings of the 2nd international workshop on Multi-hop ad hoc networks: from theory to reality
Analysis of the impact of hello protocol parameters over a wireless network self-organization
Proceedings of the 4th ACM workshop on Performance evaluation of wireless ad hoc, sensor,and ubiquitous networks
A Turnover based Adaptive HELLO Protocol for Mobile Ad Hoc and Sensor Networks
MASCOTS '07 Proceedings of the 2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
A performance model of neighbor discovery in proactive routing protocols
Proceedings of the 7th ACM workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Towards Energy-Efficient Algorithm-Based Estimation in Wireless Sensor Networks
MSN '10 Proceedings of the 2010 Sixth International Conference on Mobile Ad-hoc and Sensor Networks
Delay-bounded and energy-efficient data aggregation
Wireless Communications & Mobile Computing
Mobility prediction in mobile wireless networks
Journal of Network and Computer Applications
Transmission range adaptation based energy efficient neighborhood discovery
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
An energy efficient adaptive HELLO algorithm for mobile ad hoc networks
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
Hi-index | 0.00 |
Hello protocol is the basic technique for neighborhood discovery in wireless ad hoc networks. It requires nodes to claim their existence/ aliveness by periodic 'hello' messages. Central to a hello protocol is the determination of 'hello' message transmission rate. No fixed optimal rate exists in the presence of node mobility. The rate should in fact adapt to it, high for high mobility and low for low mobility. In this paper, we propose a novel mobility prediction based hello protocol, named ARH (Autoregressive Hello protocol). Each node predicts its own position by an ever-updated autoregression-based mobility model, and neighboring nodes predict its position by the same model. The node transmits 'hello' message (for location update) only when the predicted location is too different from the true location (causing topology distortion), triggering mobility model correction on both itself and each of its neighbors. 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).