首页> 外文期刊>IEEE transactions on information forensics and security >Cooperative Privacy Preserving Scheme for Downlink Transmission in Multiuser Relay Networks
【24h】

Cooperative Privacy Preserving Scheme for Downlink Transmission in Multiuser Relay Networks

机译:多用户中继网络中下行传输的协作隐私保护方案

获取原文
获取原文并翻译 | 示例

摘要

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.
机译:本文研究了在多用户中继网络中用于下行链路传输的隐私保护,其中,源通过使用放大转发协议的中继与多个用户进行通信。在任何调度单元内,仅一个用户(期望的用户)被选择用于数据接收,并且由于无线介质的广播性质,其他用户(不期望的用户)被视为潜在的窃听者。为了防止信息泄漏,我们提出了一种物理层协作式隐私保护方案,其关键思想是除了提供所需的用户之外还安排协作用户来传递人工噪声(AN)。通过利用信道的特性,合作用户仔细地设计了在两个时隙期间发送的AN,使得可以在期望的用户处取消AN,但是在不期望的用户处不能将其移除。结果,任何不希望的用户的端到端信噪比大大降低,而所需用户的信噪比没有受到严重影响,因此保留了所需用户的数据机密性。为了最大化瞬时保密率,开发了机会用户选择标准。得出了遍历保密率(ESR)的下限以及保密中断概率的近似上限。还通过极值理论分析了ESR的渐近性能。此外,为了激励具有异构信道条件的用户参与合作并保证用户之间的公平性,提出了一种基于用户分组的选择方法。为了评估该方法的性能,引入并研究了一种称为系统公平因子的新概念。理论分析和仿真结果表明,由于所提出的协作式隐私保护机制,系统ESR随着用户数量的增加而增长,与文献中的现有方案相比,可以实现更高的保密率和更低的保密中断概率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号