Skip to main content
Springer Nature Link
Log in

Randomized Gossiping in Radio Networks

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 130 Accesses

Years and Authors of Summarized Original Work

  • 2001; Chrobak, Ga̧sieniec, Rytter

Problem Definition

The two classical problems of disseminating information in computer networks are broadcasting and gossiping. In broadcasting, the goal is to distribute a message from a distinguished source node to all other nodes in the networks. In gossiping, each node v in the network initially contains a message m v , and the task is to distribute each message m v to all 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, [6]). In some applications, collisions may be difficult to distinguish from the noise that is normally present in the...

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. Chrobak M, Ga̧sieniec L, Rytter W (2004) A randomized algorithm for gossiping in radio networks. In: Proceedings of 8th annual international computing combinatorics conference, Guilin, 2001, pp 483–492; Full version in Networks 43(2):119–124 (2004)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

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

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Liu D, Prabhakaran M (2002) On randomized broadcasting and gossiping in radio networks. In: Proceedings of 8th annual international computing combinatorics conference, Singapore, pp 340–349

    Google Scholar 

  6. 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 Ga̧sieniec

Authors
  1. Leszek Ga̧sieniec
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Leszek Ga̧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

Ga̧sieniec, L. (2016). Randomized Gossiping in Radio Networks. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_324

Download citation

Publish with us

Policies and ethics