Abstract
In the frequency allocation problem, we are given a mobile telephone network, whose geographical coverage area is divided into cells, wherein phone calls are serviced by assigning frequencies to them so that no two calls emanating from the same or neighboring cells are assigned the same frequency. The problem is to use the frequencies efficiently, i.e., minimize the span of frequencies used. The frequency allocation problem can be regarded as a multicoloring problem on a weighted hexagonal graph. In this paper, we give a 1-local 4/3-competitive distributed algorithm for multicoloring a triangle-free hexagonal graph, which is a special case. Based on this result, we then propose a 1-local 13/9-competitive algorithm for multicoloring the (general-case) hexagonal graph, thereby improving the previous 1-local 3/2-competitive algorithm.
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.
References
Aardal, K.I., van Hoesel, S.P.M., Koster, A.M.C.A., Mannino, C., Sassano, A.: Models and solution techniques for frequency assignment problems. Quarterly Journal of the Belgian, French and Italian Operations Research Societies (4OR) 1(4), 261–317 (2003)
Chan, W.-T., Chin, F.Y.L., Ye, D., Zhang, Y., Zhu, H.: Frequency Allocation Problem for Linear Cellular Networks. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 61–70. Springer, Heidelberg (2006)
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)
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 2007)
Caragiannis, I., Kaklamanis, C., Papaioannou, E.: Efficient on-line frequency allocation and call control in cellular networks. Theory Comput. Syst. 35(5), 521–543 (2002) (A preliminary version of the paper appeared in SPAA 2000)
Hale, W.: Frequency assignment: Theory and applications. Proceedings of the IEEE 68(12), 1497–1514 (1980)
Havet, F.: Channel assignment and multicoloring of the induced subgraphs of the triangular lattice. Discrete Math. 233, 219C231 (2001)
Janssen, J., Krizanc, D., Narayanan, L., Shende, S.M.: Distributed online frequency assignment in cellular networks. J. Algorithms 36(2), 119–151 (2000)
Jaumard, B., Marcotte, O., Meyer, C.: Mathematical models and exact methods for channel assignment in cellular networks. In: Sansò, B., Soriano, P. (eds.) Telecommunications Network Planning, pp. 239–255. Kluwer Academic Publishers, Dordrecht (1999)
Katzela, I., Naghshineh, M.: Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey. IEEE Personal Communications 3(3), 10–31 (1996)
MacDonald, V.: Advanced mobile phone service: The cellular concept. Bell Systems Technical Journal 58(1) (1979)
McDiarmid, C., Reed, B.A.: Channel assignment and weighted coloring. Networks 36(2), 114–117 (2000)
Narayanan, L.: Channel assignment and graph multicoloring. In: Stojmenović, I. (ed.) Handbook of Wireless Networks and Mobile Computing, pp. 71–94. John Wiley & Sons, Chichester (2002)
Narayanan, L., Shende, S.M.: Static frequency assignment in cellular networks. Algorithmica 29(3), 396–409 (2001)
Narayanan, L., Tang, Y.: Worst-case analysis of a dynamic channel assignment strategy. Discrete Applied Mathematics 140(1-3), 115–141 (2004)
Sparl, P., Zerovnik, J.: 2-local 5/4-competitive algorithm for multicoloring trianglr-free hexagonal graphs. Information Processing Letters 90, 239–246 (2004)
Sparl, P., Zerovnik, J.: 2-local 4/3-competitive algorithm for multicoloring hexagonal graphs. J. Algorithms 55(1), 29–41 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chin, F.Y.L., Zhang, Y., Zhu, H. (2007). A 1-Local 13/9-Competitive Algorithm for Multicoloring Hexagonal Graphs. In: Lin, G. (eds) Computing and Combinatorics. COCOON 2007. Lecture Notes in Computer Science, vol 4598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73545-8_51
Download citation
DOI: https://doi.org/10.1007/978-3-540-73545-8_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73544-1
Online ISBN: 978-3-540-73545-8
eBook Packages: Computer ScienceComputer Science (R0)