Channel assignment with separation for interference avoidance in wireless networks

IEEE Transactions on Parallel and Distributed Systems

Volumn 14, Issue 3, 2003, Pages 222-235

  Bertossi, Alan A ^a   Pinotti, Cristina M ^b   Tan, Richard B ^c  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b UNIVERSITY OF TRENTO   (Italy)

^c University of Science and Arts of Oklahoma   (United States)

Author keywords

Bidimensional grids; Cellular grids; Channel assignment; Interferences; L( 1, 1, ..., 1) coloring; L(2, 1, 1) coloring; Rings; Wireless networks

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); ELECTRIC NETWORK TOPOLOGY; GRAPH THEORY; INTERFERENCE SUPPRESSION; RADIO STATIONS; THEOREM PROVING; TRANSMITTERS; WIRELESS TELECOMMUNICATION SYSTEMS;

CELLULAR GRIDS; CHANNEL ASSIGNMENT; INTERFERENCE AVOIDANCE; OPTIMAL COLORING; WIRELESS NETWORK;

SIGNAL FILTERING AND PREDICTION;

EID: 0037963009     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPDS.2003.1189581     Document Type: Article

References (20)

1. R. Battiti, A.A. Bertossi, and M.A. Bonuccelli, "Assigning Codes in Wireless Networks: Bounds and Scaling Properties," Wireless Networks, vol. 5, pp. 195-209, 1999.
2. A.A. Bertossi and M.A. Bonuccelli, "Code Assignment for Hidden Terminal Interference Avoidance in Multihop Packet Radio Networks," IEEE/ACM Trans. Networking, vol. 3 pp. 441-449, 1995.
3. A.A. Bertossi and M.C. Pinotti, "Mappings for Conflict-Free Access of Paths in Bidimensional Arrays, Circular Lists, and Complete Trees," J. Parallel and Distributed Computing, vol. 62, pp. 1314-1333, 2002.
4. A.A. Bertossi, M.C. Pinotti, and R. Tan, "Efficient Use of Radio Spectrum in Wireless Networks with Channel Separation between Close Stations," DIAL M for Mobility; Int'l ACM Workshop Discrete Algorithms and Methods for Mobile Computing, 2000.
5. H.L. Bodlaender, T. Kloks, R.B. Tan, and J. van Leeuwen, "Approximation λ-Coloring on Graphs," Proc. Int'l Symp. Theoretical Aspects of Computer Science, 2000.
6. G.J. Chang and D. Kuo, "The L(2, 1)-Labeling Problem on Graphs," SIAM J. Discrete Math., vol. 9, pp. 309-316, 1996.
7. I. Chlamtac and S.S. Pinter, "Distributed Nodes Organizations Algorithm for Channel Access in a Multihop Dynamic Radio Network," IEEE Trans. Computers, vol. 36, pp. 728-737, 1987.
8. D. Goodman, J. Borras, N. Mandayam, and R. Yates, "INFOSTATIONS: A New System Model for Data Messaging Services," Proc. 47th IEEE Vehicular Technology Conf., 1997.
9. H. Griffin, Elementary Theory of Numbers. New York: McGraw-Hill, 1954.
10. J.R. Griggs and R.K. Yeh, "Labelling Graphs with a Condition at Distance 2," SIAM J. Discrete Math., vol. 5, pp. 586-595, 1992.
11. W.K. Hale, "Frequency Assignment: Theory and Application," Proc. IEEE, vol. 68, pp. 1497-1514, 1980.
12. I. Katzela and M. Naghshineh, "Channel Assignment Schemes for Cellular Mobile Telecommunication Systems: A Comprehensive Survey," IEEE Personal Comm., pp. 10-31, June 1996.
13. T. Makansi, "Transmitted Oriented Code Assignment for Multihop Packet Radio," IEEE Trans. Comm., vol. 35, pp. 1379-1382, 1987.
14. S.T. McCormick, "Optimal Approximation of Sparse Hessians and Its Equivalence to a Graph Coloring Problem," Math. Programming, vol. 26, pp. 153-171, 1983.
15. D. Sakai, "Labeling Chordal Graphs: Distance Two Condition," SIAM J. Discrete Math., vol. 7, pp. 133-140, 1994.
16. 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 Univ., 1997.
17. D.H. Smith, S. Hurley, and S.U. Thiel, "Improving Heuristics for the Frequency Assignment Problem," European J. Operation Research, vol. 107, pp. 76-86, 1998.
18. A.S. Tanenbaum, Computer Networks. Englewood Cliffs, N.J.: Prentice Hall, 1989.
19. J. Van den Heuvel, R.A. Leese, and M.A. Shepherd, "Graph Labelling and Radio Channel Assignment," J. Graph Theory, vol. 29, pp. 263-283, 1998.
20. J. Zander, "Trends and Challenges in Resource Management Future Wireless Networks," Proc. IEEE Wireless Comm. and Networks Conf., 2000.