基于LEACH的无线传感器网络簇首选取改进算法  

Modified cluster-head selection algorithm for WSNs based on LEACH

作　　者：赵亮 兰智高[2] 熊志利 Zhao Liang;Lan Zhigao;Xiong Zhili(Department of Electronics and Information Engineering,Central China Normal University,Wuhan 430079,China;School of Electric Information,Huanggang Normal University,Huanggang 438000,China)

机构地区：[1]华中师范大学电子信息工程系,武汉430079 [2]黄冈师范学院电子信息学院,黄冈438000

出　　处：《电子测量与仪器学报》2019年第12期86-93,共8页Journal of Electronic Measurement and Instrumentation

基　　金：2018年湖北省技术创新专项(2018ADD170);湖北省教育厅科学研究项目(B2016207);黄冈师范学院科技创新团队项目(201613603);华中师范大学研究生创新创业项目(2018CXZZ119)资助。

摘　　要：针对无线传感器网络(WSNs)LEACH路由协议中簇首选取不合理和能耗过高等问题,提出了一种基于LEACH的簇首选取改进算法LEACH-M。通过利用ZigBee协议中的分布式地址分配策略,首先计算出各节点的网络地址,然后结合其剩余电能来优化簇首选取阈值。此外,通过在LEACH-M中加入簇首竞争轮换机制,一方面均衡了WSNs的能耗负载,另一方面避免了簇首提前死亡而导致的路由瘫痪。NS-2.35仿真实验表明,在100 m×100 m的小面积监测和300 m×300 m的大面积监测中,所提出的算法最多能够延长33%的网络寿命,降低46%的网络能耗,增加68%的基站数据接收量。In order to solve the problems such as unreasonable cluster-head selection and excessive energy consumption in LEACH routing protocol of wireless sensor networks(WSNs), a modified cluster-head selection algorithm based on LEACH(LEACH-M) is proposed. Firstly, by using distributed address assignment strategy(DAAS) of ZigBee, network address of nodes is calculated. Then, combined with residual energy, the cluster-head selection threshold of LEACH is optimized. Furthermore, by leveraging a cluster-head competitive mechanism, LEACH-M not only balances the network energy burden but also avoids early death of cluster heads. Finally, the simulation results in NS-2.35 demonstrate that the proposed algorithm can extend the network lifetime by 33% at most, minimize the energy consumption by 46%, and raise the amount of data received at base station by 68%, when region of interest(ROI) is in a 100 m×100 m small area or in a 300 m×300 m large area.

关 键 词：无线传感器网络 LEACH 路由算法 簇首选取 NS-2.35 

分 类 号：TP393[自动化与计算机技术—计算机应用技术] TN92[自动化与计算机技术—计算机科学与技术]