Research Of Energy Saving Routing Algorithm For Wireless Sensor Networks

Wireless sensor networks (WSN) is a new kind of information acquirement technology developed by the accompany of micro-electronics technology, embedded technology, wireless communication and sensor technology. From its original development in20th century90years to now, it has obtained widely applications in the military, environment, health, family and other commercial areas. However, wireless sensor network nodes is powered by batteries, the capabilities of its communications and data processing are severely constrained. In order to make a longer survival time of the entire network, designing an energy efficient routing protocol is a major subject in current research.Firstly, the paper introduces the research background of the wireless sensor network, and the status of domestic and foreign research. Then the structure, features and classification of routing protocols of wireless sensor network are analyzed, which introduces representative routing protocols of plane routing and hierarchical routing separately, and compare their characteristics.In the plane routing for wireless sensor network, the communication path from source node to destination node is studied, and the existing particle swarm optimization and ant colony optimization algorithm are analyzed. With the merits of two algorithms, the discrete particle swarm-ant colony optimization is proposed, which is better for wireless sensor network plane routing protocols. First, because the searching speed of particle swarm algorithm is fast, make the particle dispersion, and find the distribution of the initial pheromone for ant colony algorithm. Then use the characteristic of high accuracy in ant colony algorithm to look for the best path routing. Because of the low number of iterations and the shortest communication path, the new algorithm saves nodes energy consumed in communication and extends the lifetime of the network.In the hierarchical routing for wireless sensor network, the Energy-Efficient Uneven Clustering (EEUC) protocol is studied, and the issues of uneven energy consumption is analyzed. On the improvement of the EEUC algorithm, Energy-Efficient Optimal Distance Clustering (EEODC) protoco is proposed. New algorithm introduces two concepts that are communication distance threshold and tree routing, which makes cluster head communication distance to be control within a certain range. It forms a tree that root is the base station and leaves are the cluster head. Within the cluster, one hop communication is adopted, multiple hops communication is adopt among the cluster head. The cluster heads sent the data to the base station according to the tree structure. New algorithm can solve the excessive energy consumption of the cluster heads, extend the lifetime of the network.Finally, the new proposed algorithm is simulated and analyzed. By compared with the original algorithm, the superiority of the new algorithm is proved.