The K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks
Authors:
Open Access
- 1 June 2003
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 141-152
Abstract
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 k. 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 k that guarantees connectivity of the communication graph with high probability. We then define k-Neigh, a fully distributed, asynchronous, and localized protocol that follows the above approach and uses distance estimation. We prove that k-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.Keywords
This publication has 11 references indexed in Scilit:
- The critical transmitting range for connectivity in sparse wireless ad hoc networksIEEE Transactions on Mobile Computing, 2003
- Minimizing energy for wireless web access with bounded slowdown2002
- A power control MAC protocol for ad hoc networks2002
- Routing performance in the presence of unidirectional links in multihop wireless networks2002
- Location errors in wireless embedded sensor networksACM SIGMOBILE Mobile Computing and Communications Review, 2002
- Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks2001
- Channel access scheduling in Ad Hoc networks with unidirectional links2001
- Dynamic fine-grained localization in Ad-Hoc networks of sensors2001
- Power consumption in packet radio networksTheoretical Computer Science, 2000
- Minimum energy mobile wireless networksIEEE Journal on Selected Areas in Communications, 1999