Skip to main content

Deterministic Broadcasting in Radio Networks

2000; Chrobak, Gąsieniec, Rytter

  • Reference work entry
Book cover Encyclopedia of Algorithms
  • 202 Accesses

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 399.00
Price excludes VAT (USA)
  • Available as EPUB and 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

Recommended Reading

  1. Bruschi, D., Del Pinto, M.: Lower Bounds for the Broadcast Problem in Mobile Radio Networks. Distrib. Comput. 10(3), 129–135 (1997)

    Article  Google Scholar 

  2. Chlebus, B.S., Gąsieniec, L., Gibbons, A.M., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. Distrib. Comput. 15(1), 27–38 (2002)

    Article  Google Scholar 

  3. Chlebus, M., Gąsieniec, L., Östlin, A., Robson, J.M.: Deterministic broadcasting in radio networks. In: Proc. 27th International Colloquium on Automata, Languages and Programming.LNCS, vol. 1853, pp. 717–728, Geneva, Switzerland (2000)

    Google Scholar 

  4. Chlebus, B.S., Kowalski, D.R.: Almost Optimal Explicit Selectors. In: Proc. 15th International Symposium on Fundamentals of Computation Theory, pp. 270–280, Lübeck, Germany (2005)

    Google Scholar 

  5. Chrobak, M., Gąsieniec, L., Rytter, W.: Fast Broadcasting and Gossiping in Radio Networks,. In: Proc. 41st Annual Symposium on Foundations of Computer Science, pp. 575–581, Redondo Beach, USA (2000) Full version in J. Algorithms 43(2) 177–189 (2002)

    Google Scholar 

  6. Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. J. Algorithms 60(2), 115–143 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  7. De Bonis, A., Gąsieniec, L., Vaccaro, U.: Optimal Two-Stage Algorithms for Group Testing Problems. SIAM J. Comput. 34(5), 1253–1270 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  8. De Marco, G., Pelc, A.: Faster broadcasting in unknown radio networks. Inf. Process. Lett. 79(2), 53–56 (2001)

    Article  MATH  Google Scholar 

  9. Ephremides, A., Hajek, B.: Information theory and communication networks: an unconsummated union. IEEE Trans. Inf. Theor. 44, 2416–2434 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  10. Gallager, R.: A perspective on multiaccess communications. IEEE Trans. Inf. Theor. 31, 124–142 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  11. Indyk, P.: Explicit constructions of selectors and related combinatorial structures, with applications. In: Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 697–704, San Francisco, USA (2002)

    Google Scholar 

  12. Kowalski, D.R., Pelc, A.: Broadcasting in undirected ad hoc radio networks. Distr. Comput. 18(1), 43–57 (2005)

    Article  Google Scholar 

  13. Massey, J.L., Mathys, P.: The collision channel without feedback. IEEE Trans. Inf. Theor. 31, 192–204 (1985)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Gąsieniec, L. (2008). Deterministic Broadcasting in Radio Networks. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30162-4_105

Download citation

Publish with us

Policies and ethics