TY - GEN
T1 - User Connectivity Maximization for D2D and Cellular Hybrid Networks with Non-Orthogonal Multiple Access
AU - Zhai, Daosen
AU - Wang, Yutong
AU - Zhang, Ruonan
AU - Zhang, Zhenfeng
AU - Wang, Dawei
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/9
Y1 - 2019/9
N2 - Non-orthogonal multiple access (NOMA) and device-to-device (D2D) are two key technologies of the fifth-generation wireless networks. In this paper, we propose a new D2D-and-NOMA integrated framework, where the D2D users (DUEs) can reuse the spectrum of the cellular users (CUEs) in four NOMA-aided spectrum-sharing modes. In order to fully exploit the potential of the proposed framework, we jointly optimize user pairing and power control to maximize the number of accessed D2D links and meanwhile reduce the total power consumption under the constraints of the decoding thresholds of the DUEs and CUEs. We first analytically obtain the optimal transmission power for each DUE-CUE pair. Then, based on the power control policy, we reformulate the user pairing problem as a min-cost max-flow problem in graph theory and solve it efficiently. Specifically, our proposed algorithm can solve the formulated problem optimally with low complexity. Finally, simulation results indicate that our algorithm can significantly improve the number of accessed D2D links and reduce the power consumption in comparison with the other schemes.
AB - Non-orthogonal multiple access (NOMA) and device-to-device (D2D) are two key technologies of the fifth-generation wireless networks. In this paper, we propose a new D2D-and-NOMA integrated framework, where the D2D users (DUEs) can reuse the spectrum of the cellular users (CUEs) in four NOMA-aided spectrum-sharing modes. In order to fully exploit the potential of the proposed framework, we jointly optimize user pairing and power control to maximize the number of accessed D2D links and meanwhile reduce the total power consumption under the constraints of the decoding thresholds of the DUEs and CUEs. We first analytically obtain the optimal transmission power for each DUE-CUE pair. Then, based on the power control policy, we reformulate the user pairing problem as a min-cost max-flow problem in graph theory and solve it efficiently. Specifically, our proposed algorithm can solve the formulated problem optimally with low complexity. Finally, simulation results indicate that our algorithm can significantly improve the number of accessed D2D links and reduce the power consumption in comparison with the other schemes.
UR - http://www.scopus.com/inward/record.url?scp=85075860584&partnerID=8YFLogxK
U2 - 10.1109/PIMRC.2019.8904406
DO - 10.1109/PIMRC.2019.8904406
M3 - 会议稿件
AN - SCOPUS:85075860584
T3 - IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC
BT - 2019 IEEE 30th Annual International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 30th IEEE Annual International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC 2019
Y2 - 8 September 2019 through 11 September 2019
ER -