Physical-Layer Security in Distributed Wireless Networks Using Matching Theory
Physical-Layer Security in Distributed Wireless Networks Using Matching Theory
复制标题
DOI：
10.1109/tifs.2013.2251335
复制
发表时间：
2013-05
影响因子：
6.8
通讯作者：
S. Bayat;Raymond H. Y. Louie;Zhu Han;B. Vucetic;Yonghui Li
中科院分区：
文献类型：
--
作者：
S. Bayat;Raymond H. Y. Louie;Zhu Han;B. Vucetic;Yonghui Li
我们考虑在无线通信系统中使用物理层安全，其中多个干扰节点协助多个源目的节点对抗来自单个窃听者的不想要的窃听。特别是，我们提出了一种分布式算法，将每个源-目的地对与特定的干扰器进行匹配。我们的算法满足三种信道状态信息(CSI)假设：全局CSI、本地CSI和无窃听信道的本地CSI。我们证明了我们的算法具有许多理想的性质。首先，该算法的结果是稳定的匹配，这在信源和干扰节点是自私的情况下是很重要的。其次，当价格阶数足够小时，该算法的保密率收敛于集中最优解的保密率。第三，我们的算法只有在少量迭代后才能收敛，并且开销相对较小。第四，我们的算法比集中式最优方法的复杂度要低得多。
We consider the use of physical-layer security in a wireless communication system where multiple jamming nodes assist multiple source-destination nodes in combating unwanted eavesdropping from a single eavesdropper. In particular, we propose a distributed algorithm that matches each source-destination pair with a particular jammer. Our algorithm caters for three channel state information (CSI) assumptions: global CSI, local CSI, and local CSI without the eavesdropper channel. We prove that our algorithm has many desirable properties. First, the outcome of the proposed algorithm results in a stable matching, which is important if the source and jamming nodes are selfish. Second, the secrecy rate of the proposed algorithm converges to the secrecy rate of a centralized optimal solution, if the price step-number is sufficiently small. Third, our algorithm converges only after a small number of iterations, and its overhead is relatively small. Fourth, our algorithm has a significantly lower complexity than a centralized optimal approach.