Advertisement

Channel Assignment in Honeycomb Networks

  • Alan A. Bertossi
  • Cristina M. Pinotti
  • Romea Rizzi
  • Anil M. Shende
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2841)

Abstract

The honeycomb grid is a network topology based on the hexagonal plane tessellation, which is convenient to model the regular placement on the plane of the base stations of wireless networks. For an efficient use of the radio spectrum in such networks, channels have to be assigned to the base stations so as to avoid interferences. Such a problem can be modeled as a suitable coloring problem. Precisely, given an integer t and a honeycomb grid G=(V,E), an L(1 t )-coloring of G is a function f from the vertex set V to a set of nonnegative integers such that |f(u) − f(v)| ≥ 1, if the distance between the vertices u and v is at most t. This paper presents efficient algorithms for finding optimal L(1 t )-colorings of honeycomb grids.

Keywords

Wireless Network Channel Assignment Maximum Clique Radio Spectrum Chordal Graph 
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.
    Bertossi, A.A., Pinotti, M.C.: Mappings for Conflict-Free Access of Paths in Bidimensional Arrays, Circular Lists, and Complete Trees. Journal of Parallel and Distributed Computing 62, 1314–1333 (2002)zbMATHCrossRefGoogle Scholar
  2. 2.
    Bertossi, A.A., Pinotti, M.C., Rizzi, R.: Channel Assignment on Strongly- Simplicial Graphs. In: 3rd Int’l Workshop on Wireless, Mobile and Ad Hoc Networks, Nice (April 2003)Google Scholar
  3. 3.
    Bertossi, A.A., Pinotti, M.C., Tan, R.B.: Channel Assignment with Separation for Interference Avoidance in Wireless Networks. IEEE Transactions on Parallel and Distributed Systems (February 2003) (to appear)Google Scholar
  4. 4.
    Bodlaender, H.L., Kloks, T., Tan, R.B., van Leeuwen, J.: Approximation λ- Coloring on Graphs. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, p. 395. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  5. 5.
    Chang, G.J., Kuo, D.: The L(2, 1)-Labeling Problem on Graphs. SIAM Journal on Discrete Mathematics 9, 309–316 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Chlamtac, I., Pinter, S.S.: Distributed Nodes Organizations Algorithm for Channel Access in a Multihop Dynamic Radio Network. IEEE Transactions on Computers 36, 728–737 (1987)CrossRefGoogle Scholar
  7. 7.
    Griggs, J.R., Yeh, R.K.: Labelling Graphs with a Condition at Distance 2. SIAM Journal on Discrete Mathematics 5, 586–595 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Hale, W.K.: Frequency Assignment: Theory and Application. Proceedings of the IEEE 68, 1497–1514 (1980)CrossRefGoogle Scholar
  9. 9.
    Katzela, I., Naghshineh, M.: Channel Assignment Schemes for Cellular Mobile Telecommunication Systems: A Comprehensive Survey. IEEE Personal Communications, 10–31 (June 1996)Google Scholar
  10. 10.
    McCormick, S.T.: Optimal Approximation of Sparse Hessians and its Equivalence to a Graph Coloring Problem. Mathematical Programming 26, 153–171 (1983)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Sakai, D.: Labeling Chordal Graphs: Distance Two Condition. SIAM Journal on Discrete Mathematics 7, 133–140 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Sen, A., Roxborough, T., Medidi, S.: Upper and Lower Bounds of a Class of Channel Assignment Problems in Cellular Networks, Technical Report, Arizona State University (1997)Google Scholar
  13. 13.
    Shende, A.M., et al.: A Characterisation of Optimal Channel Assignments for Wireless Networks Modelled as Cellular and Square Grids. In: 3rd Int’l IEEE Workshop on Wireless, Mobile and Ad Hoc Networks, Nice (April 2003)Google Scholar
  14. 14.
    Stojmenovic, I.: Honeycomb Networks: Topological Properties and Communication Algorithms. IEEE Transactions on Parallel and Distributed Systems 8, 1036–1042 (1997)CrossRefGoogle Scholar
  15. 15.
    Van den Heuvel, J., Leese, R.A., Shepherd, M.A.: Graph Labelling and Radio Channel Assignment. Journal of Graph Theory 29, 263–283 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Zander, J.: Trends and Challenges in Resource Management Future Wireless Networks. In: IEEE Wireless Communications & Networks Conference (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Alan A. Bertossi
    • 1
  • Cristina M. Pinotti
    • 2
  • Romea Rizzi
    • 2
  • Anil M. Shende
    • 3
  1. 1.Department of Computer ScienceUniversity of BolognaBolognaItaly
  2. 2.Dept. of Computer Science and Telecom.University of TrentoTrentoItaly
  3. 3.Department of Computer ScienceRoanoke CollegeSalemUSA

Personalised recommendations