一种基于最小生成树的非均匀分簇路由算法  

Uneven Clustering Routing Algorithm Based on Minimum Spanning Tree

作　　者：陆晶[1] 马悦[2] 吴晓军[1,2] 

机构地区：[1]西北工业大学自动化学院,西安710072 [2]陕西师范大学计算机科学学院,西安710062

出　　处：《小型微型计算机系统》2012年第10期2293-2296,共4页Journal of Chinese Computer Systems

基　　金：国家自然科学基金面上项目(11172342)资助;教育部"新世纪优秀人才支持计划"项目(NCET-11-0674)资助;陕西省自然科学基金项目(2012JM8043)资助

摘　　要：分簇式路由是无线传感器网络路由协议研究的重点,本文提出一种新的基于最小生成树的非均匀分簇路由算法,该算法利用EECS路由协议产生大小非均匀的簇,簇内结点通过单跳的方式将数据发送给簇首结点,所有簇首结点构成最小生成树路由网络,并通过树内结点的多跳通信,最终将数据发送给sink结点.实验证明,本文算法与EECS相比能够更加有效地降低整个网络的能量消耗,延长网络的生命周期.As an active branch of routing technology in wireless sensor network,this paper proposes a kind of uneven clustering routing algorithm based on minimum spanning tree.The proposed algorithm utilized EECS routing protocol to produce size non-uniform cluster,a cluster nodes sent the data to cluster head through a single jump.Then this algorithm constructs minimum spanning tree routing network including all the cluster head nodes,and will eventually sent the data to sink through the nodes of the tree by the more jumping communication.Experiments show that the proposed algorithm can reduce the whole energy consumption of the network more effectively and prolong the lifecycle of the system when compared to the EECS.

关 键 词：分簇 最小生成树 无线传感器网络 

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