Joint selection and transmission scheduling of point-to-point communication requests in multi-channel wireless networks
Peng‐Jun Wan · 2016
Consider a set of point-to-point communication requests in a multi-channel multihop wireless network, each of which is associated with a traffic demand of at most one unit of transmission time, and a weight representing the utility if its demand is fully met. A subset of them is said to be feasible if they can be scheduled within one unit of time. The problem Maximum-Weighted Feasible Set (MWFS) seeks a feasible subset with maximum total weight together with a transmission schedule of them whose length is at most one unit of time. This paper develops efficient and provably good approximation algorithms for the problem MWFS.