检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:孙林 毛忠阳 康家方 张磊 SUN Lin;MAO Zhongyang;KANG Jiafang;ZHANG Lei(Aviation Communication Teaching and Research Section,Naval Aeronautic University,Yantai 264001,China;Key Laboratory of Signal and Information Processing of Shandong,Naval Aeronautic University,Yantai 264001,China)
机构地区:[1]海军航空大学航空通信教研室,山东烟台264001 [2]海军航空大学信号与信息处理山东省重点实验室,山东烟台264001
出 处:《系统工程与电子技术》2022年第8期2661-2667,共7页Systems Engineering and Electronics
基 金:国家基础加强计划重点基础研究项目资助课题。
摘 要:为提升海上无人艇编队多跳中继网络整体能效,降低中断发生概率,提出一种基于最大化能效的分布式多跳中继频谱分配算法。为将节点间通信中断概率控制在阈值范围内,首先对莱斯衰落信道进行分析,计算满足需求的最低发射功率;之后计算所需最多子载波个数,引入异步分布式定价算法选取备选子载波组;而后通过求解KKT条件,利用次梯度法从备选子载波组中选取子载波并分配功率,求得优化分配的次优解;最后在系统可靠性与能效等方面进行仿真分析,验证了所提算法的有效性。In order to improve the overall energy efficiency of multi-hop relaying networks for the formation of unmanned surface vessel, and reduce the possibility of outage in communication, a distributed multi-hop relaying spectrum allocation algorithm is put forward based on maximizing energy efficiency. Firstly, for the sake of making sure that the possibility of inter node communication interruptions is kept within the threshold, an analysis on Rician fading channel is conducted to calculate the minimum transmitting power needed in networks. Then, the number of maximum subcarriers is calculated and the asynchronous distributed pricing algorithm is applied to select the candidate subcarriers group. After that, the sub gradient method is used, by solving KKT conditions, to select the subcarriers from the candidate subcarrier group and allocate the power, therefore, a sub optimal solution of the optimal allocation is obtained. Finally, the effectiveness of the proposed algorithm is verified by the simulation analysis on the reliability and energy efficiency of networks.
分 类 号:TN92[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.117.227.191