WSN中动态分簇时间同步算法的研究

Research on Time Synchronization Algorithm Based on Dynamic Clustering in Wireless Sensor Networks

提出了一种动态分簇时间同步算法(DCTS),首先针对无线测距网络的特点,传输数据量较少,簇首节点无需进行大量数据融合情况下,对LEACH分簇路由算法进行改进,提出了GLEACH分簇路由算法,并使用GLEACH分簇路由算法将整个网络分成不同的簇,以基站与簇首节点为参考节点,采用类似于TPSN双向同步机制,逐级同步,实现全网的时间同步,结合了动态分簇算法,均衡了整个网络的功耗,克服了TPSN算法中参考节点负担过重,而导致某些节点过早的死亡,实验结果表明,新的同步算法有效的提高了整个网络的生存时间与同步精度。

This paper proposed a dynamic clustering time synchronization algorithm.First of all,for the characteristics of wireless networks ranging which the data in the network is not too much and the cluster head node not need to fusion the data in the network,it improves the LEACH algorithm,proposes a GLEACH algorithm and divides the whole network into different cluster using GLEACH algorithm.Take the base station and the cluster head node as reference nodes and use the Two-way synchronization mechanism similar to that of TPSN algorithm,step by step,to achieve full network time synchronization.Meanwhile it combines the Dynamic Clustering Algorithm,to balance the consumption of the whole network power and overcome the overload of TPSN reference nodes,resulting in premature death of certain nodes.Finally,the results show that this coordinated algorithm can prolong the lifetime of network and improve the synchronization accuracy.