Throughput-Optimal Broadcast in Wireless Networks with Point-to-Multipoint Transmissions
Name
1702.05197.pdf
Size
1.16 MB
Format
Adobe PDF
Checksum (MD5)
64b33f518765e96012fcbb98d6192d01
Author(s)
Modiano, Eytan H
Sinha, Abhishek
Date Issued
July 2017
Journal
Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing - Mobihoc '17
Publisher
Association for Computing Machinery (ACM)
Citation
Sinha, Abhishek, and Eytan Modiano. "Throughput-Optimal Broadcast in Wireless Networks with Point-to-Multipoint Transmissions." Proceedings of the 18th ACM International Symposium on Mobile Ad Hoc Networking and Computing - Mobihoc '17, 10-14 July, 2017, Chennai, India, ACM Press, 2017, pp. 1–10. © 2017 ACM.
Version
Author's final manuscript
Abstract
We consider the problem of efficient packet dissemination in wireless networks with point-to-multi-point wireless broadcast channels. We propose a dynamic policy, which achieves the broadcast capacity of the network. This policy is obtained by first transforming the original multi-hop network into a precedence-relaxed virtual single-hop network and then finding an optimal broadcast policy for the relaxed network. The resulting policy is shown to be throughput-optimal for the original wireless network using a sample-path argument. We also prove the NP-completeness of the finite-horizon broadcast problem, which is in contrast with the polynomial time solvability of the problem with point-to-point channels. Illustrative simulation results demonstrate the efficacy of the proposed broadcast policy in achieving the full broadcast capacity with low delay. KEYWORDS: Broadcasting, Scheduling, Qeueing Theory, Throughput Optimality
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3084041.3084064
