%0 Journal Article %A CHEN Bin %A CHEN Weixing %A LIU Qingtao %A SUN Xixi %T Fast convergence average TimeSynch algorithm for apron sensor network %D 2020 %R 10.11772/j.issn.1001-9081.2020030290 %J Journal of Computer Applications %P 3407-3412 %V 40 %N 11 %X The traditional Average TimeSynch (ATS) for APron Sensor Network (APSN) has slow convergence and low algorithm efficiency due to its distributed iteration characteristics, based on the principle that the algebraic connectivity affects the convergence speed of the consensus algorithm, a Fast Convergence Average TimeSynch (FCATS) was proposed. Firstly, the virtual link was added between the two-hop neighbor nodes in APSN to increase the network connectivity. Then, the relative clock skew, logical clock skew and offset of the node were updated based on the information of the single-hop and two-hop neighbor nodes. Finally, according to the clock parameter update process, the consensus iteration was performed. The simulation results show that FCATS can be converged after the consensus iteration. Compared with ATS, it has the convergence speed increased by about 50%. And under different topological conditions, the convergence speed of it can be increased by more than 20%. It can be seen that the convergence speed is significantly improved. %U http://www.joca.cn/EN/10.11772/j.issn.1001-9081.2020030290