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
A game theoretic framework for bandwidth allocation and pricing in broadband networks
IEEE/ACM Transactions on Networking (TON)
Impact of fairness on Internet performance
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Power allocation and routing in multibeam satellites with time-varying channels
IEEE/ACM Transactions on Networking (TON)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
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
On the complexity of scheduling in wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
IEEE Journal on Selected Areas in Communications
Hi-index | 0.01 |
We study the problem of joint congestion control and scheduling in wireless networks. We model the wireless networks as a directed graph G = (V, E), where V denotes the set of nodes and E denotes the set of wireless links between the nodes. We propose a joint congestion control and scheduling scheme that achieves a fraction d1(G) of the capacity region, where d1(G) depends on certain structural properties of graph G as well as the nature of interference constraints. For specific families of graphs, which can represent a wide variety of wireless networks, d1(G) has been upper bounded by a factor independent of the number of nodes in the network for a wide range of interference models. The scheduling element of our joint congestion control and scheduling scheme is the maximal scheduling policy considered in many of the earlier works. Although, it is widely believed to be amenable to distributed implementation, no algorithms have been proposed for its implementation, except under the node-exclusive interference model which is suitable only for networks in which adjacent nodes can transmit over non-interfering channels. We propose a randomized algorithm for implementing maximal scheduling policy under a 2-hop interference model which is suitable for networks with a limited number of non-interfering channels (e.g., IEEE 802.11 DSSS networks).