A Routing Based on Dynamic Tree Algorithm in WSNs

Abstract

Wireless sensor networks are widely used in different fields. Because of its distinguished characteristics, we must take account of a factor of energy consumed when designing routing protocol. The routing protocols of the wireless sensor networks have mainly two types: flat routing protocol such as directed diffusion and SPIN, and hierarchical routing protocol such as LEACH and its variations. In this paper, we present a routing based on dynamic tree for solving LEACH problems of both scalability and uneven distribution of cluster-heads. The simulation proves that the algorithm is able to solve these problems.