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 . 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 -IS-approximation is obtained; 2. a greedy -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 time -approximation algorithm; 4. we speed up the polynomial time approximation scheme for single-channel scheduling through merging two algorithms and show a -approximation algorithm. Next, we study two polynomial time constant factor greedy approximation algorithms for the unweighted channel allocation with variate interference radius. A greedy -approximation algorithm for the multichannel scheduling problem and an -approximation algorithm for single-channel scheduling problem are developed. At last, we do some experiments to verify the effectiveness of our proposed methods.
Ni, Q., Huang, C., Pardalos, P. M., Ye, J., & Fu, B. (2020). Different Approximation Algorithms for Channel Scheduling in Wireless Networks. Mobile Information Systems, 2020, e8836517. https://doi.org/10.1155/2020/8836517
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Mobile Information Systems