检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张士兵[1] 韩刘可 张美娟 ZHANG Shibing;HAN Liuke;ZHANG Meijuan(School of Information Science and Technology,Nantong University,Nantong 226019,China)
机构地区:[1]南通大学信息科学技术学院,江苏南通226019
出 处:《通信学报》2020年第9期139-146,共8页Journal on Communications
基 金:国家自然科学基金资助项目(No.61871241,No.61771263)。
摘 要:为了缓解频谱资源匮乏、提高认知无线网络的功率利用率,提出了一种基于能量收集的全双工认知中继网络功率分配算法。所提算法在保证对主用户干扰以及中继端收集能量满足一定条件的情况下,优化能量受限的认知中继节点功率分配系数及次用户发射功率,实现了次用户系统吞吐量的最大化,提高了频谱效率。由于所提算法的优化问题是非凸的,因此将其转化为针对功率分配系数和次用户发射功率的2个可解凸优化子问题,通过收敛迭代算法求得原问题的最终解。仿真结果表明,采用所提算法的次用户系统吞吐量,与采用半双工功分算法的系统吞吐量相比提升了一倍,与采用全双工时分算法的系统吞吐量相比提升了0.5倍。To alleviate the shortage of spectrum resources and improve the power utilization of cognitive radio networks,a resource allocation algorithm of full duplex cognitive relay networks with energy harvesting was proposed.In the algorithm,the coefficient for power splitting of the relay and the transmit power of the secondary users were jointly optimized to maximize the throughput of the secondary users under the interference to primary users and energy harvesting constraints.Since the optimization of the algorithm was non-convex,it was transformed into two sub-optimizations,the sub-optimization of the coefficient for power splitting and the sub-optimization of the power transmitted of secondary users,which were the solvable convex sub-optimizations.Then,the final solution of the original optimization was obtained with the iterative algorithm.Simulation results show that the throughput of the proposed algorithm,can obtain 2 times throughput of the networks with half-duplex power splitting algorithm and 1.5 times throughput of the networks with full-duplex time switching algorithm.
分 类 号:TN925[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.117.172.41