Routing Algorithm of Uneven Clusters Based on Divided Virtual Region

Because there are two problems which are on the basis of cluster routing protocol which with multi-hop in the wireless sensor network, one is ¿hot spot¿, the other is the replacement mechanism of cluster head. This paper proposes a routing algorithm of uneven clusters based on divided virtual region. Of course the clustered routing mechanisms have been studied extensively in the literature. The main idea of this algorithm is that the task of dividing cluster is handed over to the sink node which is unlimited energy completed, making the size of inner cluster smaller than the outer cluster. The task of cluster head is finished by main and assistant cluster head in this cluster. The ARMA prediction model is applied into the main cluster head nodes, which avoids the main cluster head death because of energy depletion. The results of simulations in NS2.27 show that the new mechanism has prolonged the lifetime of WSN compared with traditional mechanism.