Open AccessSecrecy outage performance for partial relay selection schemes in cooperative systems
Author(s) -
Zhou Yameng,
Pan Gaofeng,
Li Tingting,
Liu Hequn,
Tang Chaoqing,
Chen Yunfei
Publication year - 2015
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2015.0109
Subject(s) - relay , rayleigh fading , computer science , upper and lower bounds , secrecy , computer network , transmission (telecommunications) , scheme (mathematics) , fading , telecommunications , mathematics , channel (broadcasting) , computer security , power (physics) , physics , quantum mechanics , mathematical analysis
In this study, secrecy outage performance is studied for partial relay selection (PRS) schemes in cooperative systems over Rayleigh fading channels. In the considered systems, there are one source (S), one destination (D), one eavesdropper, one jammer that can send interference to the eavesdropper, and N ( N > 1) relay candidates, one of which is selected as the relay (R). By considering the practical scenarios and to protect the transmitted information over R–D link from being eavesdropped, the authors propose a new transmission scheme: let D send random information to R while S sending information to R. Then, R processes the messages from S and D by XOR operation in order to prevent the eavesdropper's interception while the information is delivered between R and D. They study the secrecy outage performance for two PRS schemes: (i) the optimal source–relay link (OSRL) scheme; and (ii) the optimal source–relay–destination link (OSRDL) scheme. The closed‐form expressions for the secrecy outage probability (SOP) of the two PRS schemes are derived, as well as the closed‐form upper bound for SOP under OSRL scheme and the lower bound for SOP under OSRDL scheme. Finally, simulation results are given to verify the presented analytical models and the proposed transmission scheme.