计算机科学
认知无线电
计算机网络
继电器
保密
资源配置
发射机
信道状态信息
最优化问题
安全通信
安全传输
发射机功率输出
几何规划
无线
频道(广播)
电信
计算机安全
功率(物理)
算法
加密
物理
量子力学
机器学习
作者
Nader Mokari,Saeedeh Parsaeefard,Hamid Saeedi,Paeiz Azmi
标识
DOI:10.1109/twc.2013.010214.130929
摘要
In this paper, we introduce a new cooperative paradigm for secure communication in cognitive radio networks (CRNs) where secondary users (SUs) are allowed to access the spectrum of primary users (PUs) as long as they preserve the secure communication of PUs in the presence of malicious eavesdroppers. To do so, the SU transmission is divided into two hops: at first hop, the SU transmitter sends the information to a relay set and the SU receiver acts as a friendly jammer to disturb the overhearing of eavesdroppers and at the second hop, one of the relays is selected to pass the information to the SU receiver and the SU transmitter acts as a friendly jammer for the PU. In this new setup, the time duration for each hop, the power transmissions of all nodes in CRN, and relay selection at the second hop are allocated in such a way that the secrecy rate of the SU is maximized subject to the minimum required PU's secrecy rate. From primary service perspective, this transforms the possibly disturbing secondary service activities into a beneficial network element. We investigate instantaneous and ergodic resource allocation problems for perfect and imperfect channel state information (CSI). Since these problems are non-convex, we propose a solution based on decomposition of main optimization problem into three subproblems related to the power allocation, time allocation, and relay selection. We show that the power allocation problem can be transformed into a generalized geometric programming (GGP) model via the so-called scaled algorithm and it can be solved very efficiently. Simulation results indicate that in terms of the secondary secrecy rate, the proposed setup outperforms the conventional setup in which the secrecy rate of the PU is not guaranteed.
科研通智能强力驱动
Strongly Powered by AbleSci AI