
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Alan A. Bertossi, Cristina M. Pinotti, Richard B. Tan, "Channel Assignment with Separation for Interference Avoidance in Wireless Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 14, no. 3, pp. 222235, March, 2003.  
BibTex  x  
@article{ 10.1109/TPDS.2003.1189581, author = {Alan A. Bertossi and Cristina M. Pinotti and Richard B. Tan}, title = {Channel Assignment with Separation for Interference Avoidance in Wireless Networks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {14}, number = {3}, issn = {10459219}, year = {2003}, pages = {222235}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2003.1189581}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Channel Assignment with Separation for Interference Avoidance in Wireless Networks IS  3 SN  10459219 SP222 EP235 EPD  222235 A1  Alan A. Bertossi, A1  Cristina M. Pinotti, A1  Richard B. Tan, PY  2003 KW  Wireless networks KW  channel assignment KW  interferences KW  rings KW  cellular grids KW  bidimensional grids KW  L(2 KW  1 KW  1){\hbox{}}\rm coloring KW  L(\delta_1 KW  1 KW  \ldots KW  1){\hbox{}}\rm coloring . VL  14 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—Given an integer
[1] R. Battiti, A.A. Bertossi, and M.A. Bonuccelli, “Assigning Codes in Wireless Networks: Bounds and Scaling Properties,” Wireless Networks, vol. 5, pp. 195209, 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. 441449, 1995.
[3] A.A. Bertossi and M.C. Pinotti, “Mappings for ConflictFree Access of Paths in Bidimensional Arrays, Circular Lists, and Complete Trees,” J. Parallel and Distributed Computing, vol. 62, pp. 13141333, 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$\big. L(2,1){\hbox{}}\rm Labeling\bigr.$Problem on Graphs,” SIAM J. Discrete Math., vol. 9, pp. 309316, 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. 728737, 1987.
[8] D. Goodman, J. Borras, N. Mandayam, and R. Yates, INFOSTATIONS: A New System Model for Data and Messaging Services Proc. IEEE Vehicular Technology Conf., vol. 2, pp. 969973, 1997.
[9] H. Griffin, Elementary Theory of Numbers. New York: McGrawHill, 1954.
[10] J.R. Griggs and R.K. Yeh, “Labelling Graphs with a Condition at Distance$\big. 2\bigr.$,” SIAM J. Discrete Math., vol. 5, pp. 586595, 1992.
[11] W.K. Hale, “Frequency Assignment: Theory and Application,” Proc. IEEE, vol. 68, pp. 14971514, 1980.
[12] I. Katzela and M. Naghshineh, “Channel Assignment Schemes for Cellular Mobile Telecommunication Systems: A Comprehensive Survey,” IEEE Personal Comm., vol. 3, no. 3, pp. 1031, June 1996.
[13] T. Makansi, “Transmitted Oriented Code Assignment for Multihop Packet Radio,” IEEE Trans. Comm., vol. 35, pp. 13791382, 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. 133140, 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. 7686, 1998.
[18] A. Tanenbaum, Computer Networks. Prentice Hall, 1988.
[19] J. Van den Heuvel, R.A. Leese, and M.A. Shepherd, “Graph Labelling and Radio Channel Assignment,” J. Graph Theory, vol. 29, pp. 263283, 1998.
[20] J. Zander, “Trends and Challenges in Resource Management Future Wireless Networks,” Proc. IEEE Wireless Comm. and Networks Conf., 2000.