Journal
IEEE INTERNET OF THINGS JOURNAL
Volume 5, Issue 3, Pages 1857-1868Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JIOT.2018.2816597
Keywords
Branch-and-bound; multiple access; nonorthogonal user scheduling; power allocation; stochastic optimization
Categories
Funding
- National Natural Science Foundation of China [61571370, 61601365]
- Natural Science Basic Research Plan in Shaanxi Province [2016JQ6017]
- National Science and Technology Major Project [2016ZX03001015]
- Fundamental Research Funds for the Central Universities [3102017OQD091, 3102017GX08003]
- NSERC
Ask authors/readers for more resources
Nonorthogonal multiple access (NOMA) exhibits superiority in spectrum efficiency and device connections in comparison with the traditional orthogonal multiple access technologies. However, the nonorthogonality of NOMA also introduces intracell interference that has become the bottleneck limiting the performance to be further improved. To coordinate the intracell interference, we investigate the dynamic user scheduling and power allocation problem in this paper. Specifically, we formulate this problem as a stochastic optimization problem with the objective to minimize the total power consumption of the whole network under the constraint of all users' long-term rate requirements. To tackle this challenging problem, we first transform it into a series of static optimization problems based on the stochastic optimization theory. Afterward, we exploit the special structure of the reformulated problem and adopt the branchand- bound technique to devise an efficient algorithm, which can obtain the optimal control policies with a low complexity. As a good feature, the proposed algorithm can make decisions only according to the instantaneous system state and can guarantee the long-term network performance. Simulation results demonstrate that the proposed algorithm has good performance in convergence and outperforms other schemes in terms of power consumption and user satisfaction.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available