Scholarlink

<p>Device-to-device (D2D) underlay communication has been considered as a promising technique due to its potential to enhance the spectrum efficiency in cellular networks. However, this comes at the cost of generating co-channel interference to cellular users (CUs). Recently, a few contributions showed that a D2D device can simultaneously act as a friendly jammer to enhance the secrecy of its underlaid CU against malicious eavesdroppers (EVs). To achieve this cooperation, a physical layer security perspective D2D resource allocation algorithm is carefully designed in this work. First, the investigation formulates an uplink resource allocation problem and investigate the quality of service (QoS) constraints of CUs, D2Ds, and eavesdroppers. Secondly, the investigation allocates channels according to the eavesdropper’s rate upper bounds to maximize the admissible D2D pairs while guaranteeing the QoS of both CUs and D2D links. Finally, numerical results show that our proposed secured interference filling (SIF) scheme can approach the secrecy probability of exhaustive searches while enjoying much less computational complexity.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Physical layer security perspective resource allocation for D2D underlay communications against multiple eavesdroppers

  • 期刊论文

  • 发表日期：

    2025年6月10日

查看全文
  • Yao-Jen Liang

摘要

Device-to-device (D2D) underlay communication has been considered as a promising technique due to its potential to enhance the spectrum efficiency in cellular networks. However, this comes at the cost of generating co-channel interference to cellular users (CUs). Recently, a few contributions showed that a D2D device can simultaneously act as a friendly jammer to enhance the secrecy of its underlaid CU against malicious eavesdroppers (EVs). To achieve this cooperation, a physical layer security perspective D2D resource allocation algorithm is carefully designed in this work. First, the investigation formulates an uplink resource allocation problem and investigate the quality of service (QoS) constraints of CUs, D2Ds, and eavesdroppers. Secondly, the investigation allocates channels according to the eavesdropper’s rate upper bounds to maximize the admissible D2D pairs while guaranteeing the QoS of both CUs and D2D links. Finally, numerical results show that our proposed secured interference filling (SIF) scheme can approach the secrecy probability of exhaustive searches while enjoying much less computational complexity.