基于最低能耗路径的分簇路由算法  

Clustering Routing Arithmetic Based on Minimum Energy Consumption Path

作　　者：洪刚[1,2] 汤宝平[2] 裴勇[2] 

机构地区：[1]长江师范学院数学与计算机学院,重庆408001 [2]重庆大学机械工程学院,重庆408030

出　　处：《计算机仿真》2012年第10期177-180,共4页Computer Simulation

基　　金：国家自然科学基金资助项目(50875272);长江师范学院校内支持项目(2011cjsky048)

摘　　要：研究无线网络能耗优化问题,在无线传感器网络中,由于网络生存电池容量有限,为减少系统能耗、延长网络生存时间,提出一种最低能耗路径的无线传感器网络分簇路由算法(MECP)。在分簇阶段节点采用和LEACH相同的选举机制竞选簇首。簇间通讯阶段通过构造簇首和基站的加权图,用改进的加权图的最短路径算法选择每个簇首到基站的最低能耗路径。簇首采用多跳方式与基站通信,减少了每一轮簇首数据传输的能量开销,同时保证了簇首负载均衡。实验结果表明,改进方法是有效的,为网络的生存时间和节点能量均衡等性能的改善提供了依据。In wireless sensor networks,to extend the network lifetime by reducing energy consumption,this paper presented a clustering routing arithmetic based on minimum energy consumption path（MECP）.A weighted graph was built to select the minimum energy consumption path from every cluster head to base station by improved shortest-path arithmetic.It reduces the quantity of cluster-head communicate with the base station by multi-hop in each round,and keeps the balance of cluster head＇ load.Simulation results show that the MECP outperforms LEACH in terms of lifetime and node＇s energy consumption.

关 键 词：无线传感器网络 最低能耗路径 多跳通信 生存时间 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]