当前位置: X-MOL 学术Int. J. Commun. Syst. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Secure communication with joint resource allocation, relay and jammer selection in OFDM‐based cooperative networks
International Journal of Communication Systems ( IF 2.1 ) Pub Date : 2021-03-31 , DOI: 10.1002/dac.4763
Qi Liu 1 , Ding Xu 1
Affiliation  

This paper considers an orthogonal frequency division multiplexing (OFDM) based cooperative network, where a source node communicates with a destination node with the help of multiple intermediate nodes, in the presence of an eavesdropper. Each intermediate node is assumed to be able to act as a relay or a jammer to improve the physical layer security. The problem of joint subcarrier allocation, power allocation, and mode selection to maximize the sum secrecy rate is investigated. We first reformulate the problem of subcarrier allocation and intermediate node mode selection as a three‐sided matching game and propose an algorithm that achieves a stable matching. Then, the sum secrecy rate is further improved by proposing a heuristic algorithm to switch the modes of the intermediate nodes. Finally, an iterative power allocation algorithm is proposed. It is verified by simulation results that the proposed algorithm outperforms various benchmark algorithms such as the equal subcarrier allocation algorithm, the pure relay selection algorithm, and the random relay selection algorithm, especially when the transmit power limit is high and the number of intermediate nodes is large.

中文翻译:

基于OFDM的协作网络中的联合资源分配,中继和干扰选择的安全通信

本文考虑了基于正交频分复用(OFDM)的协作网络,其中在存在窃听者的情况下,源节点与多个中间节点的帮助下与目的节点进行通信。假定每个中间节点都可以充当中继器或干扰器,以提高物理层的安全性。研究了联合子载波分配,功率分配和模式选择以最大化总保密率的问题。首先,我们将副载波分配和中间节点模式选择问题重新定义为三边匹配博弈,并提出了一种实现稳定匹配的算法。然后,通过提出一种启发式算法来切换中间节点的模式,进一步提高了总保密率。最后,提出了一种迭代功率分配算法。
更新日期:2021-05-04
down
wechat
bug