ATTENZIONE! A partire dal 01/01/2017 questo sito non sarà più aggiornato. Il nuovo sito è create-net.fbk.eu

A greedy topology design to accelerate consensus in broadcast wireless sensor networks

Areas involved: 
OpenIoT
TitoloA greedy topology design to accelerate consensus in broadcast wireless sensor networks
Publication TypeJournal Article
Year of Publication2015
AuthorsVecchio, M., and R. Lopez-Valcarce
JournalInformation Processing Letters
Volume115
Numero3
Pagination408-413
ISSN Number0020-0190
Parole chiaveAverage consensus, Graph algorithms, Range assignment, Topology control, Wireless multicast advantage
Abstract

We present techniques to improve convergence speed of distributed average consensus algorithms in wireless sensor networks by means of topology design. A broadcast network is assumed, so that only the transmit power of each node can be independently controlled, rather than each individual link. Starting with a maximally connected configuration in which all nodes transmit at full power, the proposed methods successively reduce the transmit power of a chosen node in order to remove one and only one link; nodes are greedily selected either in order to yield fastest convergence at each step, or if they have the largest degree in the network. These greedy schemes provide a good complexity–performance tradeoff with respect to full-blown global search methods. As a side benefit, improving the convergence speed also results in savings in energy consumption with respect to the maximally connected setting.