无线传感器网络中一种有效的分布式簇划分算法  

Effective distributed clustering in wireless sensor networks

作　　者：刘琴[1] 王福豹[1] 马峻岩[1] 严国强[2] 

机构地区：[1]西北工业大学计算机学院,陕西西安710072 [2]西北工业大学软件学院,陕西西安710072

出　　处：《计算机应用》2007年第1期4-6,共3页journal of Computer Applications

基　　金：国家自然科学基金资助项目(60273009)

摘　　要：提出了一种快速有效的分布式簇划分算法,为每个节点设定一个初始时间,最先到期的节点成为簇头。考虑到簇头选举的合理性,时间衰减与节点连通度相关,并辅以随机化的方法消除时间同步对算法的影响。通过仿真验证该簇划分算法的有效性,并定量分析了通信半径与平均簇头个数的关系。Clustering is a key technology to reduce the energy consumption in sensor networks and prolong the life of the whole networks. An effective distributed clustering was proposed. In this algorithm an initial time was set for each node, and the node whose time expired first became the cluster in the network. Take reasonableness into consideration, time decay was related to the connectivity of a node. Therefore, randomized way was used to avoid the influence of synchronization. At last, the algorithm was verified in emulation and the relationship between communication radius and average number of dusters was analyzed quantitatively.

关 键 词：传感器网络 簇划分算法 连通度 时间同步 

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