Channel assignment on strongly-simplicial graphs

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003

Volumn , Issue , 2003, Pages

  Bertossi, A A ^a   Pinotti, M C ^b   Rizzi, R ^b  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b University Trento   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTED PARAMETER NETWORKS; FORESTRY; GRAPHIC METHODS; TREES (MATHEMATICS);

CHANNEL ASSIGNMENT; DELTA-I; INTERVAL GRAPH; NONNEGATIVE INTEGERS; POSITIVE INTEGERS; UNDIRECTED GRAPH; UNIT INTERVAL GRAPHS; VERTEX SET;

GRAPH THEORY;

EID: 84947219291     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2003.1213408     Document Type: Conference Paper

References (10)

1. R. Battiti, A. A. Bertossi, and M. A. Bonuccelli, \Assigning Codes in Wireless Networks: Bounds and Scaling Proper-ties", Wireless Networks, Vol. 5, 1999, pp. 195-209.
2. A. A. Bertossi and M. C. Pinotti, \Mappings for Conict-Free Access of Paths in Bidimensional Arrays, Circular Lists, and Complete Trees", Journal of Parallel and Distributed Com-puting, Vol. 62, 2002, pp. 1314-1333.
3. A. A. Bertossi, M. C. Pinotti, and R. Tan, \Eficient Use of Radio Spectrum in Wireless Netw orks with Channel Sepa-ration bet w een Close Stations", DIAL M for Mobility; Int'l A CM Workshop on Discrete A lgorithms and Methods for Mobile Computing, Boston, August 2000.
4. A. A. Bertossi, M. C. Pinotti, and R. B. Tan, \Channel Assign-ment with Separation for Interference Av oidance in Wireless Netw orks", to appear IEEE T ransactions on Parallel and Distribute d Systems.
5. I. Chlamtac and S. S. Pinter, \Distributed Nodes Organiza-tions Algorithm for Channel Access in a Multihop Dynamic Radio Netw ork", IEEE Transactions on Computers, Vol. 36, 1987, pp. 728-737.
6. W. K. Hale, \Frequency Assignment: Theory and Applica-tion", Pr oceedings of the IEEE, Vol. 68, 1980, pp. 1497-1514.
7. S. T. McCormick, \Optimal Approximation of Sparse Hes-sians and its Equivalence to a Graph Coloring Problem", Mathematical Programming, V ol. 26, 1983, pp. 153-171.
8. D. Sakai, \Labeling Chordal Graphs: Distance Two Condi-tion", SIAM Journal on Discrete Mathematics, Vol. 7, 1994, pp. 133-140.
9. A. Sen, T. Roxborough, and S. Medidi, \Upper and Low er Bounds of a Class of Channel Assignment Problems in Cel-lular Net w orks", T echnical Report, Arizona State Uneirvsity, 1997
10. J. V an den Heuvel, R. A. Leese, and M. A. Shepherd, \Graph Labelling and Radio Channel Assignment", Journal of Graph The ory, Vol. 29, 1998, pp. 263-283.