Research And Improvement Of Low Energy Adaptive Clustering Hierarchy Routing Protocol For Wireless Sensor Networks

Wireless sensor network,a new information acquisition, processing and transmission technology,was formed by the combination of embedded calculation,sensors,network and wireless communication technology.The wireless sensor network is widely applied in commercial,military,medical and environment monitoring fields,because it is flexible and convenient.As a new area of research of modern communication technology,wireless sensor networks attracted the industry and academic attention.The wireless sensor network consists of a large quantity of sensor nodes whose power,calculation ability and bandwidth are so limited that traditional wireless routing protocol is not suitable for wireless sensor network.Designing routing protocol of WSN is the main work of this dissertation.The number of sensor nodes in WSN is numerous and single node is extraordinarily limited in resource.The all-important aim of designing routing protocol of WSN is to reduce the overall energy dissipated in the network and to maximize the network lifetime.The paper analyzes the hardware framework,the network protocol structure,different taxonomy and some routing protocols,and assimilates excellent ideas of LEACH to propose a new routing protocol named fixed area-based clustering algorithm(LEACH-N).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 density of Around the node, and builds routing tree among cluster heads,among which only the root node communicates the base station directly.Finally, this paper simulated the new algorithm using Glomosim. Simulation results show that the algorism performs better than LEACH and Static-Clustering In the aspects of network survival time,system scalability and adaptability of the network size.