无线传感器网络的重叠分簇与边界搜索  

Overlapping clustering and boundary search of wireless sensor networks

作　　者：廖鹰[1,2] 齐欢[1] 李伟群[1] 

机构地区：[1]华中科技大学控制科学与工程系,湖北武汉430074 [2]解放军信息工程大学理学院,河南郑州450001

出　　处：《系统工程与电子技术》2011年第11期2506-2511,共6页Systems Engineering and Electronics

基　　金：国家自然科学基金(60774036);湖北省自然科学基金重点项目(2008CDA063);中央高校基本科研业务费专项资金(C2009Z025Y)资助课题

摘　　要：无线传感器网络(wireless sensor networks,WSNs)由大量微小的传感器节点组成,分簇的网络架构能较好地处理大规模网络的自组织问题,因而成为WSNs提升性能和扩展性的标准方法。在拓扑发现、地理路由和目标追踪等应用中,重叠分簇能更好地满足要求,同时,辨别出WSNs的边界节点是重要的任务。与先前的基于节点的边界搜寻算法不同,提出了一种应对节点随机分布情况的自组织分簇算法。建立了重叠分簇,进而对重叠分簇进行分簇的边界融合,最后形成整个WSNs网络边界。仿真结果表明,该算法能够生成更为均衡的分簇,显著提高网络生存周期,并能有效的实现网络边界节点的搜索。Wireless sensor networks （WSNs） consist of a large number of sensor nodes. The clustering architecture can deal with self-organization of large-scale networks, so clustering is a standard approach to achieving efficiency and scalability. In the applications of topology discovering, geography routing, tracking and so forth, overlapping clusters are useful, and recognizing boundary nodes is important. Different from the former boundary search algorithm based on single node, a distributed self-organization overlapping clustering algorithm in a random network is proposed to generate overlapping clusters, by means of which the clusters borderline is fused to form boundary of WSNs. Moreover, the results of simulations indicate that the algorithm can construct balanced clusters, search the network boundary effectively and enhance the network survival period obviously.

关 键 词：无线传感器网络 随机分布 自组织 重叠分簇 生存周期 边界搜寻 

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