Skip to main content
SpringerLink
Log in

On Randomized Broadcasting and Gossiping in Radio Networks

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2002)

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

Included in the following conference series:

Abstract

This paper has two parts. In the first part we give an alternative (and much simpler) proof for the best known lower bound of Ω(Dlog(N/D)) time-steps for randomized broadcasting in radio networks with unknown topology. In the second part we give an O(N log3 N)-time randomized algorithm for gossiping in such radio networks. This is an improvement over the fastest previously known algorithm that works intime O(N log4 N).

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast, Journal of Computer and System Sciences 43 (1991), 290–298.

    Article  MATH  MathSciNet  Google Scholar 

  2. Awerbuch, B.: A New Distributed Depth-First-Search Algorithm, Information Processing Letters, 20, (1985), 147–150.

    Article  MATH  Google Scholar 

  3. Bar-Yehuda, R., Goldreich, O., Itai, A.: Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection, Distributed Computing 5 (1991), 67–71.

    Article  MATH  Google Scholar 

  4. Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization, Journal of Computer and System Sciences 45 (1992), 104–126.

    Article  MATH  MathSciNet  Google Scholar 

  5. Bruschi, D., Del Pinto, M.: Lower bounds for the broadcast problem in mobile radio networks, Distributed Computing 10 (1997), 129–135.

    Article  Google Scholar 

  6. Chlebus, B.S.: Randomized communication in radio networks, A chapter in Handbook on Randomized Computing, eds. Pardalos, P.M., Rajasekaran, S., Reif, J., Rolim, J.D.P., Kluwer Academic Publishers, to be published.

    Google Scholar 

  7. Chlebus, B.S., Gçsieniec, L., Gibbons, A.M., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks, Proc. 11th Annual ACM-SIAM Symp. on Discrete Algorithms, SODA (2000), 861–870.

    Google Scholar 

  8. Chlebus, B.S., Gçsieniec, L., Östlin, A., Robson, J.M.: Deterministic radio broadcasting, Proc. 27th International Colloquium on Automata, Languages and Programming, ICALP (2000).

    Google Scholar 

  9. Chrobak, M., Gçsieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks, Proc. 41st Annual IEEE Conference on Foundations of Computer Science, FOCS (2000), 575–581.

    Google Scholar 

  10. Chrobak, M., Gçsieniec, L., Rytter, W.: A randomized algorithm for gossiping in radio networks, Proceedings of 7th Annual International Computing and Combinatorics Conference, COCOON (2001), 483–492.

    Google Scholar 

  11. Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting in unknown radio networks, Proc. 12th Annual ACM-SIAM Symp. on Discrete Algorithms, SODA (2001), 709–718.

    Google Scholar 

  12. Diks, K., Kranakis, E., Krizanc, D., Pelc, A.: The impact of knowledge on broadcasting time in radio networks, Proc. 7th European Symp. on Algorithms, ESA (1999), 41–52.

    Google Scholar 

  13. Gaber, I., Mansour, Y.: Broadcast in radio networks, Proc. 6th Annual ACM-SIAM Symp. on Discrete Algorithms, SODA (1995), 577–585.

    Google Scholar 

  14. Gallager, R.: A perspective on multiaccess channels, IEEE Transactions on Information Theory, 31 (1985), 124–142.

    Article  MATH  MathSciNet  Google Scholar 

  15. Hedetniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A survey of gossiping and broadcasting in communication networks, Networks 18(1988), 319–359.

    Article  MATH  MathSciNet  Google Scholar 

  16. Indyk, P.: Explicit constructions of selectors with applications, Proc. 13th Annual ACM-SIAM Symp. on Discrete Algorithms, SODA (2002), 697–704.

    Google Scholar 

  17. Kushilevitz, E., Mansour, Y.: An Ω(DlogiN/D)) lower bound for broadcast in radio networks, SIAM Journal on Computing 27 (1998), 702–712.

    Article  MATH  MathSciNet  Google Scholar 

  18. Kushilevitz, E., Mansour, Y.: Computation in noisy radio networks, Proc. 9th Annual ACM-SIAM Symp. on Discrete Algorithms, SODA (1998), 236–243.

    Google Scholar 

  19. Tanenbaum, A.S.: Computer Networks, Prentice-Hall, Englewood Cliffs, NJ, 1981.

    Google Scholar 

  20. Yao, A. C-C.: Probabilistic computations: Towards a unified measure of complexity, Proc. 18th Annual IEEE Conference on Foundations of Computer Science, FOCS (1977), 222–227.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Princeton University, Princeton, NJ, 08544, USA

    Ding Liu & Manoj Prabhakaran

Authors
  1. Ding Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manoj Prabhakaran
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara, California, 93106, USA

    Oscar H. Ibarra

  2. Department of Mathematics, National University of Singapore, Singapore, Singapore, 117543

    Louxin Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, D., Prabhakaran, M. (2002). On Randomized Broadcasting and Gossiping in Radio Networks. In: Ibarra, O.H., Zhang, L. (eds) Computing and Combinatorics. COCOON 2002. Lecture Notes in Computer Science, vol 2387. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45655-4_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-45655-4_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43996-7

  • Online ISBN: 978-3-540-45655-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation