Generalized Benders Decomposition to Secure Energy-Efficient Resource Allocation for Multiuser Full-Duplex Relay Cooperative Networks

In this paper, we investigate the issue of resource allocation for secure energy efficient communication in a multiuser orthogonal frequency division multiplexing (OFDM) based full-duplex (FD) relaying network in the presence of a passive eavesdropper whose channel state information (CSI) is not per...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on vehicular technology Ročník 68; číslo 11; s. 10728 - 10741
Hlavní autoři: Li, Ruoguang, Wang, Li, Tao, Xiaoming, Song, Mei, Han, Zhu
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.11.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Benders decomposition
Communication system security
Decomposition
Energy consumption
Energy efficiency
full duplex
generalized Benders decomposition
Integer programming
Mixed integer
mixed integer nonconvex programming
Multiuser relay networks
Nonlinear programming
OFDM
Optimization
Orthogonal Frequency Division Multiplexing
Permutations
Power management
Programming
Relay networks (telecommunications)
Relaying
Resource allocation
Resource management
secure energy efficiency
Subcarriers
Wireless communication
ISSN:0018-9545, 1939-9359
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we investigate the issue of resource allocation for secure energy efficient communication in a multiuser orthogonal frequency division multiplexing (OFDM) based full-duplex (FD) relaying network in the presence of a passive eavesdropper whose channel state information (CSI) is not perfectly known. Our goal is to maximize the overall secure energy efficiency (SEE), which presents the relationship between energy consumption and secrecy performance. In the context of multiuser communications, such a resource allocation strategy jointly combines subcarrier permutation, subcarrier pair allocation, as well as power allocation altogether. The considered optimization problem is formulated as a mixed integer nonconvex programming problem, which is generally NP hard. Analyzing the property of such a problem, we first use the Dinkelbach's method to eliminate the fractional form and then exploit Generalized Benders decomposition to decouple the original problem into a master problem for pure integer programming and a primal problem for nonlinear programming. More specific, given the nonconvexity of the primal problem, we accordingly transform it into an equivalent relaxed convex problem by applying dual decomposition, alternative convex search, and difference of convex function programming. The numerical results are provided to validate the theoretical analysis and to demonstrate the effectiveness of the proposed algorithm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2019.2937575