Different Approximation Algorithms for Channel Scheduling in Wireless Networks

الملخص EN

We introduce a new two-side approximation method for the channel scheduling problem, which controls the accuracy of approximation in two sides by a pair of parameters f,g.

We present a series of simple and practical-for-implementation greedy algorithms which give constant factor approximation in both sides.

First, we propose four approximation algorithms for the weighted channel allocation problem: 1.

a greedy algorithm for the multichannel with fixed interference radius scheduling problem is proposed and an one side O1-IS-approximation is obtained; 2.

a greedy O1,O1-approximation algorithm for single channel with fixed interference radius scheduling problem is presented; 3.

we improve the existing algorithm for the multichannel scheduling and show an EOd/ε time 1−ϵ-approximation algorithm; 4.

we speed up the polynomial time approximation scheme for single-channel scheduling through merging two algorithms and show a 1−ϵ,O1-approximation algorithm.

Next, we study two polynomial time constant factor greedy approximation algorithms for the unweighted channel allocation with variate interference radius.

A greedy O1-approximation algorithm for the multichannel scheduling problem and an O1,O1-approximation algorithm for single-channel scheduling problem are developed.

At last, we do some experiments to verify the effectiveness of our proposed methods.