Abstract
Efficient and effective resource utilization is important in the bandwidth allocation of the communication network, especially when the resources are scarce such as the radio channels in the wireless links. Channel assignment in Wideband CDMA transmission schemes, i.e., the bandwidth allocation in the 3G wireless links, can be transformed into the Orthogonal Variable Spreading Factor code assignment to the connection requests. The code assignment problem presents a typical on-line feature that the decision to accept/reject the request has to be made at the arrival time of the request without the knowledge of future requests. An algorithm for an on-line problem is considered competitive if its performance is within some constant fraction of the performance of any other algorithm for the same input sequences. The study in deriving a competitive algorithm is valuable as it guarantees a lower bound of the system performance in all circumstances. This paper presents an on-line competitive algorithm called Left_Right_Aggressive (LRA) for the OVSF code assignment problem in the wireless links regarding system throughput as the performance indicator. With preemption allowed, the proposed algorithm achieves the constant competitive ratio of 2/(1-2β ), where β is the fraction of the maximum requested bandwidth to the system capacity. The simulation results demonstrate that it is promising to achieve better throughput performance and lower preemption ratio in request patterns of Poisson distribution.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Special Issue, IMT-2000: Standards Efforts of the ITU, IEEE Pers. Commun., vol 4 (August 1997)
Prasad, R., Ojanpera, T.: An Overview of CDMA Evolution Towards Wideband CDMA. IEEE Communications Surveys 1(1), 4-th Quarter, 2–29 (1998)
TR25.922, Radio Resource Management Strategies. 3GPP, V3.1.0, pp. 25–27 (March 2000)
Viterbi, A.J.: CDMA: Principle of Spread Spectrum Communications. Addison-Wesley, Reading (1995)
Baier, A., Fiebig, U.-C., Granzow, W., Koch, W., Teder, P., Thielecke, J.: Design Study for a CDMA-based Third Generation Mobile Radio System. IEEE J. Sel. Areas Commun. SAC–12, 733–743 (1994)
Sleator, D.D., Tarjan, R.E.: Amortized Efficiency of List Update and Paging Rules. Communications of ACM 28, 202–208 (1985)
Manasse, M., McGeoch, L., Sleator, D.D.: Competitive Algorithms for On-line Problems. In: Proc. ACM Symposium on Theory of Computing, May 1988, pp. 322–33 (1988)
Garay, J.A., Gopal, I.S.: Call Preemption in Communication Networks. In: Proc. INFOCOM 1992, vol. 3, pp. 1043–1050 (1992)
Garay, J.A., Gopal, I.S., Kutten, S., Mansour, Y., Yung, M.: Efficient On-line Call Control Algorithms. In: Proc. 2nd Israel Symp. on the Theory and Computing Systems, pp. 285–293 (1993)
Bar-Noy, A., Canetti, R., Kutten, S., Mansour, Y., Schieber, B.: Bandwidth Allocation with Preemption. In: Proc. ACM Symp. on Theory of Computing, May 1995, pp. 616–625 (1995)
Minn, T., Siu, K.-Y.: Dynamic Assignment of Orthogonal Variable Spreading Factor Codes in W-CDMA. IEEE J. Sel. Areas Commun. 18(8), 1429–1440 (2000)
C.-L.: Multi-code CDMA Wireless Personal Communications Networks. In: Proceedings of ICC 1995, vol. 2, pp. 1060–1064 (1995)
Adachi, F., Sawahashi, M., Okawa, K.: Tree-structured Generation of Orthogonal Spreading Codes with Different Length for Forward Link of DS-CDMA Mobile Radio. Electronics Letters 33(1), 27–28 (1997)
Kim., S.H., Shin, S.H., Kwak, K.S.: A Hybrid Multi-rate Scheme for WCDMA. In: Proceedings of TENCON 1999, vol. 2, pp. 1224–1227 ( December 1999)
Shueh, F., Chen, W.-S.E.: Minimizing Reallocation on OVSF Channel Assignment (in preparation)
Chen, W.-T., Wu, Y.-P., Hsiao, H.-C.: A Novel Code Assignment Scheme for W-CDMA Systems. In: Proceedings of VTC’2001 Fall, vol. 2, pp. 1182–1186 (2001)
Cheng, R.-G., Lin, P.: OVSF Code Channel Assignment for IMT-2000. In: Proceedings of VTC 2000, vol. 3, pp. 2188–2192 (Spring 2000)
Shueh, F., Liu, Z.-E.P., Chen, W.-S.E.: A Fair, Efficient, and Exchangeable Channelization Code As signment Scheme for IMT-2000. In: IEEE ICPWC 2000, pp. 429–433 (December 2000)
Shueh, F., Chen, W.-S.E.: Code Assignment for IMT-2000 on Forward Radio Link. In: Proceedings of VTC 2001, vol. 2, pp. 906–910 (Spring 2001)
Kam, A.C., Minn, T., Siu, K.-Y.: Supporting Rate Guarantee and Fair Access for Bursty Data Traffic in W-CDMA. IEEE J. Sel. Areas Commun. 19(11), 2121–2130 (2001)
Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-Competitive On-line Routing. In: IEEE Proc. Foundations of Computer Science, pp. 32–40 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cherng, JH., Shueh, FF., Chen, WS.E. (2003). Throughput Competitiveness of WCDMA Channel Assignment. In: Conti, M., Giordano, S., Gregori, E., Olariu, S. (eds) Personal Wireless Communications. PWC 2003. Lecture Notes in Computer Science, vol 2775. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39867-7_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-39867-7_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20123-6
Online ISBN: 978-3-540-39867-7
eBook Packages: Springer Book Archive