无线传感器网络动态κ值簇头选择方法  

Cluster head selection method using dynamic κ value for wireless sensor networκ

作　　者：吴黎兵[1,2] 杜锦[1] 聂雷[1] 谢永[1] 

机构地区：[1]武汉大学计算机学院,湖北武汉430072 [2]武汉大学软件工程国家重点实验室,湖北武汉430072

出　　处：《华中科技大学学报（自然科学版）》2015年第10期37-41,47,共6页Journal of Huazhong University of Science and Technology(Natural Science Edition)

基　　金：国家自然科学基金资助项目(61272112;61472287);湖北省科技支撑计划基金资助项目(2013BAA004);武汉市科技攻关应用基础资助项目(20130105010122)

摘　　要：在低功耗自适应集中分层协议(LEACH-C)基础上,提出了基于LEACH-C的能量均衡路由算法(LEACH-EB),该算法采用1轮全局分簇和κ轮局部簇头更新的方式,以达到进一步延长网络生命周期的目的.鉴于采用固定的κ值时传感器网络难以获得最佳性能,分析了不同κ值下的网络性能,提出一种基于LEACH-C的动态κ值簇头选择方法 LEACH-CK.其核心思想是每次全局分簇后,结合当前分簇情况和节点剩余能量计算出一个较优的κ值.OMNeT++(面向对象的离散事件网络模拟器)仿真结果显示:LEACHCK可以有效推迟网络中第一个节点死亡的时间,同时网络具有较好的稳定性.LEACH-EB（energy-balancing routing algorithm based on LEACH protocol）was put forward based on LEACH-C（low energy adaptive clustering hierarchy-centralized）.In every period,it divides the structure of network in the first round and updates the cluster heads in the next krounds with network′s structure unchanged.By this way,it can improve the performance of network further.However,the network is difficult to obtain the best performance by using the fixed κ.The performance of network was analyzed under different values of kand a cluster head selection method using dynamic κ value based on LEACH-C was proposed.Its core idea is calculating a better kvalue based on the structure of network and nodes′current residual energy after dividing the structure of network every time.The simulation on OMNeT＋＋（objective modular network testbed in C＋＋）shows that LEACH-CK can obviously delay the time of the first node′s death.At the same time,the stability of network is improved.

关 键 词：无线传感器网络 路由协议 分簇 簇头选择方法 动态k值 

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