Abstract
This paper presents optimal schemes for channel assignment problem in wireless networks modeled as 2-dimensional square grids. Given the reuse distance σ (an integer ≥ 5 ), using minimum number of colors, our algorithm assigns colors(channels) to the vertices (radio stations) in such a way that the color difference between the adjacent vertices is at least 2, and two vertices x and y receive the same color only when the distance between x and y is at least σ.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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, C.M., Tan, R.B.: Efficient Use of Radio Spectrum in Wireless Networks with Channel Separation between Close Stations. In: Proceedings of the DIAL M Workshop, pp. 18–27 (2000)
Dubhashi, A., Shashanka, M.V.S., Pati, A., Shashank, R., Shende, A.M.: Channel Assignment for Wireless Networks Modelled as d-Dimensional Square Grids. In: Das, S.K., Bhattacharya, S. (eds.) IWDC 2002. LNCS, vol. 2571, pp. 130–141. Springer, Heidelberg (2002)
Rajan, D.S., Shende, A.M.: A Characterization of Root Lattices. Discrete Mathematics 161, 309–314 (1996)
Bodlaender, H.L., Kloks, T., Tan, R.B., van Leeuwen, J.: λ-Coloring of Graphs. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 395–406. Springer, Heidelberg (2000)
Katzela, I., Naghshineh, M.: Channel Assignment Schemes for Cellular Mobile Telecommunication Systems: A Comprehensive Survey. IEEE Personal Communications, 10–31 (June 1996)
Conway, J., Sloane, N.: Sphere Packing, Lattices and Groups, 2nd edn. Springer, Heidelberg (1993)
Goloumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, London (1980)
Calamoneri, T., Petreschi, R.: On the Radiocoloring Problem. In: Das, S.K., Bhattacharya, S. (eds.) IWDC 2002. LNCS, vol. 2571, pp. 118–127. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Panda, B.S., Kumar, M., Das, S.K. (2004). Optimal Schemes for Channel Assignment Problem in Wireless Networks Modeled as 2-Dimensional Square Grids. In: Sen, A., Das, N., Das, S.K., Sinha, B.P. (eds) Distributed Computing - IWDC 2004. IWDC 2004. Lecture Notes in Computer Science, vol 3326. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30536-1_47
Download citation
DOI: https://doi.org/10.1007/978-3-540-30536-1_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24076-1
Online ISBN: 978-3-540-30536-1
eBook Packages: Computer ScienceComputer Science (R0)