无线传感器网络TBCCA树形分簇算法

针对当前无线传感器网络分簇和拓扑控制算法中存在的问题,例如能耗过大、负载不均、计算复杂性高和存在额外开销等,提出了一种新型的TBCCA(tree-based clustering construction algorithm)分簇算法.该算法基于正三角形簇树结构,并利用RSSI(received signal strength indicator)值控制簇半径,从而产生3类集合--Near集、Common集和Medium集,及其相应的选择策略.其后,根据树的度数和结构,设计了簇树的建立算法.性能分析和实验仿真表明,相对于现有的几种算法,例如TopDisc和DLMST等,TBCCA算法具有较低的计算复杂性;与Leach协议和HEED协议相比,该算法能在保证较高连通性与覆盖率的同时,有效节约能量,均衡负载,延长网络的生命周期.

A Tree-Based Clustering Construction Algorithm (TBCCA) in Wireless Sensor Network

Aimed at the disadvantages on current clustered and topology control protocols in distributed wireless sensor network (WSN), such as high energy cost, non-balanced communication overhead, unsatisfactory computational complexity and extra consumption, etc., a novel tree based clustering construction algorithm (TBCCA) is presented. Firstly, it provides some premises and definitions about topologic model such as area radius, cluster radius and reachable adjacent domain, etc. Based on isosceles triangle clustered-tree structure, it proposes clustering strategy according to three types of threshold sets called near set, common set and medium set, and cluster radius controlled by RSSI (received signal strength indicator) value between neighboring nodes. Detailed procedures which contain cluster head selection and determination of candidate nodes are described in this paper, where some theorems about topology & coverage are in proof, and several optional strategies are provided in terms of different requirements on price of computation or communication. Performance analysis and simulation results illustrate that TBCCA has advantage over some existing algorithms in computational expense, for instance, TopDisc or DLMST; And compared with Leach protocol and HEED protocol, TBCCA is energy-efficient and energy-balanced, and expands the life-time of network while lower complexity, higher coverage and connectivity is guaranteed.