Research On Hierarchical Routing Protocol And Localization Algorithm For WSN

Wireless sensor network application integrates many disciplines research and technology in one: on the basis of distributed processing theory,hardware support is realized through embedded technology,and network expansion is realized by computer science and modern communication technology.With the deepening of research on MEMS and wireless communication related technologies,people have gradually developed low-cost,low-energy micro-sensors,which provide basic support for building a sensor network with better comprehensive performance.Based on the related theories and improved methods proposed by many scholars in many research fields of wireless sensor networks in recent years,this paper discusses the related technologies of network energy overhead control and node location in the network from the aspects of energy utilization and sensor node location analysis.In the field of wireless sensor network routing research,hierarchical routing protocols have outstanding advantages in reducing energy consumption and extending the life cycle of the network,and LEACH is one of the most concerned.Therefore,the paper selects the LEACH protocol as the research object,in order to save the network energy consumption overhead,and combines the ISODATA clustering algorithm on the basis of the original,so as to achieve the purpose of making the network clustering situation more uniform.At the same time,after studying the network partitioning and election mechanism of LEACH protocol,combined with the iterative MDS positioning method,the coordinates of related nodes in each divided network are obtained while network communication is performed,and the positioning result is processed to a unified global coordinate system.To maximize the use of energy efficiency.The LEACH protocol adopts a random mechanism in the clustering and cluster head election stage.This has certain irrationality,and it also causes a large amount of data transmission during the communication process and the sensor energy consumption is too fast.Aiming at this problem,under the premise of balancing the energy cost of the network,this paper proposes a hierarchical routing algorithm(IICMH)that utilizes ISODATA clustering.Firstly,the paper refers to the location information of the global node,and uses the ISODATA algorithm to perform iterative calculation and then classify the nodes reasonably.Then,each node refers to its own remaining energy and their relative position to the base station,and elects a cluster head with reference to a certain mechanism.After the campaign process is completed,the base station uses the greedy mechanism of the Dijkstra algorithm according tothe interest data sent by the cluster head node to obtain the shortest path among the branches of each cluster head to the base station,and further derives the optimal topology.In the practical application of wireless sensor networks,the positioning of micro-sensors is one of the core technologies.Based on the LEACH protocol,this paper proposes a multi-dimensional scale iterative localization algorithm.The paper combines the characteristics of the clustering mechanism in the original protocol and the advantages of the iterative MDS algorithm.Using the routing information in the protocol work process,the nodes are located by coordinate transformation.In order to verify the performance of related improvements,the paper simulated and selected related parameters.Experiments can be used to demonstrate that the improvement proposed by the paper is significantly improved compared with the original algorithm in terms of reasonable clustering,load balancing and prolonging network lifetime.The MDS iteration method can obtain the coordinate position information with better precision.