| 基于全局信息的LEACH协议改进算法 |
| |
| 引用本文： | 徐劲松,杨庚,陈生寿,王江涛. 基于全局信息的LEACH协议改进算法[J]. 南京邮电大学学报(自然科学版), 2009, 29(4): 55-63 |
| |
| 作者姓名： | 徐劲松 杨庚 陈生寿 王江涛 |
| |
| 作者单位： | 1. 南京邮电大学通达学院,江苏,南京,210003;南京邮电大学,计算机学院,江苏,南京,210003
2. 南京邮电大学,计算机学院,江苏,南京,210003 |
| |
| 基金项目： | 国家自然科学基金，江苏省高校自然科学基金，江苏省"六大人才高峰" |
| |
| 摘 要： | 传统LEACH协议在选举簇头节点时,采用动态簇头选举算法,每轮选举产生簇头节点个数为最佳簇头数的概率并不是最大,使得每轮选举的簇头数偏差较大,不能使节点能量达到最优化.针对这一问题,提出了改进的LEACH-P协议,该协议在簇头选举阶段通过簇头节点间的相互协作,以少量的能量消耗来获取全局信息,消除了LEACH协议簇头选举算法的盲目性,从而改善簇头选举算法.实验结果表明,LEACH-P协议相比传统LEACH协议有效地节省了节点能量,延长了网络生命周期.
|
| 关 键 词： | 无线传感器网络 LEACH协议 簇头选举算法 |
A Global Information Based Protocol for LEACH Improvement |
| |
| XU Jing-song,YANG Geng,CHEN Sheng-shou,WANG Jiang-tao. A Global Information Based Protocol for LEACH Improvement[J]. JJournal of Nanjing University of Posts and Telecommunications, 2009, 29(4): 55-63 |
| |
| Authors: | XU Jing-song YANG Geng CHEN Sheng-shou WANG Jiang-tao |
| |
| Affiliation: | XU Jing-song1,2,YANG Geng2,CHEN Sheng-shou2,WANG Jiang-tao21.Tongda College,Nanjing University of Posts , Telecommunications,Nanjing 210003,China2.College of Computer,China |
| |
| Abstract: | In traditional LEACH protocol,dynamic cluster head election algorithm was used in the phase of cluster head election.The number of cluster heads elected in every round is not optimal due to the irrational probability for every node elected itself to be cluster-head.The deviation among the numbers of cluster head in each round was much more bigger,this can not optimize the energy consume of sensor nodes.This paper proposes the LEACH-P protocol to resolve this problem.It makes use of cooperation of the nodes ... |
| |
| Keywords: | wireless sensor network LEACH protocol cluster head election algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
