The K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks

摘要

We propose an approach to topology control based on the principle of maintaining the number of neighbors of every node equal to or slightly below a specific value κ. The approach enforces symmetry on the resulting communication graph, thereby easing the operation of higher layer protocols. To evaluate the performance of our approach, we estimate the value of κthat guarantees connectivity of the communication graph with high probability. We then define κ-NEIGH, a fully distributed, asynchronous, and localized protocol that follows the above approach and uses distance estimation. We prove that κ-NEIGH terminates at every node after a total of 2n messages have been exchanged (with n nodes in the network) and within strictly bounded time. Finally, we present simulations results which show that our approach is about 20% more energy-efficient than a widely-studied existing protocol.