Channel assignment in honeycomb networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2841, Issue , 2003, Pages 150-162

  Bertossi, Alan A ^a   Pinotti, Cristina M ^b   Rizzi, Romea ^b   Shende, Anil M ^c  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF TRENTO   (Italy)

^c ROANOKE COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BASE STATIONS; TOPOLOGY;

CHANNEL ASSIGNMENT; COLORING PROBLEMS; HEXAGONAL PLANES; HONEYCOMB NETWORKS; NETWORK TOPOLOGY; NONNEGATIVE INTEGERS; RADIO SPECTRA; VERTEX SET;

HONEYCOMB STRUCTURES;

EID: 0142187693     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45208-9_13     Document Type: Article

References (16)

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