基于等级的无线传感网自适应分簇算法
发布时间：2019-06-02 15:30
【摘要】：为解决现有无线传感器网络(WSN)分簇算法难以同时兼顾其异构性和移动性,从而引发网络寿命较短、网络数据吞吐量较低等问题,提出了基于节点等级的自适应分簇算法。该算法按轮运行,每轮分为自适应分簇、簇建立、数据传输三个阶段。为解决节点移动性引发的簇首数目和成簇规模不合理的问题,在自适应分簇阶段,根据子区域内节点数目变化对相应子区域进行细化或就近合并,以确保每个子区域内节点数目在合理范围内。在簇建立阶段,选举簇内等级最高的节点为簇首,解决异构性引发的部分节点能耗过快、网络寿命缩短的问题;节点等级除考虑节点剩余能量外,还结合WSN实际应用,由节点剩余能量、能量消耗速率、到基站的距离、到簇内其他节点的距离综合决定。基于OMNeT++和Matlab的仿真实验结果表明,在节点移动速度为0~0.6 m/s的能量异构WSN环境下,较移动低功耗自适应集簇分层(LEACH-Mobile)算法和分布式能量有效分簇(DEEC)算法,运用所提算法分簇的WSN寿命延长了30.9%以上,网络数据吞吐量是其他两种算法分簇的网络的1.15倍以上。
[Abstract]:In order to solve the problems of short network life and low network data throughput, an adaptive clustering algorithm based on node level is proposed to solve the problem that (WSN) clustering algorithm in wireless sensor networks is difficult to take into account its heterogeneity and mobility at the same time. The algorithm runs according to the wheel, and each round is divided into three stages: adaptive clustering, cluster establishment and data transmission. In order to solve the problem of unreasonable cluster head number and cluster size caused by node mobility, in the adaptive clustering stage, the corresponding sub-region is refined or merged according to the change of the number of nodes in the sub-region. To ensure that the number of nodes in each sub-area is within a reasonable range. In the cluster establishment stage, the highest grade node in the cluster is selected as the cluster head, which solves the problem of too fast energy consumption and shortening the network life caused by heterogeneity. In addition to considering the residual energy of the node, the node level is also combined with the practical application of WSN, which is determined by the residual energy of the node, the energy consumption rate, the distance to the base station and the distance to the other nodes in the cluster. The simulation results based on OMNeT and Matlab show that the adaptive cluster layering (LEACH-Mobile) algorithm and the distributed energy efficient clustering (DEEC) algorithm are lower than the mobile low power adaptive cluster layering (LEACH-Mobile) algorithm in the energy heterogeneous WSN environment with node moving speed of 0 鈮，
本文编号：2491220
[Abstract]:In order to solve the problems of short network life and low network data throughput, an adaptive clustering algorithm based on node level is proposed to solve the problem that (WSN) clustering algorithm in wireless sensor networks is difficult to take into account its heterogeneity and mobility at the same time. The algorithm runs according to the wheel, and each round is divided into three stages: adaptive clustering, cluster establishment and data transmission. In order to solve the problem of unreasonable cluster head number and cluster size caused by node mobility, in the adaptive clustering stage, the corresponding sub-region is refined or merged according to the change of the number of nodes in the sub-region. To ensure that the number of nodes in each sub-area is within a reasonable range. In the cluster establishment stage, the highest grade node in the cluster is selected as the cluster head, which solves the problem of too fast energy consumption and shortening the network life caused by heterogeneity. In addition to considering the residual energy of the node, the node level is also combined with the practical application of WSN, which is determined by the residual energy of the node, the energy consumption rate, the distance to the base station and the distance to the other nodes in the cluster. The simulation results based on OMNeT and Matlab show that the adaptive cluster layering (LEACH-Mobile) algorithm and the distributed energy efficient clustering (DEEC) algorithm are lower than the mobile low power adaptive cluster layering (LEACH-Mobile) algorithm in the energy heterogeneous WSN environment with node moving speed of 0 鈮，
本文编号：2491220
本文链接：https://www.wllwen.com/kejilunwen/xinxigongchenglunwen/2491220.html
