首页> 外文期刊>IEEE transactions on information forensics and security >Security-Aware Resource Allocation With Delay Constraint for NOMA-Based Cognitive Radio Network
【24h】

Security-Aware Resource Allocation With Delay Constraint for NOMA-Based Cognitive Radio Network

机译:基于NOMA的认知无线电网络中具有时延约束的安全意识资源分配

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, a downlink security-aware resource allocation problem with delay constraint via spectrum sensing is modeled as a mixed integer non-linear problem for non-orthogonal multiple access-based cognitive radio network. The security-aware resource allocation is subject to constraints in required delay for each secondary user, maximum number of accessed secondary users at each subchannel, total interference power threshold introduced to primary users, and total power consumption at secondary BS. The security-aware resource allocation is based on channel state information at the physical layer and queue state information at the link layer. According to the queue buffer occupancy, a probability upper bound of exceeding the maximum packet delay based on M/D/1 queuing model is analyzed in terms of a required minimum secrecy transmission rate. Then, a secondary user scheduling problem and a power allocation problem are solved, separately. Finally, the secondary user scheduling problem is solved via greedy algorithm, and a power allocation algorithm is proposed by successive convex approximation method. The simulation results demonstrate that the performance of proposed algorithms can be improved significantly.
机译:在本文中,将基于频谱感知的具有延迟约束的下行链路安全感知资源分配问题建模为基于非正交多址访问的认知无线电网络的混合整数非线性问题。安全意识资源分配受到以下限制:每个次级用户所需的延迟,每个子信道上访问的次级用户的最大数量,引入初级用户的总干扰功率阈值以及次级BS的总功耗。安全意识资源分配基于物理层的通道状态信息和链路层的队列状态信息。根据队列缓冲区的占用情况,根据所需的最小保密传输速率,分析了基于M / D / 1排队模型超过最大数据包延迟的概率上限。然后,分别解决辅助用户调度问题和功率分配问题。最后,通过贪婪算法解决了二级用户调度问题,并通过逐次凸逼近法提出了一种功率分配算法。仿真结果表明,所提出算法的性能可以得到明显改善。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号