skip to main content
10.1145/1374618.1374663acmconferencesArticle/Chapter ViewAbstractPublication PagesmobihocConference Proceedingsconference-collections
research-article

An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks

Published: 26 May 2008 Publication History

Abstract

Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in a minimum amount of time. At the same time, in order for the broadcast to proceed as predicted in the schedule, it must not contain parallel transmissions which can be conflicting based on the collision and interference parameters in the wireless network. Most existing work on this problem use a limited network model which accounts only for conflicts occurring inside the transmission ranges of the nodes. The broadcast schedules produced by these algorithms are likely to experience unpredictable delays when deployed in the network. This is because they do not take into consideration other important sources of conflict in parallel transmissions, namely the interference range and the carrier sensing range. In this paper we develop a conflict-aware network model, which uses these parameters to increase the probability of scheduling conflict-free transmissions, and thereby improve the reliability of the broadcast schedule. We present and prove correctness of a constant approximation algorithm for minimum-latency broadcast scheduling under this network model. We also present a greedy heuristic algorithm for the same problem. Experimental results are provided to evaluate the performance of our algorithms. In addition, the algorithms are analyzed to justify their performance trends.

References

[1]
Z. Chen, C. Qiao, J. Xu, and T. Lee. A constant approximation algorithm for interference aware broadcast in wireless networks. In INFOCOM, pages 740--748, 2007.
[2]
I. Chlamtac and S. Kutten. On broadcasting in radio networks - Problem analysis and protocol design. IEEE Transactions on Communications, 33:1240--1246, dec 1985.
[3]
I. Chlamtac and S. Kutten. Tree-based broadcasting in multihop radio networks. IEEE Transactions on Computers, C-36(10):1209--1223, 1987.
[4]
B. N. Clark, C. J. Colbourn, and D. S. Johnson. Unit disk graphs. Discrete Mathematics, 86(1-3):165--177, December 1990.
[5]
J. Deng, B. Liang, and P. Varshney. Tuning the carrier sensing range of ieee 802.11 mac. In GLOBECOM, pages 2987--2991, 2004.
[6]
R. Gandhi, S. Parthasarathy, and A. Mishra. Minimizing broadcast latency and redundancy in ad hoc networks. In MobiHoc '03: Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing, pages 222--232, 2003.
[7]
L. Gasieniec, D. Peleg, and Q. Xin. Faster communication in known topology radio networks. In PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, pages 129--137, 2005.
[8]
C. Ho, K. Obraczka, G. Tsudik, and K. Viswanath. Flooding for reliable multi-cast in multi-hop ad hoc networks. In Proceedings of the 3rd Int'l Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pages 64--71, 1999.
[9]
S. C.-H. Huang, P.-J. Wan, X. Jia, H. Du, and W. Shang. Minimum-latency broadcast scheduling in wireless ad hoc networks. In INFOCOM, pages 733--739, 2007.
[10]
J. Jercheva, Y. Hu, D. Maltz, and D. Johnson. A simple protocol for multicast and broadcast in mobile ad hoc networks, July 2002.
[11]
D. W. Matula and L. L. Beck. Smallest-last ordering and clustering and graph coloring algorithms. J. ACM, 30(3):417--427, 1983.
[12]
S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu. The broadcast storm problem in a mobile ad hoc network. In MobiCom '99, pages 151--162. ACM Press, 1999.
[13]
X. G. Viennot. A strahler bijection between dyck paths and planar trees. Discrete Math., 246(1-3):317--329, 2002.

Cited By

View all
  • (2024)Distributed low‐latency broadcast scheduling for multi‐channel duty‐cycled wireless IoT networksConcurrency and Computation: Practice and Experience10.1002/cpe.804436:13Online publication date: 14-Feb-2024
  • (2022)Structure-Free Broadcast Scheduling for Duty-Cycled Multihop Wireless Sensor NetworksIEEE Transactions on Mobile Computing10.1109/TMC.2021.308414521:12(4624-4641)Online publication date: 1-Dec-2022
  • (2021)Priority-Based Task Allocation and Scheduling in WSN Using DMPSAdvances in Materials Research10.1007/978-981-15-8319-3_111(1123-1131)Online publication date: 5-Feb-2021
  • Show More Cited By

Index Terms

  1. An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      MobiHoc '08: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
      May 2008
      474 pages
      ISBN:9781605580739
      DOI:10.1145/1374618
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 26 May 2008

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. approximation algorithm
      2. broadcast scheduling
      3. conflict-aware
      4. wireless networks

      Qualifiers

      • Research-article

      Conference

      MobiHoc08
      Sponsor:

      Acceptance Rates

      Overall Acceptance Rate 296 of 1,843 submissions, 16%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)3
      • Downloads (Last 6 weeks)3
      Reflects downloads up to 13 Feb 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2024)Distributed low‐latency broadcast scheduling for multi‐channel duty‐cycled wireless IoT networksConcurrency and Computation: Practice and Experience10.1002/cpe.804436:13Online publication date: 14-Feb-2024
      • (2022)Structure-Free Broadcast Scheduling for Duty-Cycled Multihop Wireless Sensor NetworksIEEE Transactions on Mobile Computing10.1109/TMC.2021.308414521:12(4624-4641)Online publication date: 1-Dec-2022
      • (2021)Priority-Based Task Allocation and Scheduling in WSN Using DMPSAdvances in Materials Research10.1007/978-981-15-8319-3_111(1123-1131)Online publication date: 5-Feb-2021
      • (2020)Low Latency Broadcast Scheduling for Battery-Free Wireless Networks Without Predetermined Structures2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS47774.2020.00052(245-255)Online publication date: Nov-2020
      • (2019)Broadcast Scheduling in Battery-Free Wireless Sensor NetworksACM Transactions on Sensor Networks10.1145/335647215:4(1-34)Online publication date: 27-Sep-2019
      • (2019)Algorithm 1002ACM Transactions on Mathematical Software10.1145/333048145:4(1-28)Online publication date: 9-Dec-2019
      • (2019)Multicast Scheduling Algorithms for Battery-Free Wireless Sensor Networks2019 IEEE 16th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)10.1109/MASS.2019.00054(398-406)Online publication date: Nov-2019
      • (2019)Low-Latency Concurrent Broadcast Scheduling in Duty-Cycled Multihop Wireless Networks2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS.2019.00089(851-860)Online publication date: Jul-2019
      • (2018)Short-Range Cooperation of Mobile Devices for Energy-Efficient Vertical HandoversWireless Communications & Mobile Computing10.1155/2018/32809272018Online publication date: 1-Jan-2018
      • (2017)An enhancing scheme for interference-aware broadcast with reducible TX-range in wireless networks2017 IEEE 9th International Conference on Communication Software and Networks (ICCSN)10.1109/ICCSN.2017.8230138(372-375)Online publication date: May-2017
      • Show More Cited By

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media