Power allocation and routing in multibeam satellites with time-varying channels
IEEE/ACM Transactions on Networking (TON)
Stable scheduling policies for fading wireless channels
IEEE/ACM Transactions on Networking (TON)
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, V. 1, No. 1)
The impact of imperfect scheduling on cross-layer congestion control in wireless networks
IEEE/ACM Transactions on Networking (TON)
Distributed link scheduling with constant overhead
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Clock synchronization for wireless networks
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
IEEE Transactions on Information Theory
Link scheduling in polynomial time
IEEE Transactions on Information Theory - Part 1
A tutorial on cross-layer optimization in wireless networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
In wireless communication systems, the interference between links results in a challenging scheduling problem. A K-hop interference model is defined as one for which no two links within K-hops can successfully transmit at the same time (note that IEEE 802.11 DCF corresponds to a 2-hop interference model). For a given K, a throughput-optimal scheduler needs to solve a maximum weighted matching problem subject to the K-hop interference constraints. Previous work has mainly focused on developing scheduling algorithms with performance guarantees for the primary interference model (K=1). For K=2, the problem is NP-Complete and cannot be approximated within a constant factor by any polynomial time algorithm. Our algorithm achieves at least a constant fraction (1/3) of the capacity region under any K-hop interference model. The simplicity of the solution and low control complexity makes it highly amenable for practical implementation. Simulation results show that when the communication overhead is taken into account, the delay characteristics of the proposed scheme may be better than the ideal optimal scheduler (given the prices at all the links, the ideal scheduler computes the optimal schedule instantaneously).