高级检索
    吴嘉鑫, 武继刚, 陈龙, 隋秀峰. 能量收集与协作网络安全容量优化技术[J]. 计算机研究与发展, 2019, 56(3): 533-543. DOI: 10.7544/issn1000-1239.2019.20170838
    引用本文: 吴嘉鑫, 武继刚, 陈龙, 隋秀峰. 能量收集与协作网络安全容量优化技术[J]. 计算机研究与发展, 2019, 56(3): 533-543. DOI: 10.7544/issn1000-1239.2019.20170838
    Wu Jiaxin, Wu Jigang, Chen Long, Sui Xiufeng. Secrecy Capacity Optimization Technique for Energy Harvest Cooperative Cognitive Radio Network[J]. Journal of Computer Research and Development, 2019, 56(3): 533-543. DOI: 10.7544/issn1000-1239.2019.20170838
    Citation: Wu Jiaxin, Wu Jigang, Chen Long, Sui Xiufeng. Secrecy Capacity Optimization Technique for Energy Harvest Cooperative Cognitive Radio Network[J]. Journal of Computer Research and Development, 2019, 56(3): 533-543. DOI: 10.7544/issn1000-1239.2019.20170838

    能量收集与协作网络安全容量优化技术

    Secrecy Capacity Optimization Technique for Energy Harvest Cooperative Cognitive Radio Network

    • 摘要: 基于协作通信与能量收集技术,研究在能量收集认知无线电网络中,主用户和次用户的信道资源配置问题,目标是主用户安全容量最大.在该网络中,次用户发送节点具有能量收集功能,且帮助主用户发送节点进行协作传输.作为回报,在次用户协作主用户通信结束后,主用户发送节点分配频谱资源给次用户发送节点.在保证次用户服务质量的前提下,设计主用户安全容量最大化的计算方法.仿真实验结果表明:安全容量与能量收集因子成反比关系,与协作通信因子成正比关系.提出的算法可以保证主用户传输的安全容量.最后,假设次用户以恒定小功率工作,当协作通信因子从0.2~0.5变化时,提出的算法比现有策略在安全容量上平均高出79.28%,80.46%,64.23%,78.85%,此外,提出的算法比现有算法的计算效率平均高出7.34倍.

       

      Abstract: In order to maximize the primary secrecy rate, we researched the channel resource allocation of the primary user (PU) and the secondary user (SU) in the energy harvesting cognitive radio (EHCR) which is based on the cooperative communication and energy harvesting technology. In this network, the SU, which can harvest energy from the ambient, will assist the PU with cooperative communication. As a reward, the SU can get the opportunity to access the PU’s spectrum resource when the cooperative communication is over. Given the QoS demand of SU transmission node, we design a computing method of maximizing the primary secrecy rate. Numerical results demonstrate that the secrecy capacity is inverse proportional to the energy harvesting ratio, and it is also direct proportional to the cooperative communication ratio. We also figure out that the secrecy capacity is achievable. In the end, we assume that the SU works at a constant low sending power, when the cooperative communication ratio changes from 0.2 to 0.5, our research is lifting 79.28%, 80.46%, 64.23%, 78.85% on average, respectively, on the maximization of the secrecy rate, in comparison to the existing strategy. Moreover, the proposed algorithm is about 7.34 times efficient than the existing algorithms averagely.

       

    /

    返回文章
    返回