A dynamic clustering algorithm based on polymerization proceeds for wireless sensor networks

With limited resources, wireless sensor networks usually use clustering aggregation to decrease traffic. This paper proposes a dynamic clustering algorithm based on aggregation gains. Firstly, we present a non-linear integer programming model for the overall energy consumption of the network optimization problem, and then propose a low complex and near optimal heuristic cluster head election algorithm. A dynamic clustering algorithm is proposed based on aggregation gains, which can elect the cluster head in a distributed way. Theoretical analysis and experimental results show that the proposed dynamic clustering algorithm can resolve the load balance problem, improve the network energy efficiency, and prolong the network lifetime.