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.

The K-neigh Protocol for Symmetric Topology Control in Ad Hoc Networks / D. M., Blough; Leoncini, Mauro; G., Resta; P., Santi. - STAMPA. - (2003), pp. 141-152. ((Intervento presentato al convegno Mobile Ad Hoc Networking and Computing tenutosi a Annapolis, MD, USA nel 1-3 giugno 2003.

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

LEONCINI, Mauro;
2003

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.
Mobile Ad Hoc Networking and Computing
Annapolis, MD, USA
1-3 giugno 2003
141
152
D. M., Blough; Leoncini, Mauro; G., Resta; P., Santi
The K-neigh Protocol for Symmetric Topology Control in Ad Hoc Networks / D. M., Blough; Leoncini, Mauro; G., Resta; P., Santi. - STAMPA. - (2003), pp. 141-152. ((Intervento presentato al convegno Mobile Ad Hoc Networking and Computing tenutosi a Annapolis, MD, USA nel 1-3 giugno 2003.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/465520
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 200
  • ???jsp.display-item.citation.isi??? ND
social impact