Abstract

In this paper, we study joint link scheduling and power control with successive interference cancellation (SIC), aiming at maximizing the α-utility. The joint link scheduling and power control with SIC (PCSIC) problem is formulated to be a mixed-integer non-linear programming (MINLP), which is NP-hard. In order to solve the problem, we first decompose the MINLP into three sub-problem and then propose an iterative algorithm. We compare our strategy with the scheme without power control from the perspective of system throughput, fairness index and energy consumption. Numerical results show the noticeable performance improvement of the proposed strategy.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call