Izvorni znanstveni članak

https://doi.org/10.24138/jcomss.v4i2.223

Efficiency of Unicast and Broadcast Gossip Algorithms for Wireless Sensor Networks

Elma Zanaj ; Università Politecnica delle Marche, Ancona, Italy
Marco Baldi orcid.org/0000-0002-8754-5526 ; Università Politecnica delle Marche, Ancona, Italy
Franco Chiaraluce orcid.org/0000-0001-6994-1448 ; Università Politecnica delle Marche, Ancona, Italy

Sažetak

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.

Ključne riječi

wireless sensor networks; averaging problems; gossip; convergence rate

Hrčak ID:

180511

URI

https://hrcak.srce.hr/180511

Datum izdavanja:

25.6.2008.

Posjeta: 1.036 *