Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Distributed Computing

IWDC 2004: Distributed Computing - IWDC 2004 pp 424–434Cite as

Optimal Schemes for Channel Assignment Problem in Wireless Networks Modeled as 2-Dimensional Square Grids

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3326))

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 σ.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    Google Scholar 

  2. 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)

    Chapter  Google Scholar 

  3. Rajan, D.S., Shende, A.M.: A Characterization of Root Lattices. Discrete Mathematics 161, 309–314 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  4. 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)

    Chapter  Google Scholar 

  5. Katzela, I., Naghshineh, M.: Channel Assignment Schemes for Cellular Mobile Telecommunication Systems: A Comprehensive Survey. IEEE Personal Communications, 10–31 (June 1996)

    Google Scholar 

  6. Conway, J., Sloane, N.: Sphere Packing, Lattices and Groups, 2nd edn. Springer, Heidelberg (1993)

    Google Scholar 

  7. Goloumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, London (1980)

    Google Scholar 

  8. 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)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Indian Institute of Technology, Delhi, Hauz Khas, New Delhi, 110 016, India

    B. S. Panda & Mahesh Kumar

  2. Department of Computer Science and Engineering, The University of Texas at Arlington, Arlington, TX, 76019, USA

    Sajal K. Das

Authors
  1. B. S. Panda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mahesh Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sajal K. Das
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computing and Informatics, Arizona State University, 85287, Tempe, AZ,  

    Arunabha Sen

  2. Indian Statistical Institute, Kolkata,  

    Nabanita Das

  3. Department of Computer Science and Engineering, University of Texas at Arlington, P.O. Box 19015, 76019, Arlington, TX, USA

    Sajal K. Das

  4. ACM Unit, Indian Statistical Institute, 700 108, Kolkata, India

    Bhabani P. Sinha

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation