###
工程科学与技术:2021,53(2):125-132
←前一篇   |   后一篇→
本文二维码信息
码上扫一扫!
基于最优刚性子图的势博弈无线传感器网络拓扑优化算法
(齐齐哈尔大学 计算机技术与控制工程学院,黑龙江 齐齐哈尔 161006)
Topology Optimization Algorithm Based on Optimal Rigid Sub-graph for Potential-game Wireless Sensor Networks
(School of Computer and Control Eng., Qiqihar Univ., Qiqihar 161006, China)
摘要
图/表
参考文献
相似文献
附件
本文已被:浏览 2215次   下载 693
投稿时间:2020-09-01    修订日期:2020-12-14
中文摘要: 为了高效地利用网络资源,均衡网络拓扑能耗,剔除网络拓扑冗余链路,以降低节点负载及最大化的延长网络的生命周期。通过势博弈和最优刚性子图的概念,综合考虑节点的剩余能量、节点的负载及网络拓扑链路的冗余性,作者设计了一种基于最优刚性子图的势博弈无线传感器网络拓扑优化算法(PGOSG)。首先,根据节点间通信的功率变化,构造节点的功率集合作为博弈的策略集,利用势博弈理论以均衡能耗均衡为目标构建势博弈函数,并使其收敛至纳什均衡点,进而构建初步的网络拓扑结构。然后,利用最优刚性图全局链路数较少,且不损坏网络拓扑结构的特性,在上一步构建的网络拓扑结构上,利用最优刚性子图逐层剔除网络拓扑中的冗余链路,得到最终的网络拓扑结构。仿真实验分析了PGOSG算法的网络拓扑图、链路通信质量、网络鲁棒性以及网络生命周期,并将其与现有的DEBA算法进行了对比。从仿真结果可知:在拓扑结构上,PGOSG算法在网络的通信链路上剔除了网络中的冗余链路,降低了网络中部分节点的负载。在能耗均衡上,PGOSG算法在博弈阶段制定了节点数据转发规则有效地利用了网络资源,均衡了节点能耗,避免了节点间冗余转发。因此,提出的算法能够剔除网络中的冗余链路,降低节点的负载和链路权值,延长网络生存时间。
Abstract:In order to make efficient use of network resources, balance the energy consumption of network topology, eliminate redundant links between network topology, reduce node loads, and extend the life cycle of network of the maximum, in this paper a topology optimization algorithm for wireless sensor networks (PGOSG) was designed based on the concept of potential game and optimal stiffness sub-graph, which considers the residual energy of nodes, the load of nodes and the redundancy of network topology links. First, according to the power change of communication between nodes, the power set of nodes was constructed as the strategy set of the game, and the potential-game function was constructed with the goal of balancing energy consumption by using the potential game theory, which converges to the Nash equilibrium point, and then constructs the preliminary network topology structure. Second, taking advantage of the fact that the number of global links with the optimal rigid graph is small and does not damage the network topology, an optimal rigid sub-graph was used to eliminate redundant links between to the network topology layer by layer to obtain the final network topology. The network topology, link communication quality, network robustness and the network life cycles of PGOSG algorithm were analyzed by the simulation experiments, and compared with the existing DEBA algorithm. The simulation results show that: in the topology, PGOSG algorithm eliminates redundant links to the network communication links, and reduces the load of some nodes in the network. In terms of energy consumption balance, PGOSG algorithm formulates node data forwarding rules, effectively utilizes network resources, balances node energy consumption and avoids redundant forwarding between nodes in the game stage. Therefore, the algorithm proposed in this paper can eliminate redundant links in the network, reduce the node load and link weight, and prolong the network lifetime.
文章编号:202000752     中图分类号:TP393    文献标志码:
基金项目:国家自然科学基金项目(61872204);黑龙江省自然科学基金项目(LH2019F037);黑龙江省省属高等学校基本科研业务费科研项目(135409312;135309356);齐齐哈尔大学研究生创新科研项目(YJSCX2019072)
作者简介:第一作者:魏连锁(1975-),男,教授.研究方向:网络拓扑控制.E-mail:wlsaaaaaa@163.com
引用文本:
魏连锁,韩建,金涛,苏扬,郭媛.基于最优刚性子图的势博弈无线传感器网络拓扑优化算法[J].工程科学与技术,2021,53(2):125-132.
WEI Liansuo,HAN Jian,JIN Tao,SU Yang,GUO Yuan.Topology Optimization Algorithm Based on Optimal Rigid Sub-graph for Potential-game Wireless Sensor Networks[J].Advanced Engineering Sciences,2021,53(2):125-132.