Researches On Energy Efficient Routing Algorithm In Wireless Sensor Networks

Wireless Sensor Network (WSN) is a novel technology about acquiring and processing information.It is made by the convergence of sensor, nested computation,networks and wireless communication technologies. It can be defined as an autonomous, ad hoc system consisting of a collective of networked sensor nodes designed to intercommunicate via wireless radio. Wireless Sensor Networks had been applied in a lot of scenarios and situations. Both academia and industries have shown great interesting Wireless Sensor Network.Wireless senor network differs from traditional wireless network in several ways: severe energy constraints,redundant low-rate data, many-to-one flows.The main capability of Wireless sensor networks is energy efficient. On the basis of the analysis of energy management of WSN, sensing data, data processing and radio communication are the main consumers of sensor's energy. The radio communication is the major consumer of energy. Although energy efficiency can be improved at various layers of the communication protocol stack, however, due to fundamental physical limitations, progress towards further energy efficiencv is expected to routing protocol.In this paper, the issues of the energy efficiency routing protocols of wireless sensor network are discussed.Based analysis of the routing protocols of wireless sensor network,this paper designs three independent routing protocols through considering network lifetime such as Data Aggregation Tree based Energy Efficient routing protocol,Multi-Hop Energy Efficient Clustering routing protocol and Distibuted Low Energy Clustering routing protocols.The two kinds of routing protocols are based on different application.The last is proposed on energy heterogeneous net-work..Furthermore,in order to testify the capability of our work,the NS-2 for validation for the function and investigation of the perfirmance are used.The main research works and results are listed as follows:1.Implement the detail performance analysis between existing routing protocol in wire- less sensor networks.Based on sensitive degree in different application wireless sensor networks ,the existing routing protocols are stapled and analyzed in detail.The routing protocols based on hierarchy of energy efficiency which are better than other protocols balance total energy of sensor networks and increase lifetime of networks through existing routing protocols of compare.2.Put forward a based on data aggregation tree energy efficient routing algorithm (DATEE algorithm) for wireless sensor networks.The shortest path routing of multicast is applied on wireless sensor networks routing,which contructed a data aggregation tree.The algorithm always selects a longest and sharable shorted path when the shorted path possibly lies in some paths between source node and some node.The source nodes detect interested data,which are transferred to sink node through the constructed tree.The NS-2 simulation results indicated the algorithm successfully adapts the change of topology because nodes invalid or move in wireless sensor networks.At the same time the performance of average energy,lifetime and delay are better than LEACH protocol.3.Put forward a multi-hop energy efficient based on clustering routing algorithm (MHEEC algorithm) in wireless sensor networks.The MHEEC algorithm which run for the cluster-heads according to current energy is proposed on hierarchy routing.The covergy of clusters are restricted on fixed scope and joined sleeping machanism for energy consume of cluster nodes.The tree constructed among cluster-heads transfers interested data to sink node. The cluster-heads transfer data to parent node afte collecting and aggregating data.constructed tree among cluster-heads avoid lots of energy consume.The NS-2 simulation results are satisfactory especially in the effect of energy and lifetime in sensor metworks.4.Put forward adistributed energy-heterogeneous clustering algorithm for heterogeneous wireless sensor networks.The DEHC algorithm for heterogeneous wireless sensor networks uses the LEACH idea of cluster-heads round.In the algorithm,cluster-heads are elected by a probability based on the ratio between current energy of node and the estimate of average energy of network.The high initial and current energy nodes will have more chances to be the cluster-heads than the low energy nodes.The NS-2 simulation results show that the clustering algorithm provides longer lifetime than the existing important clustering protocols in heterogeneous environments.The above algorithms have better capacity of routing than LEACH.In the wireless sensor networks,MHEEC possess better capacity of routing than other two algorithms and existing routing protocol,such as decrease total energy and energy consume of nodes and so on.In heterogeneous wireless sensor networks,DEHC have better capacity of routing than other two algorithms and existing heterogeneous wireless sensor networks routing protocol.In the same, DEHC have self-adaptive trait in the heterogeneous networks.