Skip to main content
SpringerLink
Log in

Faster Deterministic Broadcasting in Ad Hoc Radio Networks

  • Conference paper
  • First Online:
Book cover STACS 2003 (STACS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2607))

Included in the following conference series:

Abstract

We consider radio networks modeled as directed graphs. In ad hoc radio networks, every node knows only its own label and a linear bound on the size of the network but is unaware of the topology of the network, or even of its own neighborhood. The fastest currently known deterministic broadcasting algorithm working for arbitrary n-node ad hoc radio networks, has running time O(n log2 n). Our main result is a broadcasting algorithm working in time O(n log n logD) for arbitrary nnode ad hoc radio networks of eccentricity D. The best currently known lower bound on broadcasting time in ad hoc radio networks is .(n logD), hence our algorithm is the first to shrink the gap between bounds on broadcasting time in radio networks of arbitrary eccentricity to a logarithmic factor. We also show a broadcasting algorithm working in time O(n logD) for complete layered n-node ad hoc radio networks of eccentricity D. The latter complexity is optimal.

This work was done during the first author’s stay at the Research Chair in Distributed Computing of the Université du Québec en Outaouais, as a postdoctoral fellow. The work of the second author was supported in part by NSERC grant OGP 0008136 and by the Research Chair in Distributed Computing of the Université du Québec en Outaouais.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. Journal of Computer and System Sciences 43(1991) 290–298

    Article  MATH  MathSciNet  Google Scholar 

  2. Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization. Journal of Computer and System Sciences 45 (1992) 104–126

    Article  MATH  MathSciNet  Google Scholar 

  3. Basagni, S., Bruschi, D., Chlamtac, I.: A mobility-transparent deterministic broadcast mechanism for ad hoc networks. IEEE/ACM Trans. on Networking 7 (1999) 799–807

    Article  Google Scholar 

  4. Basagni, S., Myers A.D., Syrotiuk, V.R.: Mobility-independent flooding for realtime multimedia applications in ad hoc networks. Proc. 1999 IEEE Emerging Technologies Symposium on Wireless Communications & Systems, Richardson, TX

    Google Scholar 

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

    Article  Google Scholar 

  6. Chlamtac, I., Faragó, A.: Making transmission schedule immune to topology changes in multi-hop packet radio networks. IEEE/ACM Trans. on Networking 2 (1994) 23–29

    Article  Google Scholar 

  7. Chlamtac, I., Faragó, A., Zhang, H.: Time-spread multiple access (TSMA) protocols for multihop mobile radio networks. IEEE/ACM Trans. on Networking 5 (1997) 804–812

    Article  Google Scholar 

  8. Chlamtac, I., Weinstein, O.: The wave expansion approach to broadcasting in multihop radio networks. IEEE Trans. on Communications 39 (1991) 426–433

    Article  Google Scholar 

  9. Chlebus, B., Gasieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. Distributed Computing 15 (2002) 27–38

    Article  Google Scholar 

  10. Chlebus, B., Gasieniec, L., Östlin, A., Robson, J.M.: Deterministic radio broadcasting. Proc. 27th Int. Coll. on Automata, Languages and Programming (ICALP’2000), LNCS 1853, 717–728

    Google Scholar 

  11. Chrobak, M., Gasieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. Proc. 41st Symposium on Foundations of Computer Science (FOCS’2000), 575–581

    Google Scholar 

  12. Clementi, A., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. Proc. 12th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA’2001), 709–718

    Google Scholar 

  13. De Marco, G., Pelc, A.: Faster broadcasting in unknown radio networks. Information Processing Letters 79 (2001) 53–56

    Article  MATH  MathSciNet  Google Scholar 

  14. Gaber, I., Mansour, Y.: Broadcast in radio networks. Proc. 6th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA’1995), 577–585

    Google Scholar 

  15. Indyk, P.: Explicit constructions of selectors and related combinatorial structures with applications. Proc. 13th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA’2002), 697–704

    Google Scholar 

  16. Kowalski, D., Pelc, A.: Deterministic broadcasting time in radio networks of unknown topology. Proc. 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS’2002), 63–72.

    Google Scholar 

  17. Kushilevitz, E., Mansour, Y.: An.(Dlog(N/D)) lower bound for broadcast in radio networks. SIAM J. on Computing 27 (1998) 702–712

    Article  MATH  MathSciNet  Google Scholar 

  18. Peleg, D.: Deterministic radio broadcast with no topological knowledge. Manuscript (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instytut Informatyki, Uniwersytet Warszawski, Banacha 2, 02-097, Warszawa, Poland

    Dariusz R. Kowalski

  2. Dèpartement d’informatique, Université du Québec en Outaouais, J8X 3X7, Hull, Québec, Canada

    Andrzej Pelc

Authors
  1. Dariusz R. Kowalski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrzej Pelc
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Freie Universität Berlin, Takusstr. 9, 14195, Berlin, Germany

    Helmut Alt

  2. LIRMM, 161, Rue Ada, 34392, Montpellier Cedex 5, France

    Michel Habib

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kowalski, D.R., Pelc, A. (2003). Faster Deterministic Broadcasting in Ad Hoc Radio Networks. In: Alt, H., Habib, M. (eds) STACS 2003. STACS 2003. Lecture Notes in Computer Science, vol 2607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36494-3_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-36494-3_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00623-7

  • Online ISBN: 978-3-540-36494-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation