Research On Data Query Routing Method Based On WSN In Application Layer Design

Wireless sensor network is a wireless LAN by randomly deploying a large number of sensor nodes to obtain user's interest information,which has been widely used in recent years.Because the sensor nodes are small,they can only be powered by micro batteries,but the micro batteries have limited energy and can not be replaced,once they are used up.The energy problem of sensor nodes has seriously hindered the development of sensor networks,and how to reduce energy consumption has become the most important problem in Sensor Networks.Therefore,when designing routing algorithms for wireless sensor networks,efficient and low energy routing algorithms are important for prolonging the lifetime of nodes.At present,the research of routing algorithm is based on the centralized network routing protocol and the hierarchical network routing protocol.The routing algorithm is designed separately at the network layer,ignoring the information exchange between layers and layers,resulting in energy efficient routing algorithm Practical application of low efficiency,a lot of resources are wasted.This paper studies and implements a data query routing based on the application layer routing table designed across the application layer.Based on the idea of improving the efficiency of the cross-layer,the application layer condition and the network layer routing table are merged in the original hierarchical model,The design of an application layer routing table,making the network layer can directly use the user information and improve the routing efficiency.Based on the characteristics of wireless sensor,this paper does some research on Routing Algorithms for wireless sensor networks:(1)Introduced the architecture,protocol stack,application and problems of wireless sensor networks and the research status at home and abroad.(2)The data query of wireless sensor network is studied in detail.This paper focuses on the aggregation query and top-k query in two query languages and query algorithms,and analyzes the advantages and disadvantages of these algorithms and query languages.(3)Several routing query algorithms are studied,and the flood routing protocol and DD protocol based on plane routing protocol and leach protocol based on hierarchical routing protocol are introduced in detail in the routing algorithm,and the characteristics of each protocol are analyzed and summarized.(4)According to the shortcomings of the existing routing algorithm,a directional diffusion algorithm based on application layer routing table is proposed.When the sensor node receives the condition of user query,the condition of query is decomposed into a plurality of sub conditions and stored into the interest list of the sensor node with the current interest message.In the establishment phase gradient,the data message is decomposed into multiple sub styles according to the decomposition of query.If the data matches the interest in the list of sub interest,the sensor node transmits the data and creates a sub interest routing table.When the user carries on the route inquiry next time,we can match the interest routing table of the application layer with the routing table of the network layer.We can quickly find the more efficient path,narrow the query scope and improve the routing efficiency.According to the existing LEACH routing algorithm for randomly selected cluster heads shortcomings,on the choice of cluster head formula optimization,and combined with the application layer routing table data forwarding information,reduce the probability of low energy nodes become cluster head,make the energy consumption more balanced.Finally,the simulation algorithm of the improved routing algorithm is proved.The experiment proves that the routing algorithm based on the application layer information table saves the energy consumption and prolongs the life cycle of the wireless sensor network to a certain extent.