基于Fiedler矢量的分布式自适应分簇算法  

Distributed adaptive clustering algorithm based on Fiedler vector

作　　者：黄庆东[1] 闫乔乔 孙晴[1] HUANG Qingdong YAN Qiaoqiao SUN Qing(School of Communication and Information Engineering Xi ’ an University of Posts and Telecommunications,Xi5 an 710121, P. R. China)

机构地区：[1]西安邮电大学通信与信息工程学院,西安710121

出　　处：《重庆邮电大学学报（自然科学版）》2017年第3期301-306,共6页Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)

基　　金：国家自然科学基金(61301091;61271276);陕西省教育厅项目(11JK0929)~~

摘　　要：针对无线传感器网络分簇(clustering)问题,提出一种基于Fiedler矢量的分布式分簇改进算法。该算法利用Fiedler矢量的元素符号特性对网络进行递归分簇处理,引入网络拓扑信息,根据网络自身的内部连接自适应决定分簇数目,通过Fiedler矢量的元素数值选出簇头,并且算法给簇头子集筛选合适的网关节点以确保簇头子集的连通性。仿真实验表明,在共识频谱感知的基础上,该算法生成的簇头子集与全网络共识所收敛的结果相同,簇头子集共识收敛速度相对更快,耗时短,能够以更好的时效性、更高的能效达到与全网络共识收敛相同的效果。To solve the problems of node clustering in the wireless sensor network, an improved distributed adaptive cluste-ring algorithm based on Fiedler vector is proposed. The algorithm utilizes the positive and negative characteristics of the Fiedler vector element to cluster recursively, and leads into the network topology information, then determining the number of clustering adaptively in line with its own internal network connections. The algorithm filters out the cluster head through the Fiedler vector element values. In addition, it adds appropriate gateway nodes for head nodes to ensure that the cluster heads set is connected. Simulation results show that on the basis of the consensus cooperative spectrum sensing, there, s lit-tle difference between the result of the cluster heads set consensus and that of the whole network consensus, but the cluster heads set consensus converges faster and gets a shorter time-consuming. It can achieve the same performance as the the whole network algorithm with better real-time performance and higher energy consumption.

关 键 词：移动AD HOC网络 Fiedler矢量 分簇算法 代数连通度 

分 类 号：TN911.23[电子电信—通信与信息系统]