An Asynchronous Clustering Algorithm for Wireless Sensor Network

In some algorithms of wireless sensor network (WSN), all cluster heads are re-elected in strict accordance with global synchronization, even if some cluster heads sending few packets have to be re-elected when the time of a round is over. Based on low energy adaptive clustering hierarchy(LEACH), asynchronous clustering algorithm is proposed in this paper. The algorithm means that after the first time of clustering re-elections of cluster heads are not in accordance with global synchronization, but in accordance with the number of packets within the cluster for real-time. In this way, the algorithm can reduce the energy of cluster heads re-electing for the clusters with few packets and so as to extend the life cycle of the network effectively.