Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Randomized Broadcasting in Radio Networks

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 44 Accesses

Years and Authors of Summarized Original Work

  • 1992; Reuven Bar-Yehuda, Goldreich, Itai

Problem Definition

This entry investigates deterministic and randomized protocols for achieving broadcast (distributing a message from a source to all other nodes) in arbitrary multi-hop synchronous radio networks.

The model consists of an arbitrary (undirected) network, with processors communicating in synchronous time-slots subject to the following rules. In each time-slot, each processor acts either as a transmitter or as a receiver. A processor acting as a receiver is said to receive a message in time-slot t if exactly one of its neighbors transmits in that time-slot. The message received is the one transmitted. If more than one neighbor transmits in that time-slot, a conflictoccurs. In this case, the receiver may either get a message from one of the transmitting neighbors or get no message. It is assumed that conflicts (or “collisions”) are not detected, hence a processor cannot distinguish...

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 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. Alon N, Bar-Noy A, Linial N, Peleg D (1991) A lower bound for radio broadcast. J Comput Syst Sci 43(2):290–298

    Article  MathSciNet  MATH  Google Scholar 

  2. Bar-Yehuda R, Goldreich O, Itai A (1992) On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization. J Comput Syst Sci 45(1): 104–126

    Article  MathSciNet  MATH  Google Scholar 

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

  4. Hofri M (1987) A feedback-less distributed broadcast algorithm for multihop radio networks with time-varying structure. In: Computer performance and reliability: 2nd international models of communication system, Rome, 25-29 May 1987. North Holland (1988), pp 353–368

    Google Scholar 

  5. Kowalski DR, Pelc A (2002) Deterministic broadcasting time in radio networks of unknown topology. In: FOCS’02: proceedings of the 43rd symposium on foundations of computer science, Washington, DC. IEEE Computer Society, pp 63–72

    Google Scholar 

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

    Article  MATH  Google Scholar 

  7. Kushilevitz E, Mansour Y (1993) An \(\Omega (d\log (n/d))\) lower bound for broadcast in radio networks. In: PODC’93, Los Angeles, California, pp 65–74

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technion, Haifa, Israel

    Alon Itai

Authors
  1. Alon Itai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alon Itai .

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

Itai, A. (2016). Randomized 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_322

Download citation

Publish with us

Policies and ethics

Search

Navigation