Channel assignment for interference avoidance in honeycomb wireless networks

Journal of Parallel and Distributed Computing

Volumn 64, Issue 12, 2004, Pages 1329-1344

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

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF PERUGIA   (Italy)

^c UNIVERSITY OF TRENTO   (Italy)

^d ROANOKE COLLEGE   (United States)

Author keywords

Channel assignment; Honeycomb grids; Interference; L(1t) coloring; L(2, 1) coloring; L(2, 12) coloring; Separation; Wireless networks

Indexed keywords

ALGORITHMS; ELECTRIC NETWORK TOPOLOGY; FREQUENCY DIVISION MULTIPLE ACCESS; GLOBAL SYSTEM FOR MOBILE COMMUNICATIONS; GRAPH THEORY; RADIO INTERFERENCE; SEPARATION; TIME DIVISION MULTIPLE ACCESS;

CHANNEL ASSIGNMENT; HONEYCOMB GRIDS; L(2,1)-COLORING; RADIO SPECTRUM;

TELECOMMUNICATION NETWORKS;

EID: 9644288104     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2004.06.006     Document Type: Article

References (25)

1. K.I. Aardal, S.P.M. van Hoesel, A.M.C.A. Koster, C. Mannino, A. Sassano, Models and Solution Techniques for Frequency Assignment Problems, ZIB-Report 01-40, December 2001, available at FAP web site http://fap.zib.de.
2. G. Agnarsson, R. Greenlaw, M.M. Halldorsson, On powers of chordal graphs and their colorings, Congr. Numer. 144 (2000) 41-65.
3. R. Battiti, A.A. Bertossi, M.A. Bonuccelli, Assigning codes in wireless networks: bounds and scaling properties, ACM/Baltzer Wireless Networks 5 (1999) 195-209.
4. A.A. Bertossi, M.C. Pinotti, Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees, J. Parallel Distrib. Comput. 62 (2002) 1314-1333.
5. A.A. Bertossi, M.C. Pinotti, R.B. Tan, Channel assignment with separation for interference avoidance in wireless networks, IEEE Trans. Parallel Distrib. Sys. 14 (2003) 222-235.
6. H.L. Bodlaender, T. Kloks, R.B. Tan, J. van Leeuwen, Approximation λ-coloring on graphs, STACS, 2000.
7. A. Boukerche, H. Song, T. Jacob, An efficient dynamic channel allocation algorithm for mobile telecommunication systems, ACM/Baltzer Mobile Networks and Appl. 7 (2002) 115-126.
8. G.J. Chang, D. Kuo, The L(2, 1)-labeling problem on graphs, SIAM J. Discrete Math. 9 (1996) 309-316.
9. I. Chlamtac, S.S. Pinter, Distributed nodes organizations algorithm for channel access in a multihop dynamic radio network, IEEE Trans Comput. 36 (1987) 728-737.
10. J.C.I. Chuang, Performance issues and algorithms for dynamic channel assignment, IEEE J. Select. Areas Commun. 11 (1993) 955-963.
11. S.K. Das, S.K. Sen, R. Jayaram, A dynamic load balancing strategy for channel assignment using selective borrowing in cellular mobile environment, ACM/Baltzer Wireless Networks 3 (1997) 333-347.
12. J.R. Griggs, R.K. Yeh, Labelling graphs with a condition at distance 2, SIAM J. Discrete Math. 5 (1992) 586-595.
13. W.K. Hale, Frequency assignment: theory and application, Proc. IEEE 68 (1980) 1497-1514.
14. I. Katzela, M. Naghshineh, Channel assignment schemes for cellular mobile telecommunication systems: a comprehensive survey, IEEE Pers. Commun. (June 1996) 10-31.
15. S.T. McCormick, Optimal approximation of sparse hessians and its equivalence to a graph coloring problem, Math. Programming 26 (1983) 153-171.
16. R. Montemanni, J.N.J. Moon, D.H. Smith, An improved tabu search algorithm for the fixed spectrum frequency assignment problem, IEEE Trans. Veh. Technol. 52 (2003) 891-901.
17. C.Y. Ngo, V.O.K. Li, Fixed channel assignment in cellular radio networks using a modified genetic algorithm, IEEE Trans. Veh. Technol. 47 (1998) 163-172
18. S. Ramanathan, A unified framework and algorithm for channel assignment in wireless networks, ACM/Baltzer Wireless Networks 5 (1999) 81-94.
19. D. Sakai, Labeling chordal graphs: distance two condition, SIAM J. Discrete Math. 7 (1994) 133-140.
20. A. Sen, T. Roxborough, S. Medidi, Upper and lower bounds of a class of channel assignment problems in cellular networks, IEEE INFOCOM'98, April 1998, San Francisco, pp. 1284-1291.
21. A.M. Shende, et al., A characterisation of optimal channel assignments for wireless networks modelled as cellular and square grids, Proceedings of the Third International IEEE Workshop on Wireless, Mobile and Ad Hoc Networks, April 2003, Nice.
22. I. Stojmenovic, Honeycomb networks: topological properties and communication algorithms, IEEE Trans. Parallel Distrib. Sys. 8 (1997) 1036-1042.
23. A.S. Tanenbaum, Computer Networks, Prentice-Hall, Englewood Cliffs, 1989.
24. J. Van den Heuvel, R.A. Leese, M.A. Shepherd, Graph labelling and radio channel assignment, J. Graph Theory 29 (1998) 263-283.
25. J. Zander, Trends and challenges in resource management future wireless networks, IEEE Wireless Communications & Networks Conference, 2000.