The single gossip synchronization algorithm and multigossip synchronization algorithm were proposed in this paper using gossip algorithm to implement distributed time synchronization for wireless sensor networks. The two algorithms aimed to solve the problems of high computational complexity and slow convergence rate of traditional time synchronization scheme. A spanning tree was formed by using the tectonic spanning tree algorithm in the single gossip algorithm and then the gossiping was executed between the pairwise nodes of each edge in the spanning tree. The aforementioned process was repeated and the clock information of all nodes ultimately converged to the average of their original values. While in the multigossip algorithm, the edge coloring algorithm was executed to the spanning tree and the same color edge gossiped at the same time. These two algorithms decreased the number of exchange information and computational complexity and boosted the convergence rate. The proposed algorithms were verified by using the random matrix theory and graph theory. Computer simulations were also conducted to show the validity of the theoretical results.