Existing works have addressed the interference mitigation by any two of the three approaches: link scheduling, power control, and successive interference cancellation(SIC). In this paper, we integrate the above approa...Existing works have addressed the interference mitigation by any two of the three approaches: link scheduling, power control, and successive interference cancellation(SIC). In this paper, we integrate the above approaches to further improve the spectral efficiency of the wireless networks and consider the max-min fairness to guarantee the transmission demand of the worst-case link. We formulate the link scheduling with joint power control and SIC(PCSIC) problem as a mixed-integer non-linear programming(MINLP), which has been proven to be NP-complete. Consequently, we propose an iterative algorithm to tackle the problem by decomposing it into a series of linear subproblems, and then the analysis shows that the algorithm has high complexity in the worst case. In order to reduce the computational complexity, we have further devised a two-stage algorithm with polynomial-time complexity. Numerical results show the performance improvements of our proposed algorithms in terms of the network throughput and power consumption compared with the link scheduling scheme only with SIC.展开更多
基金supported by National Natural Science Foundation of China(Grant Nos.61231008,61172079,61201141,61301176,91338114)Science and Technology on Information Transmission and Dissemination in Communication Networks Laboratory Fund Project+1 种基金Programme of Introducing Talents of Discipline to Universities(Grant No.B08038)National High Technology Research and Development Program of China(Grant No.2014AA01A701)
文摘Existing works have addressed the interference mitigation by any two of the three approaches: link scheduling, power control, and successive interference cancellation(SIC). In this paper, we integrate the above approaches to further improve the spectral efficiency of the wireless networks and consider the max-min fairness to guarantee the transmission demand of the worst-case link. We formulate the link scheduling with joint power control and SIC(PCSIC) problem as a mixed-integer non-linear programming(MINLP), which has been proven to be NP-complete. Consequently, we propose an iterative algorithm to tackle the problem by decomposing it into a series of linear subproblems, and then the analysis shows that the algorithm has high complexity in the worst case. In order to reduce the computational complexity, we have further devised a two-stage algorithm with polynomial-time complexity. Numerical results show the performance improvements of our proposed algorithms in terms of the network throughput and power consumption compared with the link scheduling scheme only with SIC.
