Advertisement

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

  • Aniket Dubhashi
  • Shashanka M V S 
  • Amrita Pati
  • Shashank R. 
  • Anil M. Shende
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2571)

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.

Keywords

Wireless Network Channel Assignment Adjacent Vertex Hamiltonian Path Colouring Scheme 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.CrossRefGoogle Scholar
  2. 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. 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. 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. 5.
    J. Conway and N. Sloane. Sphere Packings, Lattices and Groups. Springer Verlag, second edition, 1993.Google Scholar
  6. 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. 7.
    W.K. Hale. Frequency assignment: Theory and application. Proceedings of the IEEE, 68:1497–1514, 1980.Google Scholar
  8. 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. 9.
    Dayanand S. Rajan and Anil M. Shende. A characterization of root lattices. Discrete Mathematics, 161:309–314, 1996.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Aniket Dubhashi
    • 1
  • Shashanka M V S 
    • 1
  • Amrita Pati
    • 1
  • Shashank R. 
    • 1
  • Anil M. Shende
    • 2
  1. 1.Birla Institute of Technology & SciencePilaniIndia
  2. 2.Roanoke CollegeSalemUSA

Personalised recommendations