Skip to main content
SpringerLink
Log in

Broadcasting in Geometric Radio Networks

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 40 Accesses

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

Notes

  1. 1.

    Research partially supported by NSERC discovery grant and by the Research Chair in Distributed Computing at the Université du Québec en Outaouais.

Recommended Reading

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

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  3. Chlebus BS, Gasieniec L, Gibbons A, Pelc A, Rytter W (2002) Deterministic broadcasting in ad hoc radio networks. Distrib Comput 15:27–38

    Article  MATH  Google Scholar 

  4. Dessmark A, Pelc A (2001) Tradeoffs between knowledge and time of communication in geometric radio networks. In: Proceedings of 13th annual ACM symposium on parallel algorithms and architectures (SPAA 2001), Heraklion, pp 59–66

    Google Scholar 

  5. Dessmark A, Pelc A (2007) Broadcasting in geometric radio networks. J Discret Algorithms 5:187–201

    Article  MathSciNet  MATH  Google Scholar 

  6. Diks K, Kranakis E, Krizanc D, Pelc A (2002) The impact of knowledge on broadcasting time in linear radio networks. Theor Comput Sci 287:449–471

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  8. Gasieniec L, Kowalski DR, Lingas A, Wahlen M (2008) Efficient broadcasting in known geometric radio networks with non-uniform ranges. In: Proceedings of 22nd international symposium on distributed computing (DISC 2008), Arcachon, pp 274–288

    Google Scholar 

  9. Kranakis E, Krizanc D, Pelc A (2001) Fault-tolerant broadcasting in radio networks. J Algorithms 39:47–67

    Article  MathSciNet  MATH  Google Scholar 

  10. Pelc A, Peleg D (2007) Feasibility and complexity of broadcasting with random transmission failures. Theor Comput Sci 370:279–292

    Article  MathSciNet  MATH  Google Scholar 

  11. Ravishankar K, Singh S (1994) Broadcasting on [0, L]. Discret Appl Math 53:299–319

    Article  MathSciNet  MATH  Google Scholar 

  12. Sen A, Huson ML (1996) A new model for scheduling packet radio networks. In: Proceedings of 15th annual joint conference of the IEEE computer and communication societies (IEEE INFOCOM’96), San Francisco, pp 1116–1124

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Québec-Ottawa, Gatineau, QC, Canada

    Andrzej Pelc

Authors
  1. Andrzej Pelc
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrzej Pelc .

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

Pelc, A. (2016). Broadcasting in Geometric Radio Networks. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_56

Download citation

Publish with us

Policies and ethics

Search

Navigation