Research On Energy Efficient Clustering Route Protocol In Wireless Sensor Network

Wireless sensor networks(Wireless Sensor Networks,WSN)is a kind of distributed network,which is composed of a large number of cheap micro-sensor nodes deployed in the monitored area.All those nodes form a self-organizing ad-hoc network via wireless communication.By using the cooperative communication,the WSN is able to sense,collect and process the target information of coverage area,and finally send back to the information demander.In recent years,the application of wireless sensor networks is more and more widely used in different fields.How to improve the system energy utilization,balance the nodes' energy consumption and prolong the network life cycle has always been a key challenge issue.Routing protocol plays an important role in network node's energy consumption,and also the whole network system implementing performance.Therefore,how to design high efficient clustering protocols and algorithms is significant in both academy and industry.In this thesis we mainly study the energy efficiency of the route protocols in wireless sensor networks.After the detailed discuss and analysis on the existing various kinds of typical wireless sensor network routing protocol,we choose the most representative clustering based hierarchical routing protocol as the main research object.The basic running principle and working mechanism of the hierarchical routing protocol is presented in detail,and its implementing performance is also analyzed and summarized.Our main contribution includes the proposed schemes and algorithms in improving the node energy utilization and prolonging the network life cycle,and relevant works are specified as follows:(1)We propose an energy efficient routing algorithm(LEACH-ASH)which jointly considers node's location distribution and node's energy status.Note that due to the randomness of LEACH algorithm in the cluster head selection,it may result in the unbalanced distribution of cluster heads.In this regarding,we designed a new clustering scheme with the consideration of the two factors including network node density and node energy for cluster head selection.What's more,different from the fixed mode in the number of cluster head selection,we propose an algorithm to adaptively compute the cluster head figures.The algorithm ensures that the selected cluster head nodes hold a high node energy and their location distribution is morereasonable,and also helps to to form a more effective cluster structure.The theoretical analysis and simulation result shows that the LEACH-ASH algorithm can reduce the total energy consumption of the network,balance the energy consumption between nodes,and improve the life cycle of the network.(2)We put forward a kind of suitable for sensor networks routing algorithm(LEACH-EOH),it is based on communication costs.This algorithm in view of the distance between the node and base station,not only consider how to shorten the path of the data transmission,but also consider the choice of node energy in the process of data transmission.By combinating with the node energy consumption in the process of data transmission and energy distribution problem,we put forward the communication cost expression.The algorithm based on the information to calculate the neighbor node communication cost,choose the neighbor node with the minimum communication cost as the next-hop node.The algorithm can optimize the energy consumption and has lower computational time complexity.