On the complexity of scheduling in wireless networks

Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM

Volumn 2006, Issue , 2006, Pages 227-238

  Sharma, Gaurav ^a   Mazumdar, Ravi R ^b   Shroff, Ness B ^a  

^a PURDUE UNIVERSITY   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Capacity; Computational complexity; Interference; Maximum weighted matching; Scheduling; Throughput; Wireless networks

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; RADIO INTERFERENCE; TELECOMMUNICATION NETWORKS; THROUGHPUT; WIRELESS TELECOMMUNICATION SYSTEMS;

CONNECTIVITY GRAPHS; MAXIMUM WEIGHTED MATCHING; SINGLE-HOP TRAFFIC; WIRELESS NETWORKS;

SCHEDULING;

EID: 33751067030     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1161089.1161116     Document Type: Conference Paper

References (36)

1. B. S. Baker. Approximation algorithms for NP-complete problems on planar graphs. J. ACM, 41(1):153-180, January 1994.
2. D. J. Baker, J. Wieselthier, and A. Ephremides. A Distributed Algorithm for Scheduling the Activation of Links in a Self-organizing Mobile Radio Network. In IEEE ICC, pages 2F.6.1-2F.6.5, 1982.
3. T. Bonald and L. Massoulie. Impact of fariness on Internet performance. In ACM Sigmetrics, 2001.
4. L. Bui, A. Eryilmaz, R. Srikant, and X. Wu. Joint Asynchronous Congestion Control and Distributed Scheduling for Multi-Hop Wireless Networks. In IEEE INFOCOM, 2006.
5. P. Chaporkar, K. Kar, and S. Sarkar. Throughput Guarantees Through Maximal Scheduling in Wireless Networks. 43rd Annual Allerton Conf. on Communications, Control, and Computing, Sep 2005.
6. M. V. Clark, K. K. Leung, B. McNair, and Z. Kostic. Outdoor IEEE 802.11 cellular networks: Radio link performance. In IEEE ICC, April 2002.
7. R. L. Cruz and A. V. Santhanam. Optimal routing, link scheduling and power control in multihop wireless networks. In INFOCOM, 2003.
8. H. N. Gabow. Data Structures for Weighted Matching and Nearest Common Ancestors with Linking. In SODA, 1990.
9. J. Gill. Computational Complexity of Probabilistic Turing Machines. SIAM Journal on Computing, 6(4):675-695, 1977.
10. H. Balakrishnan et al. The Distance-2 Matching Problem and its Relationship to the MAC-layer Capacity of Ad Hoc Wireless Networks. IEEE JSAC, 22(6):1069-1079, Aug 2004.
11. B. Hajek and G. Sasaki. Link Scheduling in Polynomial Time. IEEE Transactions on Information Theory, 34(5):910-917, Sep 1988.
12. M. M. Halldorsson. Approximations of Weighted Independent Set and Hereditary Subset Problems. Journal of Graphs Algorithms and Applications, 4(1):1-16, 2000.
13. 1-ε. Acta Mathematica, 182:105-142, 1999.
14. D. Hochbaum and W. Maass. Approximation Schemes for Covering and Packing Problems in Image Processing and VLSI. J. ACM, 32(1);130-136, 1985.
15. H. B. Hunt, M. V. Marathe, V. Radhakrishnan, S. S. Ravi, D. J. Rosenkrantz, and R. E. Stearns. NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs. Journal of Algorithms, 26(2):238-274, Feb 1998.
16. F. Kelly, A. Maulloo, and D. Tan. Rate control in communication networks: shadow prices, proportional fairness and stability. In Journal of the Oper. Res. Society, volume 49, pages 237-252, 1998.
17. S. O. Krumke, M. V. Marathe, and S. S. Ravi. Models and Approximation Algorithms for Channel Assignment in Radio Networks. Wireless Networks, 7(6):575-584, 2001.
18. F. Kuhn, R. Wattenhofer, and A. Zollinger. Ad-hoc networks beyond unit disk graphs. In 1st ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), San Diego, California, USA, September 2003.
19. X. Lin and N. B. Shroff. The Impact of Imperfect Scheduling on Cross-Layer Rate Control in Multihop Wireless Networks. In IEEE INFOCOM, Mar 2005.
20. B. Miller and C. Bisdikian. Bluetooth Revealed: The Insider's Guide to an Open Specification for Global Wireless Communications. Prentice Hall, 2000.
21. M. J. Neely, E. Modiano, and C. Li. Fairness and optimal stochastic control for heterogeneous networks. In IEEE INFOCOM, 2005.
22. M. J. Neely, E. Modiano, and C. E. Rohrs. Dynamic Power Allocation and Routing for Time Varying Wireless Networks. In IEEE INFOCOM, 2003.
23. M. J. Neely, E. Modiano, and C. E. Rohrs. Power allocation and routing in multibeam satellites with time-varying channels. IEEE/ACM Trans. Netw., 11(1):138-152, 2003.
24. S. Sarkar and L. Tassiulas. End-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks. IEEE Trans. on Automatic Control, 50(9), Sep 2005.
25. G. Sharma, R. R. Mazumdar, and N. B. Shroff. Maximum Weighted Matching with Interference Constraints. In IEEE FAWN, March 2006.
26. R. Srikant. The Mathematics of Internet Congestion Control. Birkhauser, 2004.
27. L. Stockmeyer and V. Vazirani. NP-completeness of some generalizations of the maximum matching problem. Inform. Process. Lett., 15(1):14-19, 1982.
28. A. L. Stolyar. Maximizing Queueing Network Utility subject to Stability: Greedy Primal-Dual Algorithm. Queueing Systems, 50(4):401-457, 2005.
29. L. Tassiulas and A. Ephremides. Jointly optimal routing and scheduling in packet radio networks. IEEE Trans. on Info. Theory, 38(1):165-168, Jan 1992.
30. L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. on Automatic Control, 37(12):1936-1948, December 1992.
31. S. H. Teng. Points, Spheres, and Separators, A Unified Geometric Approach to Graph Separators. Ph.D. thesis, School of Computer Science, Carnegie Mellon University, CMU-CS-91-184, Pittsburgh, Aug 1991.
32. X. Wu and R. Srikant. Regulated maximal matching: A distributed scheduling algorithm for multi-hop wireless networks with node exclusive spectrum sharing. In IEEE CDC, 2005.
33. X. Wu and R. Srikant. Bounds on the Capacity Region of Multi-hop Wireless Networks under Distributed Greedy Scheduling. In IEEE INFOCOM, 2006.
34. L. Xiao, M. Johansson, and S. Boyd. Simultaneous routing and resource allocation via dual decomposition. IEEE Trans. on Comm., 52(7):1136-1144, July 2004.
35. H. Yaiche, R. Mazumdar, and C. Rosenberg. A game-theoretic framework for bandwidth allocation and pricing in broadband networks. IEEE/ACM Trans. on Networking, 8(5):667-678, Oct 2000.
36. Y. Yi and S. Shakkottai. Hop-by-hop Congestion Control over a Wireless Multi-hop Network. In IEEE INFOCOM, March 2004.