Abstract
In this paper, we analyze the secrecy outage probability of a relay aided multiuser network which consists of a cluster head (CH), a decode-and-forward (DF) relay, and multiple users in the presence of an eavesdropper and co-channel interference (CCI). Firstly, we propose two relay aided multiuser scheduling (RMS) schemes to improve the secrecy outage performance of the network by considering the availability of channel state information (CSI) of CCI links, including the partial CSI based RMS (PCSI-RMS) scheme and the full CSI based RMS (FCSI-RMS) scheme. For comparison purposes, the relay aided round-robin scheduling (RRRS) scheme is also employed as a baseline. Then, we derive closed-form expressions for the proposed PCSI-RMS and FCSI-RMS schemes as well as the RRRS scheme in terms of their exact and asymptotic secrecy outage probabilities over Rayleigh fading channels in the face of CCI. Finally, numerical results show that the secrecy outage performance of the proposed PCSI-RMS and FCSI-RMS schemes is better than that of the RRRS scheme, where FCSI-RMS achieves the best secrecy outage performance. With an increase of the number of users, the secrecy outage performance of the PCSI-RMS and FCSI-RMS schemes is significantly improved, while that of the RRRS scheme keeps unchanged, which demonstrates the benefits of adopting the proposed PCSI-RMS and FCSI-RMS schemes against eavesdropping in CCI environments. Moreover, there is an optimal power allocation factor between the CH and the relay, which makes the network have the best secrecy outage performance.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.