This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Dynamic Bandwidth Allocation for Multimedia Traffic with Rate Guarantee and Fair Access in WCDMA Systems
September/October 2005 (vol. 4 no. 5)
pp. 420-429
ASCII Text
x 
 
Chih-Min Chao, Yu-Chee Tseng, Li-Chun Wang, "Dynamic Bandwidth Allocation for Multimedia Traffic with Rate Guarantee and Fair Access in WCDMA Systems," IEEE Transactions on Mobile Computing, vol. 4, no. 5, pp. 420-429, September/October, 2005.
 
 
BibTex
x
 
@article{ 10.1109/TMC.2005.65,
author = {Chih-Min Chao and Yu-Chee Tseng and Li-Chun Wang},
title = {Dynamic Bandwidth Allocation for Multimedia Traffic with Rate Guarantee and Fair Access in WCDMA Systems},
journal ={IEEE Transactions on Mobile Computing},
volume = {4},
number = {5},
issn = {1536-1233},
year = {2005},
pages = {420-429},
doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2005.65},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Mobile Computing
TI - Dynamic Bandwidth Allocation for Multimedia Traffic with Rate Guarantee and Fair Access in WCDMA Systems
IS - 5
SN - 1536-1233
SP420
EP429
EPD - 420-429
A1 - Chih-Min Chao,
A1 - Yu-Chee Tseng,
A1 - Li-Chun Wang,
PY - 2005
KW - Index Terms- Mobile computing
KW - OVSF
KW - personal communication services
KW - WCDMA
KW - wireless communication
KW - 3G.
VL - 4
JA - IEEE Transactions on Mobile Computing
ER -
 
Yu-Chee Tseng, IEEE Computer Society
Packet scheduling in a WCDMA system poses a new challenge due to its nature of variable bit rates and location-dependent, time-varying channel conditions. In this work, three new downlink scheduling algorithms for a WCDMA base station are proposed to support multimedia transmissions. Using a credit management and a compensation mechanism, our algorithms provide rate guarantee and fair access to mobile terminals. In particular, we propose to allow a user to simultaneously use multiple OVSF codes in a time-sharing manner, which we call a multicode, shared model. Using multiple codes allows us to compensate those users suffering from bad communication quality or even errors. The proposed schemes can tolerate a multistate link condition (compared to the typically assumed two-state, or good-or-bad, link condition) by adjusting the number of OVSF codes and the spreading factor of each code. Simulation results show that the proposed schemes do achieve higher bandwidth utilization while keeping transmission delay low.

