Sum secrecy rate maximization for relay-aided multiple-source multiple-destination networks
Zhang, Meng; Ding, Ming; Gui, Lin; Luo, Hanwen; Bennis, Mehdi (2016-09-16)
M. Zhang, M. Ding, L. Gui, H. Luo and M. Bennis, "Sum Secrecy Rate Maximization for Relay-Aided Multiple-Source Multiple-Destination Networks," in IEEE Transactions on Vehicular Technology, vol. 66, no. 5, pp. 4098-4109, May 2017. doi: 10.1109/TVT.2016.2609934
© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
This paper studies a multiple-source multiple-destination network with the presence of multiple eavesdroppers, in which an amplify-and-forward (AF) relay is used to bridge the communication between the source-destination pairs to overcome the long-distance attenuation. Considering the physical-layer security issues, we aim to maximize the sum secrecy rate subject to the relay power constraint and the quality-of-service (QoS) requirements for legitimate user equipment. First, we propose an algorithm based on the monotonic optimization and the semidefinite programming (MO-SDP). Simulation results show that our proposed MO-SDP algorithm exhibits almost the same performance as the optimal solution. To alleviate the problem of high complexity associated with the MO-SDP algorithm, we then propose an alternative solution based on the null-space (NuS) relay precoding, the complexity of which is significantly reduced, and it yields a semiclosed-form expression for the solution. Moreover, the performance of the proposed NuS algorithm is evaluated via simulations, and the performance of the NuS algorithm and that of the MO-SDP algorithm are shown to converge at the high signal-to-noise ratio (SNR) region.
- Avoin saatavuus