Skip to main content

A Randomized Algorithm for Gossiping in Radio Networks

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

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

Included in the following conference series:

Abstract

We present an O(n log4 n)-time randomized algorithm for gossiping in radio networks with unknown topology. This is the first algorithm for gossiping in this model whose running time is only a polylogarithmic factor away from the optimum. The fastest previously known (deterministic) algorithm for this problem works in time O(n 3/2 log2 n).

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

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

    Article  MATH  MathSciNet  Google Scholar 

  2. N. Alon, A. Bar-Noy, N. Linial and D. Peleg, Single round simulation of radio networks, Journal of Algorithms 13 (1992) 188–210.

    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. R. Bar-Yehuda, A. Israeli, and A. Itai, Multiple communication in multi-hop radio networks, SIAM Journal on Computing 22 (1993) 875–887.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  6. B.S. Chlebus, L. Gősieniec, A.M. Gibbons, A. Pelc, and W. Rytter, Deterministic broadcasting in unknown radio networks, in Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms, San Francisco, California, 2000, pp. 861–870.

    Google Scholar 

  7. M. Chlebus, L. Gősieniec, A. Östlin and J.M. Robson, Deterministic broadcasting in radio networks, Proc. 27th International Colloquium on Automata, Languages and Programming, ICALP’2000.

    Google Scholar 

  8. 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 

  9. M. Chrobak, L. Gősieniec and W. Rytter, Fast broadcasting and gossiping in radio networks, 41st Annual IEEE Conference on Foundations of Computer Science, FOCS’00, 2000, pp. 575–581.

    Google Scholar 

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

    Google Scholar 

  11. G. De Marco and A. Pelc, Faster broadcasting in unknown radio networks, unpublished manuscript, 1999.

    Google Scholar 

  12. A. Ephremides and B. Hajek, Information theory and communication networks: an unconsummated union, IEEE Trans. on Inf. Theory, IT-44 (1998) 2416–2434.

    Article  MathSciNet  Google Scholar 

  13. R. Gallager, A perspective on multiaccess communications, IEEE Trans. on Inf. Theory, IT-31 (1985) 124–142.

    Article  MathSciNet  Google Scholar 

  14. I. Gaber and Y. Mansour, Broadcast in radio networks, in Proc. 6th Ann. ACMSIAM Symp. on Discrete Algorithms, 1995, pp. 577–585.

    Google Scholar 

  15. S.T. Hedetniemi, S.T. Hedetniemi, and A.L. Liestman, A survey of gossiping and broadcasting in communicatio nnetworks, Networks 18 (1988) 319–349.

    Article  MATH  MathSciNet  Google Scholar 

  16. J. Komlos and A.G. Greenberg, An asymptotically nonadaptive algorithm for conflict resolution in multiple-access channels, IEEE Trans. on Inf. Theory, IT-31 (1985) 302–306.

    Article  MathSciNet  Google Scholar 

  17. E. Kranakis, D. Krizanc and A. Pelc, Fault-tolerant broadcasting in radio networks, in Proc. 6th European Symposium on Algorithms, Venice, Italy, 1998, Springer LNCS 1461, pp. 283–294.

    Google Scholar 

  18. E. Kushilevitz and Y. Mansour, An O(Dlg(N/D)) lower bound for broadcast in radio networks, SIAM Journal on Computing 27 (1998) 702–712.

    Article  MATH  MathSciNet  Google Scholar 

  19. E. Kushilevitz and Y. Mansour, Computation in noisy radio networks, in Proc. 9th Ann. ACM-SIAM Symp. on Discrete Algorithms, 1998, pp. 236–243.

    Google Scholar 

  20. J.L. Massey and P. Mathys, The collision channel without feedback, IEEE Trans. on Inf. Theory, IT-31 (1985) 192–204.

    Article  MathSciNet  Google Scholar 

  21. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.

    Google Scholar 

  22. K. Pahlavan and A. Levesque, Wireless Information Networks, Wiley-Interscience, New York, 1995.

    Google Scholar 

  23. D. Peleg, Deterministic radio broadcast with no topological knowledge, manuscript, 2000.

    Google Scholar 

  24. K. Ravishankar and S. Singh, Asymptotically optimal gossiping in radio networks, Discr. Appl. Math. 61 (1995) 61–82.

    Article  MATH  MathSciNet  Google Scholar 

  25. K. Ravishankar and S. Singh, Gossiping on a ring with radios, Parallel Processing Letters 6 (1996), p. 115–126.

    Article  Google Scholar 

  26. A. Sen and M.L. Huson, A new model for scheduling packet radio networks, in Proc. 15th Ann. Joint Conference of the IEEE Computer and Communication Societies, 1996, pp. 1116–1124.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chrobak, M., Gąsieniec, L., Rytter, W. (2001). A Randomized Algorithm for Gossiping in Radio Networks. In: Wang, J. (eds) Computing and Combinatorics. COCOON 2001. Lecture Notes in Computer Science, vol 2108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44679-6_54

Download citation

  • DOI: https://doi.org/10.1007/3-540-44679-6_54

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42494-9

  • Online ISBN: 978-3-540-44679-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics