Multi-Objective Optimization for Full-Duplex SWIPT Systems

This paper studies a multi-objective optimization (MOO) problem in full-duplex (FD) networks with simultaneous wireless information and power transfer (SWIPT). In the considered networks, an FD base station (BS) communicates with multiple half-duplex (HD) uplink (UL) and downlink (DL) users simultan...

Full description

Bibliographic Details
Main Authors: Meng Li, Xiaofeng Tao, Na Li, Huici Wu
Format: Article
Language:English
Published: IEEE 2020-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8993832/
Description
Summary:This paper studies a multi-objective optimization (MOO) problem in full-duplex (FD) networks with simultaneous wireless information and power transfer (SWIPT). In the considered networks, an FD base station (BS) communicates with multiple half-duplex (HD) uplink (UL) and downlink (DL) users simultaneously. The energy receivers (ERs) harvest energy from the ambient radio frequency (RF) signals and may act as potential eavesdroppers. Specifically, there exists two conflicting yet important system design objectives, i.e., secrecy energy efficiency (SEE) maximization and energy harvesting efficiency (EHE) maximization. An MOO design based on the weighted Tchebycheff approach is proposed to investigate the tradeoff between these two design objectives. The proposed design takes into account the quality-of-service (QoS) guarantees of secrecy rate and energy harvesting (EH) under the imperfect channel state information (CSI) of ERs. The formulated MOO problem is solved with a two-layer optimization algorithm, where the modified Dinkelbach method is applied to deal with the generalized fractional programming (FP) in the outer layer problem and semidefinite relaxation (SDR), successive convex approximation (SCA) as well as S-procedure methods are applied to transfer the inner layer problem into a convex iterative program. Moreover, we propose a suboptimal solution to the formulated problem and analyze the computational complexities. Finally, numerical results are provided to demonstrate the effectiveness of the proposed algorithms and reveal a tradeoff region between SEE and EHE.
ISSN:2169-3536