This Article 
 Bibliographic References 
 Add to: 
Fair Resource Allocation with Guaranteed Statistical QoS for Multimedia Traffic in Wideband CDMA Cellular Network
March/April 2005 (vol. 4 no. 2)
pp. 166-177
A dynamic fair resource allocation scheme is proposed to efficiently support real-time and non-real-time multimedia traffic with guaranteed statistical quality of service (QoS) in the uplink of a wideband code-division multiple access (CDMA) cellular network. The scheme uses the generalized processor sharing (GPS) fair service discipline to allocate uplink channel resources, taking into account the characteristics of channel fading and intercell interference. In specific, the resource allocated to each traffic flow is proportional to an assigned weighting factor. For real-time traffic, the assigned weighting factor is a constant in order to guarantee the traffic statistical delay bound requirement; for non-real-time traffic, the assigned weighting factor can be adjusted dynamically according to fading channel states and the traffic statistical fairness bound requirement. Compared with the conventional static-weight scheme, the proposed dynamic-weight scheme achieves capacity gain. A flexible trade-off between the GPS fairness and efficient resource utilization can also be achieved. Analysis and simulation results demonstrate that the proposed scheme enhances radio resource utilization and guarantees statistical QoS under different fairness bound requirements.

[1] S.-J. Oh and K.M. Wasserman, “Dynamic Spreading Gain Control in Multiservice CDMA Networks,” IEEE J. Selected Areas Comm., vol. 17, pp. 918-927, May 1999.
[2] O. Gurbuz and H. Owen, “Dynamic Resource Scheduling Schemes for W-CDMA Systems,” IEEE Comm. Magazine, vol. 38, pp. 80-84, Oct. 2000.
[3] J.B. Kim and M.L. Honig, “Resource Allocation for Multiple Classes of DS-CDMA Traffic,” IEEE Trans. Vehicular Technology, vol. 49, pp. 506-519, Mar. 2000.
[4] P. Ramanathan and P. Agrawal, “Adapting Packet Fair Queueing Algorithms to Wireless Networks,” Proc. ACM/IEEE MOBICOM '98, pp. 1-9, Oct. 1998.
[5] M.A. Arad and A. Leon-Garcia, “A Generalized Processor Sharing Approach to Time Scheduling in Hybrid CDMA/TDMA,” Proc. IEEE INFOCOM '98, pp. 1164-1171, Mar. 1998.
[6] T. Nandagopal, S. Lu, and V. Bharghavan, “A Unified Architecture for the Design and Evaluation of Wireless Fair Scheduling Algorithms,” Wireless Networks, vol. 7, pp. 231-247, Aug. 2002.
[7] A.K. Parekh and R.G. Gallager, “A Generalized Processor Sharing Approach to Flow Control in Integrated Sevices Networks: The Single-Node Case,” IEEE/ACM Trans. Networking, vol. 1, pp. 344-357, June 1993.
[8] D. Stiliadis and A. Varma, “Efficient Fair Queueing Algorithms for Packet-Switched Networks,” IEEE/ACM Trans. Networking, vol. 6, pp. 175-185, Apr. 1998.
[9] A.J. Viterbi, Principles of Spread Sprectrum Communication. Reading, Mass.: Addison Wesley, 1995.
[10] B. Hashem and E. Sousa, “Reverse Link Capacity and Interference Statistics of a Fixed-Step Power-Controlled DS/CDMA System Under Slow Multipath Fading,” IEEE Trans. Comm., vol. 17, pp. 756-73, May 1999.
[11] D.K. Kim and F. Adachi, “Theoretical Analysis of Reverse Link Capacity for an SIR-Based Power-Controlled Cellular CDMA System in a Multipath Fading Environment,” IEEE Trans. Vehicular Technology, vol. 50, pp. 452-464, Mar. 2001.
[12] S.W. Kim and Y.H. Lee, “Combined Rate and Power Adaptation in DS/CDMA Communications over Nakagami Fading Channels,” IEEE Trans. Comm., vol. 48, pp. 162-168, Jan. 2000.
[13] X. Liu, E.K.P. Chong, and N.B. Shroff, “Opportunistic Transmission Scheduling with Resource-Sharing Constraints in Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 19, pp. 2053-2064, Oct. 2001.
[14] F. Berggren and R. Jantti, “Asymptotically Fair Scheduling on Fading Channels,” Proc. IEEE Vehicular Technology Conf., pp. 1934-1938, 2002.
[15] A.C. Varsou and H.V. Poor, “An Adaptive Rate Processor Sharing Technique,” Proc. IEEE Vehicular Technology Conf., pp. 2584-2588, Oct. 2001.
[16] L. Xu, X. Shen, and J.W. Mark, “Dynamic Fair Scheduling With QoS Constraints in Multimedia Wideband CDMA Cellular Networks,” IEEE Trans. Wireless Comm., vol. 3, no. 1, pp. 60-73, Jan. 2004.
[17] A. Stamoulis and G. Giannakis, “Packet Fair Queueing Scheduling Based on Multirate Multipath-Transparent CDMA for Wireless Networks,” Proc. IEEE INFOCOM 2000, pp. 1067-1076, 2000.
[18] H. Holma and A. Toskala, WCDMA For UMTS: Radio Access For Third Generation Mobile Communications. John Wiley & Sons, 2000.
[19] Z. Liu, M.J. Karol, M.E. Zarki, and K.Y. Eng, “Channel Access and Interference Issues in Multi-code DS-CDMA Wireless Packet (ATM) Networks,” Wireless Networks, vol. 2, pp. 173-193, Aug. 1996.
[20] S. Ariyavisitakul, “Signal and Interference Statistics of a CDMA System with Feedback Power Control— Part II,” IEEE Trans. Comm., vol. 42, pp. 597-605, Feb./Mar./Apr. 1994.
[21] M. Schwartz, Broadband Integrated Networks. Prentice Hall, 1996.
[22] A. Elwalid, D. Mitra, and R.H. Wentworth, “A New Approach for Allocating Buffers and Bandwidth to Heterogeneous, Regulated Traffic in an ATM Node,” IEEE J. Selected Areas in Comm., vol. 13, pp. 1115-1127, Aug. 1995.
[23] Microwave Mobile Communications, W.C. Jakes, ed. New York: Wiley, 1974.
[24] L. Xu, “Radio Link Scheduling for QoS Support in Wideband CDMA Cellular Networks,” PhD disseration, Univ. of Waterloo, Canada, 2003.

Index Terms:
Resource allocation, generalized processor sharing, W-CDMA cellular network, quality of service, multimedia traffic.
Liang Xu, Xuemin (Sherman) Shen, Jon W. Mark, "Fair Resource Allocation with Guaranteed Statistical QoS for Multimedia Traffic in Wideband CDMA Cellular Network," IEEE Transactions on Mobile Computing, vol. 4, no. 2, pp. 166-177, March-April 2005, doi:10.1109/TMC.2005.26
Usage of this product signifies your acceptance of the Terms of Use.