Abstract
The honeycomb grid is a network topology based on the hexagonal plane tessellation, which is convenient to model the regular placement on the plane of the base stations of wireless networks. For an efficient use of the radio spectrum in such networks, channels have to be assigned to the base stations so as to avoid interferences. Such a problem can be modeled as a suitable coloring problem. Precisely, given an integer t and a honeycomb grid G=(V,E), an L(1t)-coloring of G is a function f from the vertex set V to a set of nonnegative integers such that |f(u) − f(v)| ≥ 1, if the distance between the vertices u and v is at most t. This paper presents efficient algorithms for finding optimal L(1t)-colorings of honeycomb grids.
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
Bertossi, A.A., Pinotti, M.C.: Mappings for Conflict-Free Access of Paths in Bidimensional Arrays, Circular Lists, and Complete Trees. Journal of Parallel and Distributed Computing 62, 1314–1333 (2002)
Bertossi, A.A., Pinotti, M.C., Rizzi, R.: Channel Assignment on Strongly- Simplicial Graphs. In: 3rd Int’l Workshop on Wireless, Mobile and Ad Hoc Networks, Nice (April 2003)
Bertossi, A.A., Pinotti, M.C., Tan, R.B.: Channel Assignment with Separation for Interference Avoidance in Wireless Networks. IEEE Transactions on Parallel and Distributed Systems (February 2003) (to appear)
Bodlaender, H.L., Kloks, T., Tan, R.B., van Leeuwen, J.: Approximation λ- Coloring on Graphs. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, p. 395. Springer, Heidelberg (2000)
Chang, G.J., Kuo, D.: The L(2, 1)-Labeling Problem on Graphs. SIAM Journal on Discrete Mathematics 9, 309–316 (1996)
Chlamtac, I., Pinter, S.S.: Distributed Nodes Organizations Algorithm for Channel Access in a Multihop Dynamic Radio Network. IEEE Transactions on Computers 36, 728–737 (1987)
Griggs, J.R., Yeh, R.K.: Labelling Graphs with a Condition at Distance 2. SIAM Journal on Discrete Mathematics 5, 586–595 (1992)
Hale, W.K.: Frequency Assignment: Theory and Application. Proceedings of the IEEE 68, 1497–1514 (1980)
Katzela, I., Naghshineh, M.: Channel Assignment Schemes for Cellular Mobile Telecommunication Systems: A Comprehensive Survey. IEEE Personal Communications, 10–31 (June 1996)
McCormick, S.T.: Optimal Approximation of Sparse Hessians and its Equivalence to a Graph Coloring Problem. Mathematical Programming 26, 153–171 (1983)
Sakai, D.: Labeling Chordal Graphs: Distance Two Condition. SIAM Journal on Discrete Mathematics 7, 133–140 (1994)
Sen, A., Roxborough, T., Medidi, S.: Upper and Lower Bounds of a Class of Channel Assignment Problems in Cellular Networks, Technical Report, Arizona State University (1997)
Shende, A.M., et al.: A Characterisation of Optimal Channel Assignments for Wireless Networks Modelled as Cellular and Square Grids. In: 3rd Int’l IEEE Workshop on Wireless, Mobile and Ad Hoc Networks, Nice (April 2003)
Stojmenovic, I.: Honeycomb Networks: Topological Properties and Communication Algorithms. IEEE Transactions on Parallel and Distributed Systems 8, 1036–1042 (1997)
Van den Heuvel, J., Leese, R.A., Shepherd, M.A.: Graph Labelling and Radio Channel Assignment. Journal of Graph Theory 29, 263–283 (1998)
Zander, J.: Trends and Challenges in Resource Management Future Wireless Networks. In: IEEE Wireless Communications & Networks Conference (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bertossi, A.A., Pinotti, C.M., Rizzi, R., Shende, A.M. (2003). Channel Assignment in Honeycomb Networks. In: Blundo, C., Laneve, C. (eds) Theoretical Computer Science. ICTCS 2003. Lecture Notes in Computer Science, vol 2841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45208-9_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-45208-9_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20216-5
Online ISBN: 978-3-540-45208-9
eBook Packages: Springer Book Archive