[1] Third Generation Partnership Project; Technical Specification Group Radio Access Network, Spreading and Modulation (FDD), http:/www.3gpp.org, 1999.
[2] F. Adachi, M. Sawahashi, and H. Suda, “Wideband DS-CDMA for Next-Generation Mobile Communications Systems,” IEEE Comm. Magazine, vol. 36, pp. 56-69, Sept. 1998.
[3] R. Assarut, K. Kawanishi, U. Yamamoto, Y. Onozato, and M. Masahiko, “Region Division Assignment of Orthogonal Variable-Spreading-Factor Codes in W-CDMA,” Proc. IEEE Vehicular Technology Conf., pp. 1184-1898, 2001.
[4] Y. Cao and V.O. Li, “Scheduling Algorithms in Broad-Band Wireless Networks,” Proc. IEEE INFOCOM, vol. 89, no. 1, pp. 76-87, Jan. 2001.
[5] C.-M. Chao, Y.-C. Tseng, and L.-C. Wang, “Reducing Internal and External Fragmentations of OVSF Codes in WCDMA Systems with Multiple Codes,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC), pp. 693-698, 2003.
[6] W.-T. Chen, Y.-P. Wu, and H.-C. Hsiao, “A Novel Code Assignment Scheme for W-CDMA Systems,” Proc. IEEE Vehicular Technology Conf., pp. 1182-1186, 2001.
[7] R.-G. Cheng and P. Lin, “OVSF Code Channel Assignment for IMT-2000,” Proc. IEEE Vehicular Technology Conf., pp. 2188-2192, 2000.
[8] D. Eckhardt and P. Steenkiste, “Effort-Limited Fair (ELF) Scheduling for Wireless Networks,” Proc. IEEE INFOCOM, pp. 1097-1106, 2000.
[9] R. Fantacci and S. Nannicini, “Multiple Access Protocol for Integration of Variable Bit Rate Multimedia Traffic in UMTS/IMT-2000 Based on Wideband CDMA,” IEEE J. Selected Areas in Comm., vol. 18, no. 8, pp. 1441-1454, Aug. 2000.
[10] V.K. Garg, IS-95 CDMA and cdma2000. Prentice Hall, 2000.
[11] J. Gomez, A.T. Campbell, and H. Morikawa, “The Havana Framework for Supporting Application and Channel Dependent QoS in Wireless Networks,” Proc. Int'l Conf. Network Protocols, pp. 235-244, 1999.
[12] H. Holma and A. Toskala, WCDMA for UMTS. John Wiley & Sons, 2000.
[13] C.-L. I et al., “IS-95 Enhancements for Multimedia Services,” Bell Labs. Tech. J., pp. 60-87, Autumn 1996.
[14] A.Z. Kam, T. Minn, and K.-Y. Siu, “Supporting Rate Guarantee and Fair Access for Bursty Data in W-CDMA,” IEEE J. Selected Areas in Comm., vol. 19, no. 12, pp. 2121-2130, Nov. 2001.
[15] D. Kandlur, K. Shin, and D. Ferrari, “Real-Time Communication in Multihop Networks,” Proc. ACM SIGCOMM, pp. 300-307, 1991.
[16] S. Lu and V. Bharghavan, “Fair Scheduling in Wireless Packet Networks,” IEEE/ACM Trans. Networking, vol. 7, no. 4, pp. 473-489, 1999.
[17] T. Minn and K.-Y. Siu, “Dynamic Assignment of Orthogonal Variable-Spreading-Factor Codes in W-CDMA,” IEEE J. Selected Areas in Comm., vol. 18, no. 8, pp. 1429-1440, Aug. 2000.
[18] T.S.E. Ng, I. Stoica, and H. Zhang, “Packet Fair Queueing Algorithms for Wireless Networks with Location-Dependent Errors,” Proc. INFOCOM, pp. 1103-1111, 1998.
[19] A. Parekh and R.G. Gallager, “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case,” IEEE/ACM Trans. Networking, vol. 1, pp. 334-357, June 1993.
[20] J. G. Proakis, Digital Communications, fouth ed. McGraw-Hill, 2001.
[21] P. Ramanathan and P. Agrawal, “Adapting Packet Fair Queueing Algorithms to Wireless Networks,” Proc. ACM/IEEE MOBICOM, pp. 1-9, 1998.
[22] F. Shueh, Z.-E.P. Liu, and W.-S.E. Chen, “A Fair, Efficient, and Exchangeable Channelization Code Assignment Scheme for IMT-2000,” Proc. IEEE Int'l Conf. Personal Wireless Comm. (ICPWC), pp. 429-436, 2000.
[23] Y.-C. Tseng and C.-M. Chao, “Code Placement and Replacement Strategies for Wideband CDMA OVSF Code Tree Management,” IEEE Trans. Mobile Computing, vol. 1, no. 4, pp. 293-302, Oct.-Dec. 2002.
[24] J. Wigard, N.A.H. Madsen, P.A. Gutierrez, I.L. Sepulveda, and P. Mogensen, “Packet Scheduling with QoS Differentiation,” Wireless Personal Comm., vol. 23, pp. 147-160, 2002.
[25] L. Xu, X. Shen, and J.W. Mark, “Dynamic Bandwidth Allocation with Fair Scheduling for WCDMA Systems,” IEEE Wireless Comm., vol. 9, no. 2, pp. 26-32, Apr. 2002.
[26] Y. Yang and T.-S.P. Yum, “Nonrearrangeable Compact Assignment of Orthogonal Variable-Spreading-Factor Codes for Multi-Rate Traffic,” Proc. IEEE Vehicular Technology Conf. (VTC), pp. 938-942, 2001.
[27] L. Zhang, “Virtual Clock: A New Traffic Control Algorithm for Packet Switching Networks,” Proc. ACM SIGCOMM, pp. 19-29, 1990.

Index Terms:
Index Terms- Mobile computing, OVSF, personal communication services, WCDMA, wireless communication, 3G.
Citation:
Chih-Min Chao, Yu-Chee Tseng, Li-Chun Wang, "Dynamic Bandwidth Allocation for Multimedia Traffic with Rate Guarantee and Fair Access in WCDMA Systems," IEEE Transactions on Mobile Computing, vol. 4, no. 5, pp. 420-429, Sept.-Oct. 2005, doi:10.1109/TMC.2005.65
Usage of this product signifies your acceptance of the Terms of Use.