Reducing Packet Transmissions in Ad Hoc Routing Protocols by Adaptive Neighbor Discovery.
Sven Hanemann, Ralph Jansen, Bernd Freisleben · 2003
An ad hoc network is a collection of mobile wireless nodes forming a temporary network without any established infrastructure. Dynamic network topology changes due to node mobility, limited transmission range, limited channel bandwidth and limited power supply require the use of dedicated routing protocols. To operate well, such routing protocols must rely on a method for efficiently discovering neighbor connections in a highly dynamic environment. However, neighbor detection may consume as much bandwidth as routing itself. In this paper, we present an algorithm which dynamically adapts itself to the movements of nodes to achieve maximal neighbor detection accuracy with minimum bandwidth consumption. Particular emphasis is put on the detection quality among nodes with strongly different moving speeds.