An Unequal Clustering Algorithm in Wireless Sensor Networks Based on Traffic Prediction

Wireless sensor networks are composed of a large number of sensor nodes that are densely deployed inside the phenomenon. An unequal cluster of routing algorithm is proposed based on divided virtual region for “hot spot” in clustering routing protocol with many jumps in the wireless sensor network. The routing algorithm gives the task of dividing clusters to the sink node with non-limited energy, such that the scale of inside cluster layer near the sink node is smaller than that of outer layer cluster. To realize the distributed election work of cluster head and avoid energy consumption in each wheel, main and vice cluster head is taken into the structure of clusters. The Markov forecast model is used to the replacement process of main cluster head. Thus, both the death of main cluster head due to exhausting energy completely and the network division because of the death are avoided. The life of the network is also reduced. Using the NS2.26 platform to simulate the proposed algorithm, the result indicates that compared with the traditional routing algorithm, this routing algorithm can prolong the life of WSN and enlarge the survival node number of WSN.