Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 2001: STACS 2001 pp 158–169Cite as

Deterministic Radio Broadcasting at Low Cost

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2010))

Abstract

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.

This research was done during the stay of Anders Dessmark at the Université du Québec à Hull as a postdoctoral fellow.

Andrzej Pelc was supported in part by NSERC grant OGP 0008136.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  4. D. Bruschi and M. Del Pinto, Lower bounds for the broadcast problem in mobile radio networks, Distr. Comp. 10 (1997), 129–135.

    Article  Google Scholar 

  5. I. Chlamtac and S. Kutten, On broadcasting in radio networks-problem analysis and protocol design, IEEE Transactions on Communications 33 (1985), 1240–1246.

    Article  MATH  Google Scholar 

  6. I. Chlamtac and S. Kutten, Tree based broadcasting in multihop radio networks, IEEE Trans. on Computers 36, (1987), 1209–1223.

    Article  Google Scholar 

  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 

  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.

    Article  MATH  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 

  13. P. Fraigniaud and E. Lazard, Methods and problems of communication in usual networks, Disc. Appl. Math. 53 (1994), 79–133.

    Article  MATH  MathSciNet  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 

  15. R. Gallager, A Perspective on Multiaccess Channels, IEEE Trans. on Information Theory 31 (1985), 124–142.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  MATH  MathSciNet  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 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Lund Institute of Technology, Box 118, S-22100, Lund, Sweden

    Anders Dessmark

  2. Département d’Informatique, Université du Québec à Hull, Québec J8X 3X7, Hull, Canada

    Andrzej Pelc

Authors
  1. Anders Dessmark
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrzej Pelc
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. I3S & INRIA Sophia Antipolis INRIA, CNRS, 2004 Route des Lucioles, 06902, Sophia-Antipolis, France

    Afonso Ferreira

  2. Institut für Theoretische Informatik, Fakultät Informatik, TU Dresden, 01062, Dresden, Germany

    Horst Reichel

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dessmark, A., Pelc, A. (2001). Deterministic Radio Broadcasting at Low Cost. In: Ferreira, A., Reichel, H. (eds) STACS 2001. STACS 2001. Lecture Notes in Computer Science, vol 2010. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44693-1_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-44693-1_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41695-1

  • Online ISBN: 978-3-540-44693-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation