On the complexity of scheduling in wireless networks

Eurasip Journal on Wireless Communications and Networking

Volumn 2010, Issue , 2010, Pages

  Joo, Changhee ^a   Sharma, Gaurav ^b   Shroff, Ness B ^c   Mazumdar, Ravi R ^d  

^a Korea University of Technology and Education   (South Korea)

^b D E SHAW RESEARCH   (United States)

^c OHIO STATE UNIVERSITY   (United States)

^d UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CAPACITY REGIONS; DISTRIBUTED ALGORITHM; GEOMETRIC CONSTRAINT; GREEDY ALGORITHMS; HOP DISTANCE; INTERFERENCE CONSTRAINTS; INTERFERENCE MODELS; LOW-COMPLEXITY; MAXIMAL MATCHINGS; MAXIMUM WEIGHTED MATCHING; NETWORK SETTINGS; NP-HARD; OPTIMAL SCHEDULING; OPTIMAL THROUGHPUTS; POLYNOMIAL TIME APPROXIMATION SCHEMES; SCHEDULING POLICIES; TWO-LINK; UNIT DISK GRAPHS;

APPROXIMATION ALGORITHMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; THROUGHPUT;

WIRELESS NETWORKS;

EID: 78249259376     PISSN: 16871472     EISSN: 16871499     Source Type: Journal    
DOI: 10.1155/2010/418934     Document Type: Article

References (37)

1. Tassiulas L., Ephremides A., Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks IEEE Transactions on Automatic Control 1992 37 12 1936 1948
2. Xiao L., Johansson M., Boyd S. P., Simultaneous routing and resource allocation via dual decomposition IEEE Transactions on Communications 2004 52 7 1136 1144
3. Neely M. J., Modiano E., Rohrs C. E., Power allocation and routing in multibeam satellites with time-varying channels IEEE/ACM Transactions on Networking 2003 11 1 138 152
4. Tassiulas L., Ephremides A., Jointly optimal routing and scheduling in packet radio networks IEEE Transactions on Information Theory 1992 38 1 165 168
5. Cruz R. L., Santhanam A. V., Optimal routing, link scheduling and power control in multi-hop wireless networks Proceedings of the 22nd Annual Joint Conference on the IEEE Computer and Communications Societies (INFOCOM '03) April 2003 702 711
6. Kelly F. P., Maulloo A. K., Tan D., Rate control for communication networks: shadow prices, proportional fairness and stability Journal of the Operational Research Society 1998 49 3 237 252
7. Yache H., Mazumdar R. R., Rosenberg C., A game theoretic framework for bandwidth allocation and pricing in broadband networks IEEE/ACM Transactions on Networking 2000 8 5 667 678
8. Lin X., Shroff N. B., The impact of imperfect scheduling on cross-layer rate control in wireless networks 3 Proceedings of the Annual Joint Conference on the IEEE Computer and Communications Societies (INFOCOM '05) March 2005 1804 1814
9. Wu X., Srikant R., Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks Proceedings of the 25th Annual Joint Conference on the IEEE Computer and Communications Societies (INFOCOM '06) April 2006
10. Stolyar A. L., Maximizing queueing network utility subject to stability: greedy primal-dual algorithm Queueing Systems 2005 50 4 401 457
11. Miller B., Bisdikian C., Bluetooth Revealed: The Insider's Guide to an Open Specification for Global Wireless Communications 2000 Prentice-Hall
12. Hajek B., Sasaki G., Link scheduling in polynomial time IEEE Transactions on Information Theory 1988 34 5 910 917
13. Gabow H. N., Data structures for weighted matching and nearest common ancestors with linking Proceedings of the Symposium on Discrete Algorithms (SODA '90) 1990
14. Balakrishnan H., Barrett C. L., Kumar V. S. A., Marathe M. V., Thite S., The distance-2 matching problem and its relationship to the MAC-layer capacity of ad hoc wireless networks IEEE Journal on Selected Areas in Communications 2004 22 6 1069 1079
15. Chaporkar P., Kar K., Luo X., Sarkar S., Throughput and fairness guarantees through maximal scheduling in wireless networks IEEE Transactions on Information Theory 2008 54 2 572 594
16. Modiano E., Shah D., Zussman G., Maximizing throughput in wireless networks via gossiping Performance Evaluation Review 2006 34 1 27 38
17. Sanghavi S., Bui L., Srikant R., Distributed link scheduling with constant overhead Proceedings of the ACM International Conference on Measurement and Modeling of Computer Systems (Sigmetrics '07) June 2007 313 324
18. Sharma G., Joo C., Shroff N. B., Distributed scheduling schemes for throughput guarantees in wireless networks Proceedings of the 44th Annual Allerton Conference on Communications, Control, and Computing September 2006
19. Lin X., Rasool S. B., Constant-time distributed scheduling policies for ad hoc wireless networks IEEE Transactions on Automatic Control 2009 54 2 231 242
20. Joo C., Shroff N. B., Performance of random access scheduling schemes in multi-hop wireless networks Proceedings of the 26th Annual Joint Conference on the IEEE Computer and Communications Societies (INFOCOM '07) May 2007 19 27 (Pubitemid 47334211)
21. Stockmeyer L. J., Vazirani V. V., NP-completeness of some generalizations of the maximum matching problem Information Processing Letters 1982 15 1 14 19
22. Joo C., Sharma G., Mazumdar R. R., Shroff N. B., On the complexity of scheduling in wireless networks 2010 Korea University of Technology and Education. http://netlab.kut.ac.kr
23. Sharma G., Mazumdar R. R., Shroff N. B., Maximum weighted matching with interference constraints Proceedings of the 4th Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom '06) March 2006 70 74
24. Gill J., Computational complexity of probabilistic turing machines SIAM Journal on Computing 1977 6 4 675 695
25. 1-ε Acta Mathematica 1999 182 1 105 142
26. Halldrsson M. M., Approximations of weighted independent set and hereditary subset problems Journal of Graph Algorithms and Applications 2000 4 1 1 16
27. Krumke S. O., Marathe M. V., Ravi S. S., Models and approximation algorithms for channel assignment in radio networks Wireless Networks 2001 7 6 575 584
28. Teng S. H., Points, spheres, and separators, a unified geometric approach to graph separators, Ph.D. thesis August 1991 Pittsburgh, Pa, USA School of Computer Science, Carnegie Mellon University, CMU-CS-91-184
29. Kuhn F., Wattenhofer R., Zollinger A., Ad-hoc networks beyond unit disk graphs Proceedings of the 1st ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC '03) September 2003 San Diego, Calif, USA 69 78
30. Baker B. S., Approximation algorithms for NP-complete problems on planar graphs Journal of the ACM 1994 41 1 153 180
31. Hunt H. B. III, Marathe M. V., Radhakrishnan V., Ravi S. S., Rosenkrantz D. J., Stearns R. E., NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs Journal of Algorithms 1998 26 2 238 274
32. Hochbaum D. S., Maass W., Approximation schemes for covering and packing problems in image processing and VLSI Journal of the ACM 1985 32 1 130 136
33. Avis D., A survey of heuristics for the weighted matching problem Networks 1983 13 4 475 493
34. Ramanathan S., Lloyd E. L., Scheduling algorithms for multihop radio networks IEEE/ACM Transactions on Networking 1993 1 2 166 177
35. Hoepman J.-H., Simple distributed weighted matchings. http://arxiv.org/abs/cs/0410047v1
36. Joo C., Lin X., Shroff N. B., Understanding the capacity region of the greedy maximal scheduling algorithm in multi-hop wireless networks Proceedings of the Annual Joint Conference on the IEEE Computer and Communications Societies (INFOCOM '08) April 2008 1103 1111
37. Joo C., Lin X., Shroff N. B., Performance limits of greedy maximal matching in multi-hop wireless networks Proceedings of the 46th IEEE Conference on Decision and Control (CDC '07) December 2007 1128 1133 (Pubitemid 351277305)