A randomized algorithm for gossiping in radio networks

Authors:
Affiliations:
Venue:
Networks
Year:
2004

Citing 0
Cited 4

Performance analysis of a distributed comparison-based self-diagnosis protocol for wireless ad-hoc networks

Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
A survey of autonomic communications

ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Sensor network gossiping or how to break the broadcast lower bound

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
On efficient gossiping in radio networks

SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an O(n log4n)-time randomized algorithm for gossiping in radio networks with unknown topology. This is the first algorithm for gossiping in this model whose running time is only a polylogarithmic factor away from the optimum. The fastest previously known (deterministic) algorithm for this problem works in time O(n3/2log2n). © 2004 Wiley Periodicals, Inc.