Scheduling algorithms for input-queued cell switches
Scheduling algorithms for input-queued cell switches
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
A game theoretic framework for bandwidth allocation and pricing in broadband networks
IEEE/ACM Transactions on Networking (TON)
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Power allocation and routing in multibeam satellites with time-varying channels
IEEE/ACM Transactions on Networking (TON)
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm
Queueing Systems: Theory and Applications
Maximum Weighted Matching with Interference Constraints
PERCOMW '06 Proceedings of the 4th annual IEEE international conference on Pervasive Computing and Communications Workshops
Maximizing throughput in wireless networks via gossiping
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
On the complexity of scheduling in wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Resource allocation and cross-layer control in wireless networks
Foundations and Trends® in Networking
802.11 Wireless Networks: The Definitive Guide, Second Edition
802.11 Wireless Networks: The Definitive Guide, Second Edition
Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks
IEEE Transactions on Mobile Computing
Fairness and optimal stochastic control for heterogeneous networks
IEEE/ACM Transactions on Networking (TON)
Distributed cross-layer algorithms for the optimal control of multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Joint congestion control and distributed scheduling for throughput guarantees in wireless networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
On the Connection-Level Stability of Congestion-Controlled Communication Networks
IEEE Transactions on Information Theory
IEEE Journal on Selected Areas in Communications
Joint congestion control and distributed scheduling for throughput guarantees in wireless networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
A refined performance characterization of longest-queue-first policy in wireless networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
| Hi-index | 0.00 |
We consider the problem of throughput-optimal cross-layer design of wireless networks. We propose a joint congestion control and scheduling algorithm that achieves a fraction 1/dI(G) of the capacity region, where dI(G) depends on certain structural properties of the underlying connectivity graph G of the wireless network, and also on the type of interference constraints. For a wide range of wireless networks, dI(G) can be upper bounded by a constant, independent of the number of nodes in the network. The scheduling element of our algorithm is the maximal scheduling policy. Although this scheduling policy has been considered in several previous works, the challenges underlying its practical implementation in a fully distributed manner while accounting for necessary message exchanges have not been addressed in the literature. In this article, we propose two algorithms for the distributed implementation of the maximal scheduling policy accounting for message exchanges, and analytically show that they still can achieve the performance guarantee under the 1-hop and 2-hop interference models. We also evaluate the performance of our cross-layer solutions in more realistic network settings with imperfect synchronization under the Signal-to-Interference-Plus-Noise Ratio (SINR) interference model, and compare with the standard layered approaches such as TCP over IEEE 802.11b DCF networks.