Matthew Andrews
ABSTRACT
We consider the problem of scheduling wireless data in systems such as 802.16 (WIMAX). Each scheduling decision involves constructing a frame of one or more time slots. Within each time slot multiple carriers must be assigned to users. The important aspect of our problem is that a scheduler knows the channel rates across all users and all carriers whenever a scheduling decision is made. Hence there is no need to treat each carrier in complete isolation. This gives a potential for enhancing performance by allocating multiple carriers simultaneously.
We analyze this problem in a situation where finite queues are fed by a data arrival process. We generalize the well-known MaxWeight algorithm for the single-carrier setting to accommodate a number of natural optimization problems in the multi-carrier setting. We state the hardness of these problems and present simple algorithmic solutions with provable performance bounds. We also validate our algorithms via numerical examples.
- R. Agrawal and V. Subramanian. Optimality of certain channel aware scheduling policies. In Proceedings of the 40th Annual Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, October 2002.Google Scholar
- M. Andrews. Instability of the proportional fair scheduling algorithm for HDR. IEEE Transactions on Wireless Communications, 3(5), 2004. Google ScholarDigital Library
- M. Andrews, K. Kumaran, K. Ramanan, A. Stolyar, R. Vijayakumar, and P. Whiting. CDMA data QoS scheduling on the forward link with variable channel conditions. Bell Labs Technical Memorandum, April 2000.Google Scholar
- M. Andrews, K. Kumaran, K. Ramanan, A. Stolyar, R. Vijayakumar, and P. Whiting. Providing quality of service over a shared wireless link. IEEE Communications Magazine, February 2001. Google ScholarDigital Library
- M. Andrews, L. Qian, and A. Stolyar. Optimal utility based multi-user throughput allocation subject to throughput constraints. In Proceedings of IEEE INFOCOM '05, 2005.Google ScholarCross Ref
- M. Andrews and A. Slivkins. Oscillations with TCP-like flow control in networks of queues. In Proceedings of IEEE INFOCOM '06, 2006.Google ScholarCross Ref
- M. Andrews and L. Zhang. Scheduling over non-stationary wireless channels with finite rate sets. IEEE/ACM Transactions on Networking, 2006. Google ScholarDigital Library
- P. Bender, P. Black, M. Grob, R. Padovani, and N. Sindhushayana A. Viterbi. CDMA/HDR: A bandwidth efficient high speed data service for nomadic users. IEEE Communications Magazine, July 2000. Google ScholarDigital Library
- C. Chekuri and S. Khanna. A PTAS for the multiple knapsack problem. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 213--222, San Francisco, CA, January 2000. Google ScholarDigital Library
- A. Eryilmaz and R. Srikant. Fair resource allocation in wireless networks using queue-length based scheduling and congestion control. In Proceedings of IEEE INFOCOM '05, Miami, FL, March 2005.Google ScholarCross Ref
- M. Fisher, G. Nemhauser, and L. Wolsey. An analysis of approximations for maximizing submodular set functions-II. Mathematical Programming Study, 1978.Google ScholarCross Ref
- L. Fleischer, M. Goemans, V. Mirrokni, and M. Sviridenko. Tight approximation algorithms for maximum general assignment problems. In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 611--620, Miami, FL, 2006. Google ScholarDigital Library
- N. Garg and J. Könemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pages 300--309, Palo Alto, CA, November 1998. Google ScholarDigital Library
- D. Hochbaum. Various notions of approximations; Good, better, best, and more. In Approximation algorithms for NP-hard problems, D. Hochbaum ed., pages 346--398, 1995. Google ScholarDigital Library
- A. Jalali, R. Padovani, and R. Pankaj. Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system. In Proceedings of the IEEE Semiannual Vehicular Technology Conference, VTC2000-Spring, Tokyo, Japan, May 2000.Google ScholarCross Ref
- Viggo Kann. Maximum bounded 3-dimensional matching is max snp-complete. Inf. Process. Lett., 37(1):27--35, 1991. Google ScholarDigital Library
- H. Kushner and P. Whiting. Asymptotic properties of proportional-fair sharing algorithms. In 40th Annual Allerton Conference on Communication, Control, and Computing, 2002.Google Scholar
- X. Liu, E. Chong, and N. B. Shroff. Opportunistic transmission scheduling with resource-sharing constraints in wireless networks. IEEE Journal on Selected Areas in Communications, 19(10), 2001. Google ScholarDigital Library
- X. Liu, E. Chong, and N. B. Shroff. A framework for opportunistic scheduling in wireless networks. Computer Networks, 41(4):451--474, 2003. Google ScholarDigital Library
- M. Neely, E. Modiano, and C. Li. Fairness and optimal stochastic control for heterogeneous networks. In Proceedings of IEEE INFOCOM '05, Miami, FL, March 2005.Google ScholarCross Ref
- M. Neely, E. Modiano, and C. Rohrs. Power and server allocation in a multi-beam satellite with time varying channels. In Proceedings of IEEE INFOCOM '02, New York, NY, June 2002.Google ScholarCross Ref
- S. Shakkottai and A. Stolyar. Scheduling algorithms for a mixture of real-time and non-real-time data in HDR. In Proceedings of 17th International Teletraffic Congress (ITC-17), pages 793--804, Salvador da Bahia, Brazil, 2001.Google ScholarCross Ref
- S. Shakkottai and A. Stolyar. Scheduling for multiple flows sharing a time-varying channel: The exponential rule. Analytic Methods in Applied Probability, 207:185--202, 2002.Google Scholar
- A. Stolyar. Maximizing queueing network utility subject to stability: Greedy primal-dual algorithm. Queueing Systems, 50(4):401--457, 2005. Google ScholarDigital Library
- A. Stolyar. On the asymptotic optimality of the gradient scheduling algorithm for multiuser throughput allocation. Operations Research, 53:12--25, 2005. Google ScholarDigital Library
- L. Tassiulas and A. Ephremides. Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control, 37(12):1936--1948, December 1992.Google ScholarCross Ref
- L. Tassiulas and A. Ephremides. Dynamic server allocation to parallel queues with randomly varying connectivity. IEEE Transactions on Information Theory, 30:466--478, 1993.Google ScholarDigital Library
- D. Tse. Multiuser diversity in wireless networks. http://www.eecs.berkeley.edu/~dtse/stanford416.ps, 2002.Google Scholar
Index Terms
Scheduling algorithms for multi-carrier wireless data systems
Recommendations
Scheduling algorithms for multicarrier wireless data systems
We consider the problem of scheduling multicarrier wireless data in systems such as IEEE 802.16 (WiMAX). Each scheduling decision involves assigning carriers to users for each time slot, subject to the constraint that each carrier is assigned to at most ...
An efficient centralized scheduling algorithm for IEEE 802.16 multi-radio mesh networks
In centralized scheduling for IEEE 802.16 mesh networks, all packets should be transported through the BS (Base Station). The links to or from the BS become the system's bottleneck and the throughput is heavily impacted by the interference. To solve ...
Downlink scheduling and resource allocation for OFDM systems
We consider scheduling and resource allocation for the downlink of a cellular OFDM system, with various practical considerations including integer tone allocations, different sub-channelization schemes, maximum SNR constraint per tone, and "self-noise" ...
Comments