Study On Hierarchy Routing Protocol Of Wireless Sensor Network

Wireless Sensor Network (WSN) has been considered the most important technology in21st century by national military departments, industry and academia. It is one of the most important ways to provide information service for human. WSN was constituted by hundreds or thousands of sensor nodes and these nodes are usually randomly distributed in certain circumstance. Each node collects information by its own sensing unit, and transfer information, which is processed by its own processor, to the receiver. Compared to traditional wireless network, WSN has the advantage of low cost, needless of infrastructure, high dynamic network topology adaptive, etc. It has been widely used in military, environment monitoring, healthcare, traffic management, intelligent furniture, space probe and so on.The main researches of this paper are the followings:1. Illustration of the background of WSN, trends of the network development, and the meanings of the study on router protocols.2. Introduction to WSN concept, system structure, main features, key technologies and applications.3. Introduction to routing protocols of WSN, and classifying these protocols. Descriptions of each traditional routing protocol, and make comparatively analysis.4. Analysis on LEACH protocol in detail, and introducing3traditional improved protocols based on LEACH. Come up with an improved routing protocol BEAC, which allows for residual energy and location information of sensor node while choosing cluster nodes. Through experiments, which are implemented by the comparison between BEAC and LEACH protocols, it shows that network stability has been improved by22%.5. Proposes a new algorithm TL-WCA (two levels-Weighted Clustering Algorithms) which is implemented by using optimized weight while choosing tow-level cluster head. This algorithm divides the network into several clusters according to the LEACH algorithm; the cluster heads are chosen by factors of residual energy of the nodes, degrees and centered distance of the cluster. Then the cluster heads are formed into a chain in principle of greedy algorithm. At last the senior head is formed. All data of cluster heads are converged and transferred to the base station. This algorithm can maintain the energy equilibrium of nodes in cluster and cluster head. This paper uses MATLAB to simulate the TL-WCA algorithm and make the comparisons of LEACH, GSEN, LEACH-C (A Centralized Low Energy Adaptive Clustering Hierarchy), and results show that, TL-WCA has obvious advantage over LEACH, GSEN, and LEACH-C in energy consumption and network lifetime.Finally this paper summaries the disadvantage of TL-WAC, brings forward its improvable directions, and forecasts the bright future of the wireless sensor network.