Oblivious k-shot broadcasting in ad hoc radio networks

Authors:
Paraschos Koutris;Aris Pagourtzis
Affiliations:
National Technical University of Athens, Polytechnioupoli Zografou, Athens, Greece;National Technical University of Athens, Polytechnioupoli Zografou, Athens, Greece
Venue:
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Year:
2011

Citing 15
Cited 0

On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Deterministic broadcasting in unknown radio networks

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Faster broadcasting in unknown radio networks

Information Processing Letters
Explicit constructions of selectors and related combinatorial structures, with applications

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Deterministic Radio Broadcasting

ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Fast broadcasting and gossiping in radio networks

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Distributed broadcast in radio networks of unknown topology

Theoretical Computer Science
Broadcasting in undirected ad hoc radio networks

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Broadcasting Algorithms in Radio Networks with Unknown Topology

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Time of Deterministic Broadcasting in Radio Networks with Local Knowledge

SIAM Journal on Computing
Lower bounds for the broadcast problem in mobile radio networks

Distributed Computing
Distributed broadcast in unknown radio networks

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Energy efficient randomised communication in unknown AdHoc networks

Theoretical Computer Science
Efficient k-shot broadcasting in radio networks

DISC'09 Proceedings of the 23rd international conference on Distributed computing
Brief announcement: k-shot distributed broadcasting in radio networks

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study distributed broadcasting protocols with few transmissions ('shots') in radio networks of 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 oblivious algorithms, that is, algorithms where each node decides whether to transmit or not with no consideration of the transmission history. Our main contributions are (a) a lower bound of Ω(n2/k) on the broadcasting time of any oblivious k-shot broadcasting algorithm and (b) an oblivious broadcasting protocol that achieves a matching upper bound, namely O(n2/k), for every k ≤ √n and an upper bound of O(n3/2) for every k √n. We also initiate the study of the behavior of general broadcasting protocols by showing an Ω(n2) lower bound for any adaptive 1-shot broadcasting protocol.