Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Bluetooth revealed: the insider's guide to an open specification for global wireless communication
Bluetooth revealed: the insider's guide to an open specification for global wireless communication
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Parallel and Distributed Computation: Numerical Methods
Parallel and Distributed Computation: Numerical Methods
Proceedings of the 9th annual international conference on Mobile computing and networking
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
Distributed Fair Resource Allocation in Cellular Networks in the Presence of Heterogeneous Delays
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Stable scheduling policies for fading wireless channels
IEEE/ACM Transactions on Networking (TON)
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm
Queueing Systems: Theory and Applications
Scheduling and performance limits of networks with constantly changing topology
IEEE Transactions on Information Theory
Optimal control of wireless networks with finite buffers
INFOCOM'10 Proceedings of the 29th conference on Information communications
On the effect of self-interference cancelation in multihop wireless networks
EURASIP Journal on Wireless Communications and Networking
Optimal control of wireless networks with finite buffers
IEEE/ACM Transactions on Networking (TON)
FlashLinQ: a synchronous distributed scheduler for peer-to-peer ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
We consider a multi-hop wireless network shared by many users. For an interference model that constrains a node to either transmit to or receive from only one other node at a time, and not to do both, we propose an architecture for fair resource allocation that consists of a distributed scheduling algorithm operating in conjunction with an asynchronous congestion control algorithm. We show that the proposed joint congestion control and scheduling algorithm supports at least one-third of the throughput supportable by any other algorithm, including centralized algorithms.