无线传感器网络LEACH簇树路由协议研究  

A LEACH Cluster Tree Network Routing Protocol Research for WSN

作　　者：孙柳林[1] 郭建丁[1] 邓建良[1] 

机构地区：[1]重庆大学通信工程学院,重庆400044

出　　处：《北京联合大学学报》2011年第2期24-27,37,共5页Journal of Beijing Union University

基　　金：863国家重点基金项目(2008AA01Z202);重庆大学研究生科技创新基金(CDJXS10160006)

摘　　要：基于LEACH的簇树路由协议是目前无线传感器网络研究的热点之一,由于传统的构造最小生成树的算法不能适应网络中节点密度的变化,制约其更广泛的应用。在对LEACH簇树路由和传统的连通网络中构造最小生成树算法的分析基础上,结合动态优化的思想,提出了一种新的基于Prim算法的构造最小生成树算法,并将其应用到簇树路由中,使得网络寿命延长,同时增强了对网络节点密度的适应性。仿真结果说明了该算法的可行性和有效性。At present,clustering algorithm based on LEACH is one of the hotspots in the study of wireless sensor networks.However,the traditional algorithm of constructing MST（minimum spanning tree） cannot adapt to the change of node＇s density in networks,so their application is constrained.The LEACH cluster tree routing and the traditionally constructed minimum spanning tree algorithm based on the connected network is studied,and an improved structuring of Prim minimum spanning tree algorithm is explored.The application of it to cluster tree routing not only extends the network life-span,but also adapts to the node＇s density in the networks.Simulation results has demonstrated the feasibility and efficiency.

关 键 词：无线传感器网络 动态优化 最小生成树 LEACH簇路由 

分 类 号：TN926[电子电信—通信与信息系统]