Download now Free registration required
This paper concerns the problem of finding the minimum-length TDMA frame of a power-controlled wireless network subject to traffic demands and SINR (signal-to-interference-plus-noise ratio) constraints. The paper formulates the general joint link scheduling and power control problem as an Integer Linear Programming (ILP) problem. The linear relaxation of the ILP problem has been claimed to be NP-hard in the literature. This paper presents a computationally efficient heuristic algorithm, called the Increasing Demand Greedy Scheduling (IDGS) algorithm, to solve the general ILP problem. In addition, the paper proposes using a Column Generation (CG) method as an augmentation to IDGS to further improve its performance.
- Format: PDF
- Size: 151.6 KB