Low-Complexity Priority-Aware Interference-Avoidance Scheduling for Multi-user Coexisting Wireless Networks

Abstract

In this paper, the priority-aware interference-avoidance scheduling for multi-user coexisting wireless networks with heterogeneous traffic demands is addressed. Both admission control and throughput maximization for admitted users are studied. These problems are addressed by a proposed sequential solution framework where at each step a large-scale linear program with a large number of variables is required to be solved. To efficiently solve the large-scale program, an accelerated column generation based method is proposed. In the proposed method, an efficient greedy initialization algorithm is first put forward by exploiting the proposed solution structure. After that, both upper and lower bounds on the optimal objective function of each optimization problem are derived, which are used to significantly alleviate the dependence of the whole solution procedure on deriving optimality of problems. Simulation results show that the proposed algorithm can effectively and efficiently handle the coexistence of multiple users with heterogeneous priorities and traffic demands.