一种基于时间延迟机制的分布式成簇算法研究

A Distributed Delay-Based Clustering Algorithm for Wireless Sensor Networks

无线传感器网络能够在恶劣的环境下获取大量详实而可靠的信息,可以广泛应用于国防军事、工业控制、环境监测、交通管理、医疗保健、智能家居等各个领域.但是,传感器节点一般只靠电池供电,有效的利用传感器节点的能量是传感网络通信协议设计的重要目标.提出了一种基于定时器策略的具有能量效率的分布式成簇算法,称为LEACH-T算法.该算法主要包括两部分内容:一是簇头选择时引入定时器策略,使得能量较大的节点具有更高的概率成为簇头;二是引入竞争机制,使得簇头均匀分布,进而能有效平衡簇头节点的能量使用情况;三是构造了基于能量和距离的花费函数以平衡节点的能量效率.理论和仿真结果均说明该算法优于LEACH,生命周期比LEACH延长达到40%.

In the paper, we consider a network of energy constrained sensors deployed over a region. Each sensor node in such a network is systematically gathering and transmission sensed data to a base station （via clusterhead） for further processing. This paper focuses on reducing the power consumption of wireless microsensor networks. The core has three points. Firstly, we extend LEACH＇s stochastic clusterhead selecting algorithm by a factor timer-based deterministic component to reduce energy consumption （called LEACH-T）. Secondly, a competing mechanism is introduced to make the distribution of the clusterhead be even. Lastly, a cost function is proposed so that it balances energy consumption of nodes. Simulation results show that our modified scheme can extend the network life around up to 40% for First Node Dies（FND）. Through both theoretical analysis and numerical results, it is shown that the proposed algorithm achieves better performance than the existing representative methods.