无线传感器网络初始化簇头选举算法  

Clustering algorithm in the initialization of wireless sensor networks

作　　者：郭鹏[1] 李晓霖[1] 朱光喜[1] 

机构地区：[1]华中科技大学电子与信息工程系,湖北武汉430074

出　　处：《华中科技大学学报（自然科学版）》2008年第11期13-16,共4页Journal of Huazhong University of Science and Technology(Natural Science Edition)

摘　　要：利用节点初始分布后,对无线传感器网络具有的极少确知信息,建立了初始的异步通信模型;同时给出一种简单产生临时ID号的方法,保证相互间较大概率的互异性.基于此,提出了一种有效初始簇头选举方法,通过局部比较本地ID与邻居ID,实现快速簇头选举.实验表明,该方法能在无线传感器网络初始分布的无序、空白的环境下,迅速建立起有效的簇头,完成网络初级结构的建立,为后续接入资源的分配乃至协议的应用,提供了前提.多组仿真结果表明,算法的稳定性较好,具有较强的实用性.Asynchronous communication model is set up based on the little information for the initialization of wireless sensor networks, and a simple and effective method of assigning temporary identity （ID） is given, which can assure the dissimilarity of the IDs with large probability. Then the paper proposes an effective cluster leader election algorithm through comparing the local IDs distributedly. The simulation results show that the algorithm can help to quickly and effectively elect a set of cluster leaders in the newly deployed wireless sensor networks and set up primary structure in the networks, which benefits to the subsequent application of the media access control （MAC） protocol and others protocols. And a set of tests for the same networks demonstrate the stability of the algorithm which shows its practicability.

关 键 词：无线传感器网络 通信模型 节点 初始化 簇头 选举算法 

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