Efficient and Dynamic Clustering Scheme for Heterogeneous Multi-level Wireless Sensor Networks

In this paper, an efficient and dynamic clustering scheme (EDCS) is proposed for routing problem in heterogeneous wireless sensor networks. In order to guide the process of cluster head election for a given multi-level heterogeneous network, EDCS determines the probability of node to be a cluster head through average network residual energy estimation in next round by average energy consumption forecast in ideal state and reference value of historical energy consumption simultaneously. Furthermore, analogous universal gravitation is introduced to make non-cluster head node joining cluster in terms of gravitation during cluster formation process. Simulation results have proved efficiency of EDCS. It applies more suitable than LEACH, SEP, DEEC, and EDFCM for multi-level heterogeneous wireless sensor networks (WSNs).