On the Complexity of Scheduling in Wireless Networks
Cited 1 times inCited 3 times in
- On the Complexity of Scheduling in Wireless Networks
- Joo, Changhee; Sharma, Gaurav; Shroff, Ness B.; Mazumdar, Ravi R.
- MATCHING PROBLEM; RADIO NETWORKS; APPROXIMATION ALGORITHMS; ALLOCATION; STABILITY; SCHEMES; TIME; THROUGHPUT; FAIRNESS; POLICIES
- Issue Date
- SPRINGER INTERNATIONAL PUBLISHING AG
- EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, v.2010, no., pp.418934 -
- We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference models, under which no two links within a K-hop distance can successfully transmit at the same time. For a given K, we can obtain a throughput-optimal scheduling policy by solving the well-known maximum weighted matching problem. We show that for K > 1, the resulting problems are NP-Hard that cannot be approximated within a factor that grows polynomially with the number of nodes. Interestingly, for geometric unit-disk graphs that can be used to describe a wide range of wireless networks, the problems admit polynomial time approximation schemes within a factor arbitrarily close to 1. In these network settings, we also show that a simple greedy algorithm can provide a 49-approximation, and the maximal matching scheduling policy, which can be easily implemented in a distributed fashion, achieves a guaranteed fraction of the capacity region for "all K." The geometric constraints are crucial to obtain these throughput guarantees. These results are encouraging as they suggest that one can develop low-complexity distributed algorithms to achieve near-optimal throughput for a wide range of wireless networks
- ; Go to Link
- Appears in Collections:
- EE_Journal Papers
- Files in This Item:
can give you direct access to the published full text of this article. (UNISTARs only)
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.