Browse > Article

Extended Proportional Fair Scheduling for Statistical QoS Guarantee in Wireless Networks  

Lee, Neung-Hyung (DMC R&D Center, Samsung Electronics)
Choi, Jin-Ghoo (Department of Information and Communication Engineering, Yeungnam University)
Bahk, Sae-Woong (School of Electrical Engineering and INMC, Seoul National University)
Publication Information
Journal of Communications and Networks / v.12, no.4, 2010 , pp. 346-357 More about this Journal
Abstract
Opportunistic scheduling provides the capability of resource management in wireless networks by taking advantage of multiuser diversity and by allowing delay variation in delivering data packets. It generally aims to maximize system throughput or guarantee fairness and quality of service (QoS) requirements. In this paper, we develop an extended proportional fair (PF) scheduling policy that can statistically guarantee three kinds of QoS. The scheduling policy is derived by solving the optimization problems in an ideal system according to QoS constraints. We prove that the practical version of the scheduling policy is optimal in opportunistic scheduling systems. As each scheduling policy has some parameters, we also consider practical parameter adaptation algorithms that require low implementation complexity and show their convergences mathematically. Through simulations, we confirm that our proposed schedulers show good fairness performance in addition to guaranteeing each user's QoS requirements.
Keywords
Convergence; convex optimization; opportunistic scheduler; proportional fairness; quality of service (QoS) constraint; utility;
Citations & Related Records

Times Cited By Web Of Science : 0  (Related Records In Web of Science)
Times Cited By SCOPUS : 0
연도 인용수 순위
  • Reference
1 H. J. Kushner and P. A. Whiting, "Convergence of proportional-fair sharing algorithms under general conditions," IEEE Trans. Wireless Commun., vol. 3, no. 4, pp. 1250–1259, July 2004.   DOI   ScienceOn
2 C. Li, X.Wang, and D. Reynolds, "Utility-based joint power and rate allocation for downlink CDMA with blind multiuser detection," IEEE Trans. Wireless Commun., vol. 4, no. 3, pp. 1163–1174, May 2005.
3 V. K. N. Lau, "Analytical framework for multiuser uplink MIMO spacetime scheduling design with convex utility functions," IEEE Trans. Wireless Commun., vol. 3, no. 5, pp. 1832–1843, Sept. 2004.   DOI   ScienceOn
4 V. K. N. Lau, "Optimal downlink space-time scheduling design with convex utility functions-multiple-antenna systems with orthogonal spatial multiplexing," IEEE Trans. Veh. Technol., vol. 54, no. 4, pp. 1322–1333, July 2005.   DOI   ScienceOn
5 Z. Jiang, Y. Ge, and Y. G. Li, "Max-utility wireless resource management for best-effort traffic," IEEE Trans. Wireless Commun., vol. 4, no. 1, pp. 100–111, Jan. 2005.
6 C. Curescu and S. Nadjm-Tehrani, "Time-aware utility-based resource allocation in wireless networks," IEEE Trans. Parallel Distrib. Syst., vol. 16, no. 7, pp. 624–636, July 2005.
7 F. P. Kelly, "Charging and rate control for elastic traffic," Eur. Trans. Telecommun., vol. 8, pp. 33–37, 1997.   DOI   ScienceOn
8 F. P. Kelly, A. Maulloo, and D. Tan, "Rate control in communication networks: Shadow prices, proportional fairness, and stability," J. Operational Research Soc., vol. 49, no. 3, pp. 237–252, 1998.
9 A. Jalali, R. Padovani, and P. Pankaj, "Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system," in Proc. IEEE VTC, vol. 3, May 2000, pp. 1854–1858.
10 J. M. Holtzman, "Asymptotic analysis of proportional fair algorithm," in Proc. IEEE PIMRC, vol. 2, 2001, pp. F33–F37.
11 S. Borst and P. Whiting, "Dynamic rate control algorithms for HDR throughput optimization," in Proc. IEEE INFOCOM, 2001, pp. 976–985.
12 A. L. Stolyar, "On the asymptotic optimality of the gradient scheduling algorithm for multi-user throughput allocation," Operations Research. no. 53, pp. 12–25, 2005
13 R. Agrawal, A. Bedekar, R. J. La, and V. Subramanian, "Class and channel condition based weighted proportional fair scheduler," in Proc. Teletraffic Engineering in the Internet Era, ITC-17, 2001,pp. 553–565.
14 R. Agrawal and V. Subramanian, "Optimality of certain channel-aware scheduling policies," in Proc. AACCCC, 2002, pp. 1532–1541.
15 D. M. Andrews, L. Qian, and A. L. Stolyar, "Optimal utility-based throughput allocation subject to throughput constraints," in Proc. IEEE INFOCOM, 2005, pp. 2415–2424.
16 P. Viswananth, D. Tse, and R. Laroia, "Opportunistic beamforming using dumb antennas," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1277–1294, June. 2002.
17 H. Kushner and G. Yin, Stochastic Approximation Algorithms and Applications, Springer, New York, 1997.
18 S. Shakkottai and A. L. Stolyar, "Scheduling algorithms for a mixture of real-time and non-real-time data in HDR," in Proc. International Teletraffic Congress, Sept, 2000, pp. 793–804.
19 T. E. Kolding, "QoS-aware proportional fair packet scheduling with required activity detection," in Proc. IEEE VTC, Sept. 2006.
20 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 Lab. Tech. Rep., Apr. 2000.
21 M. Agarwal and A. Puri, "Base station scheduling of requests with fixed deadlines," in Proc. IEEE INFOCOM, 2002, pp. 487–496.
22 D.Wu and R. Negi,"Downlink scheduling in a celluar network for qualityof- service assurance," IEEE Trans. Veh. Technol., vol. 53, no. 5, pp. 1547– 1557, Sept. 2004.   DOI   ScienceOn
23 X. Liu, E. K. P. Chong, and N. B. Shroff, "A framework for opportunistic scheduling in wireless networks," Compu. Netw. J., vol. 41, no. 4, pp. 451– 474, Mar. 2003.   DOI   ScienceOn
24 M. Xiao, N. B. Shroff, and E. K. P. Chong, "A utility-based power-control scheme in wireless cellular systems," IEEE/ACMTrans. Netw., vol. 11, no. 2, pp. 210–221, Apr. 2003.