Skip to main content
SpringerLink
Log in

Channel Assignment for Wireless Networks Modelled as d-Dimensional Square Grids

  • Conference paper
  • First Online:
Distributed Computing (IWDC 2002)

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

Included in the following conference series:

Abstract

In this paper, we study the problem of channel assignment for wireless networks modelled as d-dimensional grids. In particular, for d-dimensional square grids, we present optimal assignments that achieve a channel separation of 2 for adjacent stations where the reuse distance is 3 or 4. We also introduce the notion of a colouring schema for d- dimensional square grids, and present an algorithm that assigns colours to the vertices of the grid satisfying the schema constraints.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Battiti, A. A. Bertossi, and M. A. Bonuccelli. Assigning codes in wireless networks: bounds and scaling properties. Wireless Networks, 5:195–209, 1999.

    Article  Google Scholar 

  2. Alan A. Bertossi, Cristina M. Pinotti, and Richard B. Tan. Efficient use of radio spectrum in wireless networks with channel separation between close stations. In Proceedings of the DIAL M Workshop, pages 18–27, 2000.

    Google Scholar 

  3. Alan A. Bertossi, Cristina M. Pinotti, and Richard B. Tan. Channel assignment with separation for special classes of wireless networks: grids and rings. In Proceedings of IPDPS, 2002.

    Google Scholar 

  4. Hans L. Boedlander, Ton Kloks, Richard B. Tan, and Jan van Leeuwen. λ-coloring of graphs. In Proceedings of STACS, pages 395–406, 2000.

    Google Scholar 

  5. J. Conway and N. Sloane. Sphere Packings, Lattices and Groups. Springer Verlag, second edition, 1993.

    Google Scholar 

  6. J. R. Griggs and R. K. Yeh. Labeling graphs with a condition at distance 2. SIAM J. Disc. Math., pages 586–595, 1992.

    Google Scholar 

  7. W.K. Hale. Frequency assignment: Theory and application. Proceedings of the IEEE, 68:1497–1514, 1980.

    Google Scholar 

  8. Robert A. Murphey, Panos M. Pardalos, and Mauricio G.C. Resende. Frequency assignment problems. In Handbook of Combinatorial Optimization. Kluwer Academic Press, 1999.

    Google Scholar 

  9. Dayanand S. Rajan and Anil M. Shende. A characterization of root lattices. Discrete Mathematics, 161:309–314, 1996.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Birla Institute of Technology & Science, 333031, Pilani, India

    Aniket Dubhashi, M V S Shashanka, Amrita Pati & R. Shashank

  2. Roanoke College, 24153, Salem, VA, USA

    Anil M. Shende

Authors
  1. Aniket Dubhashi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M V S Shashanka
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Amrita Pati
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. R. Shashank
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Anil M. Shende
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, University of Texas at Arlington Center for Research in Wireless Mobility and Networking (CReWMaN), P.O. Box 19015, 76019-0015, Arlington, TX, USA

    Sajal K. Das

  2. Department of Computer Science and Engineering, Jadavpur University, 700 032, Calcutta

    Swapan Bhattacharya

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dubhashi, A., Shashanka, M.V.S., Pati, A., Shashank, R., Shende, A.M. (2002). Channel Assignment for Wireless Networks Modelled as d-Dimensional Square Grids. In: Das, S.K., Bhattacharya, S. (eds) Distributed Computing. IWDC 2002. Lecture Notes in Computer Science, vol 2571. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36385-8_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-36385-8_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00355-7

  • Online ISBN: 978-3-540-36385-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation