基于剩余能量和位置的LEACH改进算法.pdfVIP

第38 卷 第24 期 计 算 机 工 程 2012 年12 月 Vol.38 No.24 Computer Engineering December 2012 ·网络与通信· 文章编号：1000—3428(2012)24—0070—04 文献标识码：A 中图分类号：TP393 基于剩余能量和位置的LEACH 改进算法 a a b 李年琼 ，黄宏光 ，李 鹏 (四川大学 a. 电气信息学院；b. 计算机学院，成都 610065) 摘 要：在无线传感器网络中，不合理的分簇算法导致节点过早死亡、区域信息无法完全感知。针对该问题，提出一种基于剩余能量和位 置的 LEACH 改进算法。改进算法将选簇过程分为临时簇头选择和正式簇头选择两步，以传感器节点的节点剩余能量值和几何平均位置作 为选簇的重要因素，在此基础上选出区域内最佳簇头。通过 OMNET++ 网络模拟器的仿真结果表明，改进算法的节点利用率和网络可靠性 更高。 关键词：无线传感器网络；LEACH 改进算法；剩余能量；节点距离；最佳簇头 Improved LEACH Algorithm Based on Remaining Energy and Location a a b LI Nian-qiong , HUANG Hong-guang , LI Peng (a. School of Electrical Engineering and Information; b. School of Computer Science, Sichuan University, Chengdu 610065, China) 【Abstract 】In Wireless Sensor Network(WSN), unreasonable node clustering algorithm will inevitably lead to premature death, unawareness of regional information. An improved LEACH algorithm based on remaining energy and location is presented. The clustering hierarchy arithmetic divides the cluster selection process into temporary cluster head and formal cluster head, considers the nodes distance and the remaining energy as an important factor in selection then chooses the best cluster head within the region. OMNET++ simulation results show its node higher utilization ratio and network reliability of improved LEACH algorithm. 【Key words 】Wireless Sensor Network(WSN); improved LEACH algorithm; remaining energy; node distance; best cluster head DOI: 10.3969/j.issn.1000-3428.2012.24.017