Name
Title | ||
|---|---|---|
Generalized Benders Decomposition to Secure Energy-Efficient Resource Allocation for Multiuser Full-Duplex Relay Cooperative Networks |
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/TVT.2019.2937575 | IEEE Transactions on Vehicular Technology |
Keywords | Field | DocType |
Resource management,OFDM,Wireless communication,Relay networks (telecommunications),Communication system security,Programming | Subcarrier,Mathematical optimization,Computer science,Nonlinear programming,Electronic engineering,Resource allocation,Convex function,Integer programming,Convex optimization,Optimization problem,Channel state information | Journal |
Volume | Issue | ISSN |
68 | 11 | 0018-9545 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ruoguang Li | 1 | 27 | 3.22 |
| Li Wang | 2 | 430 | 52.48 |
| Xiaoming Tao | 3 | 321 | 53.93 |
| Mei Song | 4 | 265 | 44.50 |
| Zhu Han | 5 | 11215 | 760.71 |