检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘涛[1] 庞博 LIU Tao;PANG Bo(College of Communication and Information Engineering,Xi’an University of Science and Technology,Xi’an 710054,China)
机构地区:[1]西安科技大学通信与信息工程学院,陕西西安710054
出 处:《现代电子技术》2022年第5期25-30,共6页Modern Electronics Technique
基 金:国家重点研发计划(2018YFC0808301);陕西省重点研发项目(2019ZDLSF07-06)。
摘 要:为进一步均衡无线传感器网络能耗,提出一种基于遗传算法改进的异构无线传感器网络分簇算法。在簇头选举阶段,分析传感器节点剩余能量、节点分布位置、节点的邻居节点密度因素,通过遗传算法寻优,选举出每轮最佳数目的最优簇头集;同时为解决周期性分簇造成的能量损失,建立簇头更新策略,降低簇头集更新频率。仿真结果表明,该算法与SEP、LEACH和TSEP算法相比较,第一死亡节点出现时间分别推迟了44.59%,69.4%和8.85%,网络寿命延长了174%,47.78%和71.33%。The clustering algorithm based on genetic algorithm(GA)is proposed for the heterogeneous wireless sensor network(HWSN)to further balance the energy consumption of wireless sensor networks(WSNs).In the stage of cluster head election,the residual energy of sensor nodes,the distribution location of the nodes and the density of the neighbor nodes are analyzed.The optimal number of the optimal cluster head set in each round is selected by GA optimizing.In view of the energy loss caused by periodic clustering,a cluster head update strategy is established to reduce the update frequency of cluster head set.The simulation results show that,in comparison with the SEP algorithm,LEACH algorithm and TSEP algorithm,the first dead node time of the proposed algorithm is delayed by 44.59%,69.4%and 8.85%respectively,and the network lifetime of the proposed algorithm is prolonged by 174%,47.78%and 71.33%respectively.
关 键 词:分簇算法 异构无线传感器网络 遗传算法 系统模型 簇头选择 簇头更新
分 类 号:TN711-34[电子电信—电路与系统] TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.13