Deterministic Radio Broadcasting at Low Cost

  • Anders Dessmark
  • Andrzej Pelc
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2010)


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.


Radio Network Binary Sequence Collision Detection Global Parameter Reachability Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    N. Alon, A. Bar-Noy, N. Linial and D. Peleg, A lower bound for radio broadcast, J. of Computer and System Sciences 43, (1991), 290–298.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    B. Awerbuch, O. Goldreich, D. Peleg and R. Vainish, A Tradeoff Between Information and Communication in Broadcast Protocols, J. ACM 37, (1990), 238–256.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    R. Bar-Yehuda, O. Goldreich, and A. Itai, On the time complexity of broadcast in radio networks: An exponential gap between determinism and randomization, Journal of Computer and System Sciences 45 (1992), 104–126.zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    D. Bruschi and M. Del Pinto, Lower bounds for the broadcast problem in mobile radio networks, Distr. Comp. 10 (1997), 129–135.CrossRefGoogle Scholar
  5. 5.
    I. Chlamtac and S. Kutten, On broadcasting in radio networks-problem analysis and protocol design, IEEE Transactions on Communications 33 (1985), 1240–1246.zbMATHCrossRefGoogle Scholar
  6. 6.
    I. Chlamtac and S. Kutten, Tree based broadcasting in multihop radio networks, IEEE Trans. on Computers 36, (1987), 1209–1223.CrossRefGoogle Scholar
  7. 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. 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. 9.
    M. Chrobak, L. Gaşieniec and W. Rytter, Fast broadcasting and gossiping in radio networks, Proc. FOCS 2000, to appear.Google Scholar
  10. 10.
    A. Czumaj, L. Gaşieniec and A. Pelc, Time and cost trade-offs in gossiping, SIAM J. on Discrete Math. 11 (1998), 400–413.zbMATHCrossRefGoogle Scholar
  11. 11.
    G. De Marco and A. Pelc, Faster broadcasting in unknown radio networks, Inf. Proc. Letters, to appear.Google Scholar
  12. 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
  13. 13.
    P. Fraigniaud and E. Lazard, Methods and problems of communication in usual networks, Disc. Appl. Math. 53 (1994), 79–133.zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    I. Gaber and Y. Mansour, Broadcast in Radio Networks, Proc. 6th Ann. ACMSIAM Symp. on Discrete Algorithms, SODA’95, 577–585.Google Scholar
  15. 15.
    R. Gallager, A Perspective on Multiaccess Channels, IEEE Trans. on Information Theory 31 (1985), 124–142.zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    S.M. Hedetniemi, S.T. Hedetniemi and A.L. Liestman, A survey of Gossiping and Broadcasting in Communication Networks, Networks 18 (1988), 319–349.zbMATHCrossRefMathSciNetGoogle Scholar
  17. 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. 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. 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. 20.
    D. Peleg, Deterministic radio broadcast with no topological knowledge, manuscript (2000).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Anders Dessmark
    • 1
  • Andrzej Pelc
    • 2
  1. 1.Department of Computer ScienceLund Institute of TechnologyLundSweden
  2. 2.Département d’InformatiqueUniversité du Québec à HullHullCanada

Personalised recommendations