Research Of Wireless Sensor Network Routing Protocol And Localization Technology

With the development of the technology of Microelectronics Technology, Embedded Computing and Wireless communication, wireless sensor networks rapidly develop. Sensors, sensing and the observer become three main elements of wireless sensor network. Application of wireless sensor network is very broad, such as military, urban transportation, environmental monitoring, building monitoring and airport. Wireless sensor nodes generally are randomly sown. Nodes are usually powered by battery. Node energy, bandwidth and calculation ability are so limited, and do not know the location of the node. Therefore, the routing protocol and self-localization technology are the focus of the wireless sensor network research topics.The paper firstly introduces the architecture of wireless sensor networks. Secondly the key issues of routing protocol design and self-localization technology are introduced. Thirdly the classification and principles of the typical existing routing protocol and localization protocol are summarized. Typical routing protocols have SPIN(sensor protocol for information via negotiation), DD(DD, Directed Diffusion), LEACH (Low-Energy Adaptive Clustering Hierarchy), PEGASIS(Power-Efficient Gathering in Sensor Information Systems) and LAR(Location-Aided Routing). Typical localization protocols have RSSI(Received Signal Strength Indicator), TOA(Time Of Arrival), PDOA(Phase Difference Of Arrival), DV-hop, centroid localization and APIT(Approximate Point-In-Triangulation test).This paper mainly studies LEACH and PEGASIS, and analyzes the advantages and disadvantages of the two protocols. A novel reliable routing algorithm (LEACH-P) is proposed taking advantages of both LEACH and PEGASIS algorithms. LEACH-P protocol not only has node clustering structure of LEACH protocol, bus also has thought of greedy chain of PEGASIS, so the cluster heads into chain. This paper offers algorithm flowing chart and simulation diagram by Matlab software of LEACH-P. Theoretical analysis and simulation results demonstrate that, compared with LEACH, the proposed algorithm can prolong the network lifetime and balance the energy consumption of network nodes as well. Finally, this paper analyses performance of the DV-hop algorithm form number of anchor nodes, communication radiuses of nodes and number of total nodes. The results are given that the number of anchor nodes should be about 12. Communication radiuses of nodes select the optimal value according to the number of total nodes. In this way, the localization error of node can be reduced.