Skip to main content
SpringerLink
Log in

Asynchronous Broadcast in Radio Networks

  • Conference paper
Structural Information and Communication Complexity (SIROCCO 2004)

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

Abstract

We study asynchronous packet radio networks in which transmissions among nodes may be delayed. We consider the task of broadcasting a message generated by the source node. The timing of arrivals of messages is controlled by adversaries. We consider three different adversaries. The edge adversary can have a transmitted message delivered at different times to different recipients. The crash adversary is the edge one augmented by the ability to crash nodes. The node adversary can have a message received at arbitrary times, but simultaneously by all the recipients. A protocol specifies for each node how many times the message is retransmitted by this node, after it has been received. The total number of transmissions of nodes is defined to be a measure of performance of a broadcast protocol, and is called its work. The radio network is modeled as a graph and is given as input to a centralized algorithm. An aim of the algorithm could be either to find a broadcast protocol, possibly with additional properties, or to verify correctness of a given protocol. We give an algorithm to find a protocol correct against the edge adversary. The obtained protocol is work-exponential in general. This is an inherent property of the problem, as is justified by a lower bound. We develop a polynomial algorithm to verify correctness of a given protocol for a given network against the edge adversary. We show that a problem to decide if there exists a protocol, for a given network and of a specified work performance, is NP-hard. We extend some of these results to the remaining two adversaries.

This work is supported by the NSF Grant 0310503.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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, 290–298 (1991)

    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, 104–126 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bar-Yehuda, R., Israeli, A., Itai, A.: Multiple communication in multihop radio networks. SIAM Journal on Computing 22, 875–887 (1993)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  5. Chlamtac, I., Kutten, S.: On broadcasting in radio networks - problem analysis and protocol design. IEEE Transactions on Communications 33, 1240–1246 (1985)

    Article  MATH  Google Scholar 

  6. Chlamtac, I., Kutten, S.: Tree based broadcasting in multihop radio networks. IEEE Transactions on Computers 36, 1209–1223 (1987)

    Article  Google Scholar 

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

    Article  Google Scholar 

  8. Chlebus, B.S., Ga̧sieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. Distributed Computing 15, 27–38 (2002)

    Article  Google Scholar 

  9. Chlebus, B.S., Ga̧sieniec, L., Östlin, A., Robson, J.M.: Deterministic radio broadcasting. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 717–728. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  10. Chrobak, M., Ga̧sieniec, L., Kowalski, D.R.: The wake-up problem in multi-hop radio networks. In: Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 985–993 (2004)

    Google Scholar 

  11. Chrobak, M., Ga̧sieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. Journal of Algorithms 43, 177–189 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  12. Clementi, A., Monti, A., Silvestri, R.: Distributed multi-broadcast in unknown radio networks. In: Proc. 20th ACM Symposium on Principles of Distributed Computing (PODC), pp. 255–264 (2001)

    Google Scholar 

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

    Google Scholar 

  14. Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In: Proc. 44th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 492–501 (2003)

    Google Scholar 

  15. Gaber, I., Mansour, Y.: Broadcast in radio networks. J. Algorithms 46, 1–20 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  16. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)

    MATH  Google Scholar 

  17. Ga̧sieniec, L., Pelc, A., Peleg, D.: The wakeup problem in synchronous broadcast systems. SIAM Journal on Discrete Mathematics 14, 207–222 (2001)

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  19. Jurdziński, T., Kutyłowski, M., Zatopiański, J.: Efficient algorithms for leader election in radio networks. In: Proc. 21st ACM Symposium on Principles of Distributed Computing (PODC), pp. 51–57 (2002)

    Google Scholar 

  20. Jurdziński, T., Stachowiak, G.: Probabilistic algorithms for the wakeup problem in single-hop radio networks. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 535–549. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  21. Kowalski, D.R., Pelc, A.: Deterministic broadcasting time in radio networks of unknown topology. In: Proc. 43rd IEEE Symposium of Foundations of Computer Science (FOCS), pp. 63–72 (2002)

    Google Scholar 

  22. Kowalski, D.R., Pelc, A.: Faster deterministic broadcasting in ad-hoc radio networks. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 109–120. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  23. Kowalski, D.R., Pelc, A.: Deterministic broadcasting time in radio networks of unknown topology. In: Proc. 22nd ACM Symposium on Principles of Distributed Computing (PODC), pp. 73–82 (2003)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  26. Kushilevitz, E., Mansour, Y.: Computation in noisy radio networks. In: Proc. 9th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 236–243 (1998)

    Google Scholar 

  27. Liu, D., Prabhakaran, M.: On randomized broadcasting and gossiping in radio networks. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 340–349. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  28. Xu, Y.: An O(n1.5) deterministic gossiping algorithm for radio networks. Algorithmica 36, 93–96 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  29. Wolfram, D.A.: Solving generalized Fibonacci recurrences. The Fibonacci Quarterly 36, 129–145 (1998)

    MATH  MathSciNet  Google Scholar 

  30. Zheng, R., Hou, J.C., Sha, L.: Asynchronous wakeup for power management in ad hoc networks. In: Proc. 4th ACM Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), pp. 35–45 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Colorado at Denver, Denver, CO, 80217, USA

    Bogdan S. Chlebus & Mariusz A. Rokicki

Authors
  1. Bogdan S. Chlebus
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mariusz A. Rokicki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Faculty of Mathematics, Physics and Informatics, Comenius University, Research partially funded by grant APVV, 0433-06, Bratislava, Slovakia

    Ratislav Královic̆

  2. Department of Computer Science, University of Loughborough, Loughborough, UK

    Ondrej Sýkora

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chlebus, B.S., Rokicki, M.A. (2004). Asynchronous Broadcast in Radio Networks. In: Královic̆, R., Sýkora, O. (eds) Structural Information and Communication Complexity. SIROCCO 2004. Lecture Notes in Computer Science, vol 3104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27796-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27796-5_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22230-9

  • Online ISBN: 978-3-540-27796-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation