Strong edge coloring for channel assignment in wireless radio networks

Proceedings - Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 2006

Volumn 2006, Issue , 2006, Pages 106-110

  Barrett, Christopher L ^b   Istrate, Gabriel ^a   Kumar, V S Anil ^b   Marathe, Madhav V ^b   Thite, Shripad ^c   Thulasidasan, Sunil ^a  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

^b VIRGINIA POLYTECHNIC INSTITUTE AND STATE UNIVERSITY   (United States)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CHANNEL CAPACITY; COMPUTATIONAL METHODS; COMPUTER SIMULATION; MATHEMATICAL MODELS; NATURAL FREQUENCIES; TRANSCEIVERS;

CHANNEL ASSIGNMENT; COLORING GRAPHS; SEQUENCIAL ALGORITHMS; STRONG EDGE COLORING;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 33750331010     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PERCOMW.2006.129     Document Type: Conference Paper

References (19)

1. T. Nandagopal, T. Kim, X. Gao, and V. Bharghavan, "Achieving MAC layer fairness in wireless packet networks," in Proc. 6th ACM Conf. on Mobile Computing and Networking, August 2000, pp. 87-98.
2. S. Ramanathan and E. L. Lloyd, "Scheduling algorithms for multi-hop radio networks," in IEEE/ACM Trans. Networking, vol. 2, 1993, pp. 166-177.
3. S. Ramanathan, "A unified framework and algorithm for (T/F/C) DMA channel assignment in wireless networks," in Proc. IEEE INFOCOM'97, 1997, pp. 900-907.
4. M. Mahdian, "The strong chromatic index of graphs," Master's thesis, Department of Computer Science, University of Toronto, 2000.
5. _, "On the computational complexity of strong edge coloring," Discrete Applied Mathematics, vol. 118, pp. 239-248, 2002.
6. J. Erickson, S. Thite, and D. Bunde, "Distance-2 edge coloring is NP-complete," 2002, arXiv:cs.DM/0509100. http://arxiv.org/abs/cs/0509100/
7. S. O. Krumke, M. V. Marathe, and S. S. Ravi, "Models and approximation algorithms for channel assignment in radio networks," Wireless Networks, vol. 7, pp. 575-584, 2001.
8. A. Gräf, M. Stumpf, and G. Weißenfels, "On coloring unit disk graphs," Algorithmica, vol. 20, pp. 277-293, 1998.
9. H. Balakrishnan, C. L. Barrett, V. S. A. Kumar, M. V. Marathe, and S. Thite, "The distance-2 matching problem and its relationship to the MAC-layer capacity of ad hoc wireless networks," IEEE Journal on Selected Areas in Communications, vol. 22, no. 6, pp. 1069-1079, 2004.
10. T. Ozugur, M. Naghshineh, P. Kermani, C. Olsen, B. Rezvani, and J. A. Copeland, "Balanced media access methods for wireless networks," in Proc. ACM MOBICOM, 1998.
11. V. Bhargavan, S. Demers, S. Shenker, and L. Zhang, "Macaw: A media access protocol for wireless LANs," in Proc. ACM SIGCOMM, 1994.
12. G. Holland, N. Vaidya, and P. Bahl, "A rate-adaptive MAC protocol for multi-hop wireless networks," in Proc. ACM MOBICOMM, 2001.
13. P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Transactions on Information Theory, vol. 46, no. 2, pp. 388-404, 2000.
14. R. Faudree, A. Gyarfas, R. Shelp, and Z. Tuza, "The strong chromatic index of graphs," Ars Combinatoria, vol. 29B, pp. 205-211, 1990.
15. A. Proskurowski and M. M. Syslo, "Efficient vertex and edge coloring of outerplanar graphs," SIAM J. Algebraic and Discrete Methods, vol. 7, pp. 131-136, 1986.
16. R. J. Wilson, Introduction to Graph Theory, 2nd ed. Longman Publishers, UK, 1979.
17. M. R. Salavatipour, "A polynomial time algorithm for strong edge coloring of partial k-trees," Discrete Applied Math, vol. 143, pp. 285-291, 2004.
18. H. L. Bodlaender, "A tourist guide through treewidth," Utrecht University, Tech. Rep. RUU-CS-92-12, 1992.
19. M. Luby, "A simple parallel algorithm for the maximal independent set problem," SIAM J. Computing, vol. 15, no. 4, pp. 254-278, 1986.