Abstract
In the frequency allocation problem, we are given a cellular telephone network whose geographical coverage area is divided into cells, where phone calls are serviced by assigned frequencies, so that none of the pairs of calls emanating from the same or neighboring cells is 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, where each vertex knows its position in the graph. We present a 1-local 33/24-competitive distributed algorithm for multicoloring a hexagonal graph, thereby improving the previous 1-local 7/5-competitive algorithm.
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
Chin, F.Y.L., Zhang, Y., Zhu, H.: A 1-local 13/9-competitive Algorithm for Multicoloring Hexagonal Graphs. Algorithmica 54, 557–567 (2009)
Hale, W.K.: 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 Mathematics 233, 219–231 (2001)
Havet, F., Žerovnik, J.: Finding a five bicolouring of a triangle-free subgraph of the triangular lattice. Discrete Mathematics 244, 103–108 (2002)
Janssen, D., Narayanan, L., Shende, S.: Distributed Online Frequency Assignment in Cellular Network. Journal of Algorithms 36(2), 119–151 (2000)
McDiarmid, C., Reed, B.: Channel assignment and weighted coloring. Networks 36(2), 114–117 (2000)
Narayanan, L.: Channel assignment and graph multicoloring. In: Handbook of Wireless Networks and Mobile Computing, pp. 71–94. Wiley, New York (2002)
Narayanan, L., Shende, S.M.: Static frequency assignment in cellular networks. Algorithmica 29(3), 396–409 (2001)
Šparl, P., Žerovnik, J.: 2-local 4/3-competitive Algorithm for Multicoloring Hexagonal Graphs. Journal of Algorithms 55(1), 29–41 (2005)
Šparl, P., Žerovnik, J.: 2-local 5/4-competitive algorithm for multicoloring triangle-free hexagonal graphs. Information Processing Letters 90(5), 239–246 (2004)
Sudeep, K.S., Vishwanathan, S.: A technique for multicoloring triangle-free hexagonal graphs. Discrete Mathematics 300, 256–259 (2005)
Witkowski, R.: A 1-local 17/12-competitive algorithm for multicoloring hexagonal graphs. In: Kutyłowski, M., Charatonik, W., Gębala, M. (eds.) FCT 2009. LNCS, vol. 5699, pp. 346–356. Springer, Heidelberg (2009)
Witkowski, R., Žerovnik, J.: 1-local 7/5-competitive Algorithm for Multicoloring Hexagonal Graphs. Electronic Notes in Discrete Mathematics, vol. 36, pp. 375–382 (2010)
Žerovnik, J.: A distributed 6/5-competitive algorithm for multicoloring triangle-free hexagonal graphs. International Journal of Pure and Applied Mathematics 23(2), 141–156 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Witkowski, R., Žerovnik, J. (2011). 1-Local 33/24-Competitive Algorithm for Multicoloring Hexagonal Graphs. In: Frieze, A., Horn, P., Prałat, P. (eds) Algorithms and Models for the Web Graph. WAW 2011. Lecture Notes in Computer Science, vol 6732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21286-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-21286-4_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21285-7
Online ISBN: 978-3-642-21286-4
eBook Packages: Computer ScienceComputer Science (R0)