Optimal control of wireless networks with finite buffers
This paper considers network control for wireless networks with finite buffers. We investigate the performance of joint flow control, routing, and scheduling algorithms which achieve high network utility and deterministically bounded backlogs inside the network. Our algorithms guarantee that buffers...
Main Authors: | Le, Long Bao, Modiano, Eytan H., Shroff, Ness B. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers
2011
|
Online Access: | http://hdl.handle.net/1721.1/66127 https://orcid.org/0000-0003-3577-6530 https://orcid.org/0000-0001-8238-8130 |
Similar Items
-
Longest-queue-first scheduling under SINR interference model
by: Le, Long Bao, et al.
Published: (2013) -
Delay Analysis of Maximum Weight Scheduling in Wireless Ad Hoc Networks
by: Modiano, Eytan H., et al.
Published: (2010) -
Distributed Throughput Maximization in Wireless Networks via Random Power Allocation
by: Modiano, Eytan H., et al.
Published: (2010) -
Distributed Throughput Maximization in Wireless Networks via Random Power Allocation
by: Lee, Hyang Won, et al.
Published: (2017) -
Random access wireless networks with controlled mobility
by: Modiano, Eytan H., et al.
Published: (2010)