Different Approximation Algorithms for Channel Scheduling in Wireless Networks

Algorithm 5

Greedy-signal-channel with variate interference radii ().

 Input: a weighted graph , and a distance parameter for the largest distance of interference.

 Output:

(1) Sort all edges by the increasing order of their sum of radii and put those edges in a list .

(2) Let ;

(3) Repeat;

(4) Select an edge with the least sum of radii from ;

(5) If there is a channel for not being interfered by

(6) Then, assign the channel to and put into ;

(7) Remove from ;

(8) Until is empty;

(9) Return ;