Skip to main content

Deterministic Broadcasting in Radio Networks

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms
  • 125 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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Bruschi D, Del Pinto M (1997) Lower bounds for the broadcast problem in mobile radio networks. Distrib Comput 10(3):129–135

    Article  Google Scholar 

  2. Chlebus BS, Kowalski DR (2005) Almost optimal explicit selectors. In: Proceedings of 15th international symposium on fundamentals of computation theory, Lübeck, pp 270–280

    Google Scholar 

  3. Chlebus M, Gsieniec L, Östlin A, Robson JM (2000) Deterministic broadcasting in radio networks. In: Proceedings of 27th international colloquium on automata, languages and programming, Geneva. LNCS, vol 1853, pp 717–728

    Google Scholar 

  4. Chlebus BS, Gsieniec L, Gibbons AM, Pelc A, Rytter W (2002) Deterministic broadcasting in unknown radio networks. Distrib Comput 15(1): 27–38

    Article  Google Scholar 

  5. Chrobak M, Gsieniec L, Rytter W (2002) Fast broadcasting and gossiping in radio networks,. In: Proceedings of 41st annual symposium on foundations of computer science, Redondo Beach, 2000, pp 575–581; Full version in J Algorithms 43(2):177–189 (2002)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. De Bonis A, Gsieniec L, Vaccaro U (2005) Optimal two-stage algorithms for group testing problems. SIAM J Comput 34(5):1253–1270

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  11. Indyk P (2002) Explicit constructions of selectors and related combinatorial structures, with applications. In: Proceedings of 13th annual ACM-SIAM symposium on discrete algorithms, San Francisco, pp 697–704

    Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Leszek Gąsieniec .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Gąsieniec, L. (2016). Deterministic Broadcasting in Radio Networks. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_105

Download citation

Publish with us

Policies and ethics