Deterministic Radio Broadcasting at Low Cost
We consider the problem of distributed deterministic broad- casting in radio networks. The network is synchronous. A node receives a message in a given round if and only if exactly one of its neighbors transmits. The source message has to reach all nodes. We assume that nodes do not know network topology or even their immediate neighbor- hood. We are concerned with two efficiency measures of broadcasting algorithms: its execution time (number of rounds), and its cost (number of transmissions). We focus our study on execution time of algorithms which have cost close to minimum.
We consider two scenarios depending on whether nodes know or do not know global parameters of the network: the number n of nodes and the eccentricity D of the source. Our main contribution are lower bounds on time of low-cost broadcasting which show sharp differences between these scenarios.
KeywordsRadio Network Binary Sequence Collision Detection Global Parameter Reachability Graph
Unable to display preview. Download preview PDF.
- 7.B.S. Chlebus, L. Gąsieniec, A. Gibbons, A. Pelc and W. Rytter Deterministic broadcasting in unknown radio networks, Proc. 11th Ann. ACM-SIAM Symposium on Discrete Algorithms, SODA’2000, 861–870.Google Scholar
- 8.B.S. Chlebus, L. Gąsieniec, A. Östlin and J.M. Robson, Deterministic radio broadcasting, Proc. 27th Int. Coll. on Automata, Languages and Programming, ICALP’2000,July 2000,Geneva, Switzerland, LNCS 1853, 717–728.Google Scholar
- 9.M. Chrobak, L. Gaşieniec and W. Rytter, Fast broadcasting and gossiping in radio networks, Proc. FOCS 2000, to appear.Google Scholar
- 11.G. De Marco and A. Pelc, Faster broadcasting in unknown radio networks, Inf. Proc. Letters, to appear.Google Scholar
- 12.K. Diks, E. Kranakis, D. Krizanc and A. Pelc, The impact of knowledge on broadcasting time in radio networks, Proc. 7th Annual European Symposium on Algorithms, ESA’99, Prague, Czech Republic,July 1999, LNCS 1643, 41–52.Google Scholar
- 14.I. Gaber and Y. Mansour, Broadcast in Radio Networks, Proc. 6th Ann. ACMSIAM Symp. on Discrete Algorithms, SODA’95, 577–585.Google Scholar
- 17.E. Kranakis, D. Krizanc and A. Pelc, Fault-tolerant broadcasting in radio networks, Proc. 6th Annual European Symposium on Algorithms, ESA’98, Venice, Italy, August 1998, LNCS 1461, 283–294.Google Scholar
- 18.E. Kushilevitz and Y. Mansour, An Ω (Dlog(N/D)) Lower Bound for Broadcast in Radio Networks, Proc. 12th Ann. ACM Symp. on Principles of Distributed Computing (1993), 65–73.Google Scholar
- 19.E. Kushilevitz and Y. Mansour, Computation in noisy radio networks, Proc. 9th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA’98), 157–160.Google Scholar
- 20.D. Peleg, Deterministic radio broadcast with no topological knowledge, manuscript (2000).Google Scholar