Joint Robust Beamforming and Power-Splitting Ratio Design in SWIPT-Based Cooperative NOMA Systems With CSI Uncertainty

Yuan, Yi and Xu, P. and Yang, Z. and Ding, Z. and Chen, Q. (2019) Joint Robust Beamforming and Power-Splitting Ratio Design in SWIPT-Based Cooperative NOMA Systems With CSI Uncertainty. IEEE Transactions on Vehicular Technology, 68 (3). pp. 2386-2400. ISSN 0018-9545

[img]
Text (Joint Robust Beamforming and Power-Splitting Ratio Design in SWIPT-based Cooperative NOMA Systems with CSI Uncertainty)
Joint_Robust_Beamforming_and_Power_Splitting_Ratio_Design_in_SWIPT_based_Cooperative_NOMA_Systems_with_CSI_Uncertainty.pdf - Accepted Version
Available under License Creative Commons Attribution-NonCommercial.

Download (491kB)

Abstract

This paper investigates the effect of imperfect channel state information on the performance of the cooperative non-orthogonal multiple access (NOMA) transmission scheme, inwhich the cell-center user acts as a decode-and-forward relay to assist the information transmission. The cell-center user adopts a simultaneous wireless information and power transfer (SWIPT) technique to harvest energy for information forwarding. Based on two channel error models, a maximization problem is formulated to jointly design the robust beamforming and the power splitting ratio while satisfying the minimum data rate for the far user and the successfully decoding requirement for the information of the far user at the near user. For the worst case design under the deterministic error model, the successive convex approximation and the semidefinite relaxation technique are utilized to approximate the non-convex problem to an iterative convex problem. For the outage-constrained design under the stochastic error model, Bernstein-type inequality-based and large deviation inequality-based approaches are used to safely approximate the probabilistic constraints of the inner-level problem to the deterministic constraints, and a golden section search algorithm is employed to find out the optimal single variable of the outer-level problem. Furthermore, the rank proof is provided to prove that the relaxation is tight.

Item Type:
Journal Article
Journal or Publication Title:
IEEE Transactions on Vehicular Technology
Additional Information:
Export Date: 8 April 2019 CODEN: ITVTA Correspondence Address: Xu, P.; Chongqing Key Laboratory of Mobile Communications Technology, Chongqing University of Posts and TelecommunicationsChina; email: xupeng@cqupt.edu.cn Funding details: Natural Science Foundation of Fujian Province, 2018J05101 Funding details: Engineering and Physical Sciences Research Council, 690750, EP/N005597/2 Funding details: Jilin Scientific and Technological Development Program Funding details: Chongqing Municipal Education Commission, KJ1704088, 61571128, U1805262, 61871131, 61701118 Funding details: National Natural Science Foundation of China, 61701066 Funding text 1: Manuscript received October 3, 2018; revised November 25, 2018; accepted December 15, 2018. Date of publication January 10, 2019; date of current version March 14, 2019. The work of P. Xu was supported in part by the National Natural Science Foundation of China under Grant 61701066, and in part by the Scientific and Technological Research Program of Chongqing Municipal Education Commission under Grant KJ1704088. The work of Z. Yang was supported in part by the National Natural Science Foundation of China under Grants 61701118, U1805262, 61571128, and 61871131, and in part by the Natural Science Foundation of Fujian Province, China under Grant 2018J05101. The work of Z. Ding was supported in part by the UK EPSRC under Grant EP/N005597/2 and in part by H2020-MSCA-RISE-2015 under Grant 690750. The review of this paper was coordinated by Prof. G. Gui. (Corresponding author: Peng Xu.) Y. Yuan is with the School of Computing and Communications, Lancaster University, Lancaster LA1 4YW, U.K. (e-mail:,y.yuan3@lancaster.ac.uk).
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/2200/2202
Subjects:
ID Code:
132546
Deposited By:
Deposited On:
17 Sep 2019 09:20
Refereed?:
Yes
Published?:
Published
Last Modified:
29 Nov 2020 06:10