The Research On Routing Algorithm Of Adjacent Clusters Based On Any-cast

Wireless sensor network consisting of a large number of small sensors with low-power transceiver can be an effective tool for gathering data in a variety of environment. The collected data must be transmitted to the base station for further processing. A large number of sensors, whose energy are offered by battery, are deployed to sense the environments. Since a network consists of sensors with limited battery energy, the method for data gathering and routing must be energy efficient in order to prolong the life time of the network.LEACH is an elegant energy efficient protocol to maximize the lifetime of sensor network. Starting from the basic idea of LEACH, this dissertation introduced a Routing Algorithm of adjacent Clusters based on Any-cast, which can be used in wireless sensor network. This algorithm requires location information of all nodes of the network. It clusters nodes into group. The areas of clustering are determined and fixed by the base station. The algorithm rotates cluster heads based on the energy of nodes and the cost, The head node is adopted and formed a cluster one is jumped and communicated with the base station more to form a cluster.Finally, this dissertation simulated the new algorithm using NS-2.Simulation results show that the algorism performs better than LEACH in economize on energy and load balance.