Strong Edge Coloring for Channel Assignment in Wireless Radio Networks

Abstract-- We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to computing a conflict-free assignment of channels or frequencies to pairwise links between transceivers in the network.

• Type: Conference
• Year: 2006
• Where: PERCOM
• Authors: Christopher L. Barrett, V. S. Anil Kumar, Madhav V. Marathe, Shripad Thite, Gabriel Istrate
• Keywords: Edge Coloring Graphs, PERCOM 2006, Strong Edge Coloring, Wireless Networks