AAIM 2007: Algorithmic Aspects in Information and Management pp 191-200 | Cite as
Online OVSF Code Assignment with Resource Augmentation
Abstract
Orthogonal Variable Spreading Factor (OVSF) code assignment is a fundamental problem in Wideband Code-Division Multiple-Access (W-CDMA) systems, which play an important role in third generation mobile communications. In the OVSF problem, codes must be assigned to incoming code requests, with different data rate requirements, in such a way that they are mutually orthogonal with respect to an OVSF code tree. An OVSF code tree is a complete binary tree in which each node represents a code associated with the combined bandwidths of its two children. To be mutually orthogonal, each leaf-to-root path must contain at most one assigned code. In this paper, we focus on the online version of the OVSF code assignment problem, in the often-studied context of the single cell as well as in the more general context of the whole multi-cell cellular network (for which there are no known results). With the help of 1/8 and 11/8 extra bandwidth resources, we are able to give a 5-competitive algorithm in the single cell and the multi-cell context respectively, which means that the competitive ratio is a constant and not a function of the height of the OVSF tree and thereby improving upon past results.
Keywords
Cellular Network Competitive Ratio Main Tree Total Bandwidth Code TreePreview
Unable to display preview. Download preview PDF.
References
- 1.Chan, J.W.-T., Chin, F.Y.L., Ye, D., Zhang, Y., Zhu, H.: Frequency Allocation Problems for Linear Cellular Networks. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 61–70. Springer, Heidelberg (2006)CrossRefGoogle Scholar
- 2.Chan, W.T., Chin, F.Y.L., Ye, D., Zhang, Y., Zhu, H.: Greedy Online Frequency Allocation in Cellular Networks. Information Processing Letters 102, 55–61 (2007)CrossRefMathSciNetGoogle Scholar
- 3.Chan, W.T., Chin, F.Y.L., Ye, D., Zhang, Y.: Online Frequency Allocation in Cellular Networks. To appear in Proc. of the 19th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA ’07 (2007)Google Scholar
- 4.Caragiannis, I., Kaklamanis, C., Papaioannou, E.: Efficient on-line frequency allocation and call control in cellular networks. Theory Comput. Syst. 35(5), 521–543 (2000), A preliminary version of the paper appeared in SPAA 2000CrossRefMathSciNetGoogle Scholar
- 5.Erlebach, T., Jacob, R., Mihaľák, M., Nunkesser, M., Szabó, G., Widmayer, P.: An algorithmic view on OVSF code assignment. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 270–281. Springer, Heidelberg (2004)Google Scholar
- 6.Li, X.-Y., Wan, P.-J.: Theoretically Good Distributed CDMA/OVSF Code Assignment for Wireless Ad Hoc Networks. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 126–135. Springer, Heidelberg (2005)CrossRefGoogle Scholar
- 7.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)Google Scholar
- 8.McDiarmid, C., Reed, B.A.: Channel assignment and weighted coloring. Networks 36(2), 114–117 (2000)MATHCrossRefMathSciNetGoogle Scholar
- 9.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)CrossRefGoogle Scholar
- 10.Rouskas, A.N., Skoutas, D.N.: OVSF codes assignemnt and reassignment at the forward link OFW-CDMA 3G systems. In: Proc. of the 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (2002)Google Scholar
- 11.Tomamichel, M.: Algorithmische Aspekte von OVSF Code Assignment mit Schwerpunkt auf Offline Code Assignment. MenuscriptGoogle Scholar
- 12.Wan, P.-J., Li, X.-Y., Frieder, O.: OVSF-CDMA Code Assignment in Wireless Ad Hoc Networks. In: Proc. of DIAL M-POMC 2004 joint workshop on Foundations of mobile computing, pp. 92–101 (2004)Google Scholar