Different Approximation Algorithms for Channel Scheduling in Wireless Networks

Algorithm 1

Greedy-multi-channel with fixed interference radius.

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 weights and put those edges in a list ;
(2)	Let ;
(3)	Repeat;
(4)	Select an edge with the largest weight 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 ;