Skip to main content

Bounds on Contention Management in Radio Networks

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7611)

Abstract

The local broadcast problem assumes that processes in a wireless network are provided messages, one by one, that must be delivered to their neighbors. In this paper, we prove tight bounds for this problem in two well-studied wireless network models: the classical model, in which links are reliable and collisions consistent, and the more recent dual graph model, which introduces unreliable edges. Our results prove that the Decay strategy, commonly used for local broadcast in the classical setting, is optimal. They also establish a separation between the two models, proving that the dual graph setting is strictly harder than the classical setting, with respect to this primitive.

Keywords

  • Radio Network
  • Random Graph
  • Dual Graph
  • Centralize Algorithm
  • Bipartite Network

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bachir, A., Dohler, M., Wattayne, T., Leung, K.: MAC Essentials for Wireless Sensor Networks. IEEE Communications Surveys and Tutorials 12(2), 222–248 (2010)

    CrossRef  Google Scholar 

  2. Shan, H., Zhuang, W., Wand, Z.: Distributed Cooperative MAC for Multihop Wireless Networks. IEEE Communications Magazine 47(2), 126–133 (2009)

    CrossRef  Google Scholar 

  3. Sato, N., Fujii, T.: A MAC Protocol for Multi-Packet Ad-Hoc Wireless Network Utilizing Multi-Antenna. In: Proceedings of the IEEE Conference on Consumer Communications and Networking (2009)

    Google Scholar 

  4. Sayed, S., and Yand, Y.: BTAC: A Busy Tone Based Cooperative MAC Protocol for Wireless Local Area Networks. In Proceedings of the Interneational Conference on Communications and Networking in China (2008).

    Google Scholar 

  5. Sun, Y., Gurewitz, O., Johnson, D.B.: RI-MAC: a Receiver-Initiated Asynchronous Duty Cycle MAC Protocol for Dynamic Traffic Loads in Wireless Sensor Networks. In: Proceedings of the ACM Conference on Embedded Network Sensor Systems (2008)

    Google Scholar 

  6. Rhee, I., Warrier, A., Aia, M., Min, J., Sichitiu, M.L.: Z-MAC: a Hybrid MAC for Wireless Sensor Networks. IEEE/ACM Trans. on Net. 16, 511–524 (2008)

    CrossRef  Google Scholar 

  7. Alon, N., Spencer, J.H.: The probabilistic method. John Wiley & Sons, New York (1992)

    Google Scholar 

  8. Chlamtac, I., Kutten, S.: On Broadcasting in Radio Networks–Problem Analysis and Protocol Design. IEEE Trans. on Communications (1985)

    Google Scholar 

  9. Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization. In: PODC 1987: Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, pp. 98–108. ACM, New York (1987)

    CrossRef  Google Scholar 

  10. Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. J. Comput. Syst. Sci. 43(2), 290–298 (1991)

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. Chrobak, M., Gasieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. J. Algorithms 43(2), 177–189 (2002)

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. Chlebus, B.S., Gasieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete algorithms (SODA 2000), pp. 861–870. Society for Industrial and Applied Mathematics, Philadelphia (2000)

    Google Scholar 

  13. Chlebus, B.S., Gą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, p. 717. Springer, Heidelberg (2000)

    CrossRef  Google Scholar 

  14. Clementi, A., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: The Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 709–718. Society for Industrial and Applied Mathematics, Philadelphia (2001)

    Google Scholar 

  15. Clementi, A., Crescenzi, P., Monti, A., Penna, P., Silvestri, R.: On Computing Ad-hoc Selective Families. In: Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization, pp. 211–222 (2001)

    Google Scholar 

  16. Clementi, A., Monti, A., Silvestri, R.: Round robin is optimal for fault-tolerant broadcasting on wireless networks. J. Parallel Distrib. Comput. 64(1), 89–96 (2004)

    CrossRef  MATH  Google Scholar 

  17. Gasieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing (PODC 2005), pp. 129–137. ACM, New York (2005)

    CrossRef  Google Scholar 

  18. Kuhn, F., Lynch, N., Newport, C.: The Abstract MAC Layer. Technical Report MIT-CSAIL-TR-2009-009, MIT CSAIL, Cambridge, MA (February 20, 2009)

    Google Scholar 

  19. Kuhn, F., Lynch, N., Newport, C.: The Abstract MAC Layer. Distributed Computing 24(3), 187–296 (2011); Special issue from DISC 2009 23rd International Symposium on Distributed Computing

    CrossRef  MATH  Google Scholar 

  20. Kuhn, F., Lynch, N., Newport, C.: Brief Announcement: Hardness of Broadcasting in Wireless Networks with Unreliable Communication. In: Proceedings of the ACM Symposium on the Principles of Distributed Computing (PODC), Calgary, Alberta, Canada (August 2009)

    Google Scholar 

  21. Cornejo, A., Lynch, N., Viqar, S., Welch, J.: A Neighbor Discovery Service Using an Abstract MAC Layer. In: Forty-Seventh Annual Allerton Conference, Champaign-Urbana, IL (October 2009) (invited paper)

    Google Scholar 

  22. Kuhn, F., Lynch, N., Newport, C., Oshman, R., Richa, A.: Broadcasting in unreliable radio networks. In: Proceedings of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2010), pp. 336–345. ACM, New York (2010)

    CrossRef  Google Scholar 

  23. Khabbazian, M., Kuhn, F., Kowalski, D.R.: Lynch. N.: Decomposing broadcast algorithms using abstract MAC layers. In: Proceedings of the 6th International Workshop on Foundations of Mobile Computing (DIALM-POMC 2010), pp. 13–22. ACM, New York (2010)

    Google Scholar 

  24. Khabbazian, M., Kuhn, F., Lynch, N., Medard, M., ParandehGheibi, A.: MAC Design for Analog Network Coding. In: FOMC 2011: The Seventh ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing, San Jose, CA (June 2011)

    Google Scholar 

  25. Censor-Hillel, K., Gilbert, S., Kuhn, F., Lynch, N., Newport, C.: Structuring Unreliable Radio Networks. In: Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, San Jose, California, June 6-8 (2011)

    Google Scholar 

  26. Ghaffari, M., Haeupler, B., Khabbazian, M.: The complexity of Multi-Message Broadcast in Radio Networks with Known Topology (manuscript in preparation, 2012)

    Google Scholar 

  27. Ghaffari, M., Haeupler, B., Lynch, N., Newport, C.: Bounds on Contention Management in Radio Networks, http://arxiv.org/abs/1206.0154

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ghaffari, M., Haeupler, B., Lynch, N., Newport, C. (2012). Bounds on Contention Management in Radio Networks. In: Aguilera, M.K. (eds) Distributed Computing. DISC 2012. Lecture Notes in Computer Science, vol 7611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33651-5_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33651-5_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33650-8

  • Online ISBN: 978-3-642-33651-5

  • eBook Packages: Computer ScienceComputer Science (R0)