Skip to main content
Springer Nature Link
Log in

Deterministic Broadcasting in Radio Networks

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 298 Accesses

Years and Authors of Summarized Original Work

  • 2000; Chrobak, Gąsieniec, Rytter

Problem Definition

One of the most fundamental communication problems in wired as well as wireless networks is broadcasting, where one distinguished source node has a message that needs to be sent to all other nodes in the network.

The radio network abstraction captures the features of distributed communication networks with multi-access channels, with minimal assumptions on the channel model and processors’ knowledge. Directed edges model unidirectional links, including situations in which one of two adjacent transmitters is more powerful than the other. In particular, there is no feedback mechanism (see, for example, [13]). In some applications, collisions may be difficult to distinguish from the noise that is normally present on the channel, justifying the need for protocols that do not depend on the reliability of the collision detection mechanism (see [9, 10]). Some network configurations are subject...

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

Access this chapter

Log in via an institution

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

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

  1. University of Liverpool, Liverpool, UK

    Leszek Gąsieniec

Authors
  1. Leszek Gąsieniec
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Leszek Gąsieniec .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

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