Abstract
Wireless Communication Networks based on Frequency Division Multiplexing (FDM in short) plays an important role in the field of communications, in which each request can be satisfied by assigning a frequency. To avoid interference, each assigned frequency must be different to the neighboring assigned frequencies. Since frequency is a scarce resource, the main problem in wireless networks is how to utilize the frequency as fully as possible. In this paper, we consider the call control problem. Given a fixed bandwidth of frequencies and a sequence of communication requests, in handling each request, we must immediately choose an available frequency to accept (or reject) it. The objective of call control problem is to maximize the number of accepted requests. We study the asymptotic performance, i.e., the number of requests in the sequence and the number of available frequencies are very large positive integers. In this paper, we give a 7/3-competitive algorithm for call control problem in cellular network, improving the previous 2.5-competitive result. Moreover, we investigate the triangle-free cellular network, propose a 9/4-competitive algorithm and prove that the lower bound of competitive ratio is at least 5/3.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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 is in SPAA 2000 (2000)
Caragiannis, I., Kaklamanis, C., Papaioannou, E.: Competitive Algorithms and Lower Bounds for On-Line Randomized Call Control in Cellular Networks. Networks 52(4), 235–251 (2008); Preliminary versions are in WAOA 2003 and EUROPAR 2005
Chan, W.-T., Chin, F.Y.L., Ye, D., Zhang, Y.: Online Frequency Allocation in Cellular Networks. In: Proc. of the 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2007), pp. 241–249 (2007)
Havet, F.: Channel assignment and multicoloring of the induced subgraphs of the triangular lattice. Discrete Math. 233, 219–231 (2001)
MacDonald, V.H.: Advanced mobile phone service: The cellular concept. Bell Systems Technical Journal 58(1), 15–41 (1979)
McDiarmid, C., Reed, B.: Channel assignment and weighted coloring. Networks 36(2), 114–117 (2000)
Narayanan, L., Shende, S.: Static frequency assignment in cellular networks. Algorithmica 29(3), 396–409 (2001)
Pantziou, G.E., Pentaris, G.P., Spirakis, P.G.: Competitive Call Control in Mobile Networks. Theory of Computing Systems 35(6), 625–639 (2002)
Šparl, P., Žerovnik, J.: 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs. Inf. Process. Lett. 90, 239–246 (2004)
Ye, D., Han, X., Zhang, G.: Deterministic On-line Call Control in Cellular Networks (manuscript)
Zhang, Y., Chin, F.Y.L., Zhu, H.: A 1-Local Asymptotic 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs. Algorithmica 54, 557–567 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chan, J.WT., Chin, F.Y.L., Han, X., Lam, KC., Ting, HF., Zhang, Y. (2010). Deterministic Online Call Control in Cellular Networks and Triangle-Free Cellular Networks. In: Lee, DT., Chen, D.Z., Ying, S. (eds) Frontiers in Algorithmics. FAW 2010. Lecture Notes in Computer Science, vol 6213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14553-7_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-14553-7_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14552-0
Online ISBN: 978-3-642-14553-7
eBook Packages: Computer ScienceComputer Science (R0)