TY - JOUR
T1 - Cooperative Privacy Preserving Scheme for Downlink Transmission in Multiuser Relay Networks
AU - Xu, Hongbin
AU - Sun, Li
AU - Ren, Pinyi
AU - Du, Qinghe
AU - Wang, Yichen
N1 - Publisher Copyright:
© 2005-2012 IEEE.
PY - 2017/4
Y1 - 2017/4
N2 - This paper studies the privacy-preserving for downlink transmission in multiuser relay networks, where a source communicates with multiple users via a relay employing the amplify-and-forward protocol. Within any scheduling unit, only one user (desired user) is chosen for data reception, and the other users (undesired users) are viewed as potential eavesdroppers due to the broadcast nature of wireless medium. To prevent information leakage, we propose a physical-layer cooperative privacy preserving scheme, whose key idea is to schedule a cooperating user in addition to the desired user to deliver artificial noise (AN). By exploiting the characteristics of channels, the cooperating user carefully designs the AN transmitted during two time slots such that the AN can be canceled out at the desired user, but cannot be removed at the undesired users. As a result, the end-to-end signal-to-noise-ratio of any undesired user is heavily degraded, while that of the desired user is not seriously affected, thus preserving the data confidentiality of the desired user. To maximize the instantaneous secrecy rate, an opportunistic user selection criterion is developed. The lower bound of the ergodic secrecy rate (ESR) as well as the approximate upper bound of the secrecy outage probability is derived. The asymptotic performance of ESR is also analyzed via extreme value theory. Furthermore, to motivate users with heterogeneous channel conditions to participate in cooperation and guarantee the fairness among users, a user-grouping-based selection method is proposed. To evaluate the performance of this method, a novel concept called system fairness factor is introduced and studied. Theoretical analysis and simulation results show that, thanks to the proposed cooperative privacy preserving mechanism, the system ESR grows with the increasing number of users, and much higher secrecy rate and lower secrecy outage probability can be achieved compared with the existing schemes in the literature.
AB - This paper studies the privacy-preserving for downlink transmission in multiuser relay networks, where a source communicates with multiple users via a relay employing the amplify-and-forward protocol. Within any scheduling unit, only one user (desired user) is chosen for data reception, and the other users (undesired users) are viewed as potential eavesdroppers due to the broadcast nature of wireless medium. To prevent information leakage, we propose a physical-layer cooperative privacy preserving scheme, whose key idea is to schedule a cooperating user in addition to the desired user to deliver artificial noise (AN). By exploiting the characteristics of channels, the cooperating user carefully designs the AN transmitted during two time slots such that the AN can be canceled out at the desired user, but cannot be removed at the undesired users. As a result, the end-to-end signal-to-noise-ratio of any undesired user is heavily degraded, while that of the desired user is not seriously affected, thus preserving the data confidentiality of the desired user. To maximize the instantaneous secrecy rate, an opportunistic user selection criterion is developed. The lower bound of the ergodic secrecy rate (ESR) as well as the approximate upper bound of the secrecy outage probability is derived. The asymptotic performance of ESR is also analyzed via extreme value theory. Furthermore, to motivate users with heterogeneous channel conditions to participate in cooperation and guarantee the fairness among users, a user-grouping-based selection method is proposed. To evaluate the performance of this method, a novel concept called system fairness factor is introduced and studied. Theoretical analysis and simulation results show that, thanks to the proposed cooperative privacy preserving mechanism, the system ESR grows with the increasing number of users, and much higher secrecy rate and lower secrecy outage probability can be achieved compared with the existing schemes in the literature.
KW - Multiuser relay systems
KW - cooperation
KW - ergodic secrecy rate
KW - physical-layer security
KW - secrecy outage probability
UR - https://www.scopus.com/pages/publications/85014959320
U2 - 10.1109/TIFS.2016.2636091
DO - 10.1109/TIFS.2016.2636091
M3 - 文章
AN - SCOPUS:85014959320
SN - 1556-6013
VL - 12
SP - 825
EP - 839
JO - IEEE Transactions on Information Forensics and Security
JF - IEEE Transactions on Information Forensics and Security
IS - 4
M1 - 7775083
ER -