Skip to main content
SpringerLink
Log in

A Characterisation of Optimal Channel Assignments for Cellular and Square Grid Wireless Networks

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

In this paper we first present a uniformity property that characterises optimal channel assignments for networks arranged as cellular or square grids. Then, we present optimal channel assignments for cellular and square grids; these assignments exhibit a high value for δ1 – the separation between channels assigned to adjacent stations. We prove an upper bound on δ1 for such optimal channel assignments. This upper bound is greater than the value of δ1 exhibited by our assignments. Based on empirical evidence, we conjecture that the value our assignments exhibit is a tight upper bound on δ1.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Google Scholar 

  2. A.A. Bertossi, C.M. Pinotti and R.B. Tan, Efficient use of radio spectrum in wireless networks with channel separation between close stations, in: Proc. of the DIAL M Workshop (2000) pp. 18–27.

  3. A.A. Bertossi, C.M. Pinotti and R.B. Tan, Channel assignment with separation for special classes of wireless networks: Grids and rings, in: Proc. of IPDPS (2002).

  4. H.L. Boedlander, T. Kloks, R.B. Tan and J. van Leeuwen, λ-coloring of graphs, in: Proc. of STAGS (2000) pp. 395–406.

  5. J. Conway and N. Sloane, Sphere Packings, Lattices and Groups, 2nd ed. (Springer, Berlin, 1993).

    Google Scholar 

  6. A. Dubhashi, A. Pati, M.V.S. Shashanka, R. Shashank and A.M. Shende, Channel assignment in wireless networks modelled as cellular and d-dimensional square grids, http://citeseer.nj.nec.com/ (2002).

  7. J.R. Griggs and R.K. Yeh, Labeling graphs with a condition at distance 2, SIAM J. Discrete Math. (1992) 586–595.

  8. W.K. Hale, Frequency assignment: Theory and application, Proc. IEEE 68 (1980) 1497–1514.

    Google Scholar 

  9. R.A. Murphey, P.M. Pardalos and M.G.C. Resende, Frequency assignment problems, in: Handbook of Combinatorial Optimization (Kluwer Academic, Dordrecht, 1999).

    Google Scholar 

  10. D.S. Rajan and A.M. Shende, A characterization of root lattices, Discrete Math. 161 (1996) 309–314.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Boston University, Boston, MA, USA

    M.V.S. Shashanka

  2. Virginia Polytechnic Institute and State University, Blacksburg, VA, USA

    Amrita Pati

  3. 221 College Lane, Roanoke College, Salem, VA, 24153, USA

    Anil M. Shende

Authors
  1. M.V.S. Shashanka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amrita Pati
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Anil M. Shende
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shashanka, M., Pati, A. & Shende, A.M. A Characterisation of Optimal Channel Assignments for Cellular and Square Grid Wireless Networks. Mobile Networks and Applications 10, 89–98 (2005). https://doi.org/10.1023/B:MONE.0000048548.19218.c6

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:MONE.0000048548.19218.c6

Search

Navigation