Abstract
The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on the same root-to-leaf path. Each connection requires a code on a specified level. The code can change over time as long as it is still on the same level. We consider the one-step code assignment problem: Given an assignment, move the minimum number of codes to serve a new request. Minn and Siu proposed the so-called DCA-algorithm to solve the problem optimally. We show that DCA does not always return an optimal solution, and that the problem is NP-hard. We give an exact n O( h)-time algorithm, and a polynomial time greedy algorithm that achieves approximation ratio Θ(h). Finally, we consider the online code assignment problem for which we derive several results.
Research partially supported by TH-Project TH-46/02-1 (Mobile phone antenna optimization: theory, algorithms, engineering, and experiments).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adashi, 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)
Assarut, R., Husada, M.G., Yamamoto, U., Onozato, Y.: Data rate improvement with dynamic reassignment of spreading codes for DS-CDMA. Computer Communications 25(17), 1575–1583 (2002)
Assarut, R., Kawanishi, K., Deshpande, R., Yamamoto, U., Onozato, Y.: Performance evaluation of orthogonal variable-spreading-factor code assignment schemes in W-CDMA. In: Proceedings of the IEEE International Conference on Communications, ICC (2002)
Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Çam, H.: Nonblocking OVSF codes and enhancing network capacity for 3G wireless and beyond systems. Computer Communications 26(17), 1907–1917 (2003)
Chen, W.T., Fang, S.H.: An efficient channelization code assignment approach for W-CDMA. In: IEEE Conference on Wireless LANs and Home Networks (2002)
Chen, W.T., Wu, Y.P., Hsiao, H.C.: A novel code assignment scheme for WCDMA systems. In: Proceedings of the 54th IEEE Vehicular Technology Conference (VTC), vol. 2, pp. 1182–1186 (2001)
Dell’Amico, M., Maffioli, F., Merani, M.: A tree partitioning dynamic policy for OVSF codes assignment in WCDMA. IEEE Transaction on Wireless Communications (to appear)
Erlebach, T., Jacob, R., Mihal’ák, M., Nunkesser, M., Szabó, G., Widmayer, P.: An algorithmic view on OVSF code assignment. TIK-Report 173, Computer Engineering and Networks Laboratory (TIK), ETH Zürich (August 2003), Available electronically at ftp://ftp.tik.ee.ethz.ch/pub/publications/TIK-Report173.pdf
Fantacci, R., Nannicini, S.: Multiple access protocol for integration of variable bit rate multimedia traffic in UMTS/IMT-2000 based on wideband CDMA. IEEE Journal on Selected Areas in Communications 18(8), 1441–1454 (2000)
Fossa Jr., C.E.: Dynamic Code Sharing Algorithms for IP Quality of Service in Wideband CDMA 3G Wireless Networks. PhD thesis, Virginia Polytechnic Institute and State University (April 2002)
Fossa Jr., C.E., Davis IV., N.J.: Dynamic code assignment improves channel utilization for bursty traffic in 3G wireless networks. In: Proceedings of the IEEE International Conference on Communications (ICC), pp. 3061–3065 (2002)
Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, New York (1979)
Holma, H., Toskala, A.: WCDMA for UMTS. Wiley, Chichester (2001)
Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. In: Proceedings of the 36th IEEE Symposium on Foundations of Computer Science, pp. 214–221 (1995)
Kam, A.C., Minn, T., Siu, K.-Y.: Supporting rate guarantee and fair access for bursty data traffic in W-CDMA. IEEE Journal on Selected Areas in Communications 19(11), 2121–2130 (2001)
Laiho, J., Wacker, A., Novosad, T.: Radio Network Planning and Optimisation for UMTS. Wiley, Chichester (2002)
Minn, T., Siu, K.Y.: Dynamic assignment of orthogonal variable-spreadingfactor codes in W-CDMA. IEEE Journal on Selected Areas in Communications 18(8), 1429–1440 (2000)
Rouskas, N., Skoutas, D.N.: OVSF codes assignment and reassignment at the forward link of W-CDMA 3G systems. In: Proceedings of the 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Erlebach, T., Jacob, R., Mihaľák, M., Nunkesser, M., Szabó, G., Widmayer, P. (2004). An Algorithmic View on OVSF Code Assignment. In: Diekert, V., Habib, M. (eds) STACS 2004. STACS 2004. Lecture Notes in Computer Science, vol 2996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24749-4_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-24749-4_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21236-2
Online ISBN: 978-3-540-24749-4
eBook Packages: Springer Book Archive