Throughput-optimal broadcast in wireless networks with dynamic topology
We consider the problem of throughput-optimal broadcasting in time-varying wireless network with an underlying Directed Acyclic Graph (DAG) topology. Known broadcast algorithms route packets along pre-computed spanning trees. In large wireless networks with time-varying connectivities, the optimal t...
Main Authors: | Tassiulas, Leandros, Sinha, Abhishek, Modiano, Eytan H |
---|---|
Other Authors: | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems |
Format: | Article |
Language: | en_US |
Published: |
Association for Computing Machinery (ACM)
2017
|
Online Access: | http://hdl.handle.net/1721.1/106542 https://orcid.org/0000-0001-7220-0691 https://orcid.org/0000-0001-8238-8130 |
Similar Items
-
Throughput-Optimal Broadcast in Wireless Networks with Point-to-Multipoint Transmissions
by: Sinha, Abhishek, et al.
Published: (2021) -
Throughput-Optimal Broadcast in Wireless Networks with Point-to-Multipoint Transmissions
by: Modiano, Eytan H, et al.
Published: (2018) -
Throughput-Optimal Multihop Broadcast on Directed Acyclic Wireless Networks
by: Paschos, Georgios, et al.
Published: (2018) -
Throughput-Optimal Multihop Broadcast on Directed Acyclic Wireless Networks
by: Paschos, Georgios, et al.
Published: (2018) -
Throughput-optimal multi-hop broadcast algorithms
by: Paschos, Georgios, et al.
Published: (2017)