Efficiency of Unicast and Broadcast Gossip Algorithms for Wireless Sensor Networks
Abstract
Gossip is a well-known technique for distributed computing in an arbitrarily connected network, that can be adopted effectively in wireless sensor networks. Gossip algorithms have been widely studied in previous literature, but mostly from a theoretical point of view. The aim of this paper is to verify the behavior of the gossip approach in practical scenarios, through the analysis and interpretation of simulated results. So, we investigate the impact of optimizing the neighbor selection probabilities, the effect of multiple link failures and that of limited transmission radius. The possibility to use broadcast-like algorithms to increase the rate of convergence in averaging problems is also discussed and its advantage estimated.
Keywords
Wireless Sensor Networks, averaging problems, gossip, convergence rate
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
E. Zanaj, M. Baldi and F. Chiaraluce, "Efficiency of Unicast and Broadcast Gossip Algorithms for Wireless Sensor Networks," in Journal of Communications Software and Systems, vol. 4, no. 2, pp. 105-112, June 2008, doi: 10.24138/jcomss.v4i2.223
@article{zanaj2008efficiencyunicast,
author = {Elma Zanaj and Marco Baldi and Franco Chiaraluce},
title = {Efficiency of Unicast and Broadcast Gossip Algorithms for Wireless Sensor Networks},
journal = {Journal of Communications Software and Systems},
month = {6},
year = {2008},
volume = {4},
number = {2},
pages = {105--112},
doi = {10.24138/jcomss.v4i2.223},
url = {https://doi.org/10.24138/jcomss.v4i2.223}
}