Hello Protocols for Ad-Hoc Networks: Overhead and Accuracy Tradeoffs

  • Authors:
  • Venkata C. Giruka;Mukesh Singhal

  • Affiliations:
  • University of Kentucky;University of Kentucky

  • Venue:
  • WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The hello protocol [17] is a fundamental protocol for wired and wireless networks. In mobile ad-hoc networks, a hello protocol helps nodes to establish a neighbor table for link detection. If nodes exchange position information in hello packets, then it also helps them in packet forwarding decisions. In ad-hoc networks, due to node mobility, neighbor relationship changes frequently. To cope with mobility and to have up-to-date neighbor table,nodes advertise hello packets periodically. These hello packets create congestion in the network, which may drop control and data packets in the network. In this paper, we study the impact of hello protocols on ad-hoc networks. We present three new hello protocols, which reduce network congestion. The main idea behind all the three protocols is to beacon as minimum as possiblewithout compromising the accuracy of the neighbor table. To evaluate the performance of our protocols and their impact on ad-hoc networks, we simulated them in GloMoSim 2.03. Our simulation results showed that the proposed hello protocols incur much lower overhead and increase the network performance compared to periodic hello protocol, while maintaining identical neighbor table accuracy.