Brief announcement: k-shot distributed broadcasting in radio networks

Authors:
Paraschos Koutris;Aris Pagourtzis
Affiliations:
National Technical University of Athens, Athens, Greece;National Technical University of Athens, Athens, Greece
Venue:
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Year:
2010

Citing 3
Cited 2

Deterministic Radio Broadcasting

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Time-efficient broadcasting in radio networks: a review

ICDCIT'07 Proceedings of the 4th international conference on Distributed computing and internet technology
Efficient k-shot broadcasting in radio networks

DISC'09 Proceedings of the 23rd international conference on Distributed computing

Oblivious k-shot broadcasting in ad hoc radio networks

CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Oblivious k-shot broadcasting in ad hoc radio networks

CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study distributed broadcasting protocols with few transmissions ('shots') in radio networks with unknown topology. In particular, we examine the case in which a bound k is given and a node may transmit at most k times during the broadcasting protocol. We focus on almost oblivious algorithms for k-shot broadcasting, that is, algorithms where the nodes decide whether to transmit or not with very little consideration of the transmission history. In this context, we show a lower bound of Ω(n2/k) on the broadcasting time of any almost oblivious k-shot broadcasting algorithm. We also present an almost oblivious protocol that matches the above lower bound for every k≤√n.