Throughput-Optimal Multihop Broadcast on Directed Acyclic Wireless Networks
Name
AbhishekToN_Submitted copy.pdf
Size
584.71 KB
Format
Adobe PDF
Checksum (MD5)
3fdcd1183725c8233750475f9162e4ad
Author(s)
Paschos, Georgios
Li, Chih-Ping
Sinha, Abhishek
Modiano, Eytan H
Date Issued
July 2016
Journal
IEEE/ACM Transactions on Networking
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Sinha, Abhishek, Georgios Paschos, Chih-Ping Li, and Eytan Modiano. “Throughput-Optimal Multihop Broadcast on Directed Acyclic Wireless Networks.” IEEE/ACM Transactions on Networking 25, no. 1 (February 2017): 377–391.
Version
Original manuscript
Abstract
We study the problem of efficiently disseminating packets in multi-hop wireless networks. At each time slot, the network controller activates a set of non-interfering links and forward selected copies of packets on each activated link. The maximum rate of commonly received packets is referred to as the broadcast capacity of the network. Existing policies achieve the broadcast capacity by balancing traffic over a set of spanning trees, which are difficult to maintain in a large and time-varying wireless network. In this paper, we propose a new dynamic algorithm that achieves the broadcast capacity when the underlying network topology is a directed acyclic graph (DAG). This algorithm is decentralized, utilizes local information only, and does not require the use of spanning trees. The principal methodological challenge inherent in this problem is the absence of work-conservation principle due to the duplication of packets, which renders usual queuing modeling inapplicable. We overcome this difficulty by studying relative packet deficits and imposing in-order delivery constraints to every node in the network. We show that in-order delivery is throughput-optimal in DAGs and can be exploited to simplify the design and analysis of optimal algorithms. Our capacity characterization also leads to a polynomial time algorithm for computing the broadcast capacity of any wireless DAG under the primary interference constraints. In addition, we propose a multiclass extension of our algorithm, which can be effectively used for broadcasting in any network with arbitrary topology. Simulation results show that the our algorithm has a superior delay performance as compared with the traditional tree-based approaches.
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.1109/tnet.2016.2582907
