检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:苏扬 魏连锁[1] 郭媛[1] SU Yang;WEI Liansuo;GUO Yuan(School of Computer and Control Engineering,Qiqihar University,Qiqihar 161003,China)
机构地区:[1]齐齐哈尔大学计算机与控制工程学院,齐齐哈尔161003
出 处:《北京邮电大学学报》2022年第4期91-97,共7页Journal of Beijing University of Posts and Telecommunications
基 金:国家自然科学基金项目(61872204);黑龙江省自然科学基金项目(LH2019F037)。
摘 要:针对基于博弈论的无线自组网络拓扑控制算法存在个别“瓶颈节点”负载不均衡、冗余链路多、生存时间短的问题,提出了一种多目标融合的网络拓扑控制算法。首先通过分析网络的连通性、节点发射功率、剩余能量、节点度、链路质量和链路长度对节点负载的影响,设计了一种改进的综合效用函数;建立多目标融合的网络拓扑控制势博弈模型,并证明该模型是序数势博弈且存在纳什均衡解;在维持网络k-连通的基础上,再采用最小路集算法对博弈后的网络拓扑链路进行优化,剔除冗余链路。仿真实验及对比分析结果表明,所提算法在保证网络连通性的前提下,实现了网络负载均衡,消除了冗余链路,生存时间相较于分布式能耗均衡拓扑控制算法、能量平衡拓扑控制博弈算法和节能容错拓扑控制博弈算法分别提升了25.4%、92.6%、36.8%。To solve problems such as unbalanced load of individual “bottleneck nodes”, many redundant links and short life cycle in existing topology control algorithm of wireless Ad hoc network based on game theory, a multi-objective fusion network topology control algorithm is proposed. First, by analyzing the influence of network connectivity, node transmission power, residual energy, node degree, link quality, and link length on node load, an improved and optimized comprehensive utility function is designed. Then, a multi-objective network topology control potential game model is established, and it is proved that the model is an ordinal potential game and has Nash equilibrium solution. On the basis of maintaining the k-connectivity of the network, the minimum path set algorithm is used to optimize the network topological links and eliminate redundant links after the gaming. Simulation experiments and comparative analysis show that the proposed algorithm can achieve network load balance and eliminate redundant links on the premise of ensuring network connectivity, and its life cycle is increased by 25.4%, 92.6%, and 36.8% compared with distributed topology control algorithm, energy balance topology control game algorithm and energy-efficient and fault-tolerant topology control game algorithm.
关 键 词:负载均衡 最小路集 k-连通 生存时间 冗余链路
分 类 号:TN311[电子电信—物理电子学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3