Dynamic Clustering Algorithm with Balanced Load in Wireless Sensor Networks

Since sensor nodes in wireless sensor networks (WSNs) are always randomly distributed, it is hard to cluster the network with balanced load, especially for the environment where sensor nodes´ locations are easily changed. In this paper, we introduce a new scheme named dynamic clustering algorithm with balanced load (DCBL). It can not only cluster the network into a topology with balanced load and proportional spacing, but also well maintain these features by re-clustering automatically when nodes move out of their clusters. In this scheme, we take four steps to achieve the goal. They are random voting, iterative voting, corner management and network maintenance. Result of experiment has shown that DCBL algorithm can achieve better performance in several different aspects.