无线传感器网络中一种层次分簇算法及协作性分析

无线传感器网络是传感技术、计算技术和通信技术的融合.由于传感器节点的能量限制,能量有效性是设计无线传感器网络所关注的一个主要内容,并且已成为一个最大的挑战.提出了一种网络拓扑算法--一种动态、能量有效的层次分簇算法(DEEH).与其他算法不同,该算法无须知道传感器节点的任何本地信息.该算法可应用于更实际的大规模无线传感器网络,如节点具有不同的能量等级、不同的传输半径.将DEEH算法与经典的分簇算法LEACH相比较,仿真结果表明:当网络节点密度很大时,DEEH优于LEACH.同时,还考虑了网络中存在自私节点的情况,并分析了自私节点对网络分簇所带来的影响.在DEEH算法中引入机制设计理论,以克服网络中自私节点的影响.实验结果表明:采用机制设计理论,自私节点的占优策略真实地报告它们的能量.这一策略延长了网络的寿命,保证了拓扑结构的稳定性.

A Hierarchical Clustering Algorithm and Cooperation Analysis for Wireless Sensor Networks

Wireless sensor network combines sensing, computation and communication. Due to limited energy,energy efficiency of sensors is a main concern and a most challenging task for the design of wireless sensor networks. This paper proposes a novel algorithm for network topology, namely Dynamic Energy-Efficient Hierarchical clustering algorithm (DEEH). Different from others, DEEH need to know any local information of sensors. The algorithm can be applied to real large-scale sensor networks in which the sensors have different energy levels and different transmission radius. Compared with the classical clustering algorithm LEACH (Low-Energy Adaptive Clustering Hierarchy), the algorithm is better when the nodes are densely distributed. This paper also considers the selfishness of nodes and analyzes its impact, and introduces a trustful mechanism design that is applied to the algorithm. Under this mechanism, the dominant strategy of selfish nodes is to report their energy truthfully. This strategy can prolong the network lifetime and improve the stability of the network topology.