An investigation on the nature of wireless scheduling

Authors:
Cem Boyaci;Bo Li;Ye Xia
Affiliations:
Computer and Information Science and Engineering, Department, University of Florida;Computer and Information Science and Engineering, Department, University of Florida;Computer and Information Science and Engineering, Department, University of Florida
Venue:
INFOCOM'10 Proceedings of the 29th conference on Information communications
Year:
2010

Citing 15
Cited 0

On the hardness of approximating minimization problems

Journal of the ACM (JACM)
Zero Knowledge and the Chromatic Number

CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Approximate strong separation with application in fractional graph coloring and preemptive scheduling

Theoretical Computer Science
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 Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes

SIAM Journal on Discrete Mathematics
Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach

Proceedings of the 12th annual international conference on Mobile computing and networking
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
Complexity in wireless scheduling: impact and tradeoffs

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
A local greedy scheduling scheme with provable performance guarantee

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
A simple local-control approximation algorithm for multicommodity flow

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
A refined performance characterization of longest-queue-first policy in wireless networks

Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
The capacity of wireless networks

IEEE Transactions on Information Theory
Stability and capacity of regular wireless networks

IEEE Transactions on Information Theory
Wireless Link Scheduling With Power Control and SINR Constraints

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper studies the complexity of the wireless scheduling problem under interference constraints.We first relate the definition of the capacity region to the weighted fractional coloring problem. Then, the scheduling-for-stability problem under deterministic arrivals is studied in light of this relationship. We emphasize the requirement that the scheduling algorithm uses a tractable amount of processing and storage resources. Two classes of algorithms are defined and a complexity result is derived for the intersection of the two classes. We also exhibit an algorithm that can achieve the storage requirement by relaxing the processing requirement. The results are used to examine interesting sections of the capacity region. Finally, we relate the new interpretation and theory about the capacity region to the notion of set σ-local pooling.