Uploaded byshripadthite
1,144 views
Strong Edge Coloring for Channel Assignment in Wireless Radio Networks
The document describes channel assignment in wireless radio networks as a strong edge coloring problem on graphs. It presents sequential approximation algorithms to minimize the number of channels needed for interference-free communication. It also provides a distributed protocol to maximize the number of communicating transceiver pairs when a fixed number of channels are available. Experimental results show the performance of a greedy distributed algorithm for strong edge coloring on random disk graphs with power-law distributed broadcast radii.
