MDP-based OVSF code assignment scheme and call admission control for wideband-CDMA communications

  • Authors:

  • Min-Xiou Chen;B.-J. Chang;Ren-Hung Hwang;Jun-Fan Juang

  • Affiliations:

  • Dept. of Comput. Sci. & Inf. Eng., Nat. Chungcheng Univ., Chiayi, Taiwan;Nat. Commun. Res. Lab., Southeast Univ., Nanjing, China;Nat. Commun. Res. Lab., Southeast Univ., Nanjing, China;-

  • Venue:
  • ISCC '04 Proceedings of the Ninth International Symposium on Computers and Communications 2004 Volume 2 (ISCC"04) - Volume 02
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Since the orthogonal characteristic of the orthogonal variable spreading factor (OVSF) code tree in wideband CDMA (WCDMA) systems, code blocking increases as traffle load or required rate increases. This causes inefficient utilization of channelization codes. Hence, how to efficiently manage the resource of channelization codes of OVSF code tree in WCDMA is an important issue and has been studied extensively. Therefore, in this paper we focus on how to assign channelization code efficiently. Additionally, most researches did not consider the analysis of tree state with dynamic traffic load and lack of systematic call admission control (CAC) mechanism. Therefore, in this paper, we first propose the Markov decision process (MDP) based analysis to assign channelization codes efficiently. Next, we extend the MDP-based approach as the call admission control mechanism to maximize system revenue while reducing blocking. Numerical results indicate that the proposed MDP approach yields the best fractional reward loss and code blocking reward loss as compare to that of others, including the random, left most, and crowded first schemes, and the MDP-based CAC outperforms the capacity-based CAC significantly.