基于动态分簇的低开销WSNs时间同步协议研究

Research on low-overhead time synchronization protocol of WSNs based on dynamic clustering

时间同步是无线传感器网络(W SNs)的重要支撑技术。现有的同步协议RBS,TPSN与CHTS等较多考虑的是平面网络或是如何提高时间精度问题,带来了较大的能耗。在充分考虑了W SNs与能耗有限的特点的基础上,提出了一种基于动态分簇的低开销同步协议。该算法利用LEACH协议进行簇首节点的选择,簇成员节点的选择采用广度优先生成树拓扑结构。时间同步分为参考节点与簇首间的同步和簇首与簇内成员间的同步2个阶段,综合了单向同步和双向成对同步技术。性能分析和实验结果表明:该算法减少了同步开销,提高了精度,适用于W SNs。

Time synchronization is an important support technology of wireless sensor networks （WSNs）. About the existing protocols such as RBS,TPSN and CHTS, more consideration are taken to the time accuracy and planar network,which bring larger energy consumption. An low-overhead time synchronization protocol of WSNs based on dynamic clustering is implemented, fully taking characteristics of WSNs, such as network topology and limited power into account. The algorithm uses LEACH protocol to select the first node, topology of breadth-first spanning tree is implemented to choose the members of cluster. Time synchronization is divided into two parts, and colligates one-way broadcasting and two-way paired technology. The performance analysis and experimental results both show that this time synchronization algorithm can reduce synchronization consumption and improve the precision, so can be used to WSNs.