Distributed Dynamic Clustering Algorithm in Uneven Distributed Wireless Sensor Network

Abstract — We propose a distributed, light weight, scalable clustering algorithm for clustering in wireless sensor networks (WSN). The clustering algorithm is suitable in an environment where sensors are deployed randomly. The clusters are dis-tributed over the deployment and are not necessarily of the same size in terms of the number of nodes in a cluster. The actual sizes are governed by the radius of the radio signal range. Cluster formation allows each node to join only one cluster. Each cluster head can either communicate with other cluster head directly or through an intermediate member node. Each cluster thus formed can communicate with the base station through an overlay network of cluster heads and intermediate nodes in between. We show that the clustering algorithm converges fast independent of the number of nodes deployed. We analyze the performance of clustering algorithm using simulation. Results show that very few nodes (less than 5%) are not able to join a cluster (or remain orphan); many are isolated due to random deployment and communication range limitation