Research On High Efficient And Real Time Data Aggregation Algorithm In WSNs

Wireless sensor network(WSNs) is a kind of integrated network system with wireless transmission technology and sensor technology.System of multi-node self-organizing forming network topology structuredynamically, micro-sensors in a collaborative manner fordata acquisition, data through thesensor nodes to relay transmission to the sink node in multi-hop way, Then proceed data collection, the decision analysis and so on.The network nodes support random spreading deployment, so the network system commonly used in harsh environments, unattended automatic information collection and return. At present, wireless sensor networks have been widely used in many fields, such as military, health and medical monitoring, urban monitoring and management, natural environment monitoring, smart home and so on.Thepower supply ofsensor node depends on its own battery, which get rid of the restriction of the line. However, the characteristics of limited energy put forward strict requirements on the timeliness of the network, the node life cycle and the algorithm efficiency. Through the research, we can know that the energy consumed in the network is concentrated in the wireless radio module for data communication. It is necessaryto control the number of packets, redundant datain the network.It is the task of the data fusion algorithm to achieve the balance of network time, high efficiency and prolong the network life cycle.In this paper, the wireless sensor network data fusion process is discussed.Algorithmsbased on the minimum spanning tree structure to form the network routing, data fusion of the backbone structure. Innovativeproposed dynamic chain based on the N order weighted moving average tracking, prediction of environmental strategies,the nodes are set up to filter the data according to the path of the minimum spanning tree. In the process of sending data to the sink node, the data packets are formed, ensure important information return in a timely manner and try to extend the network life cycle. The main research work of this paper is as follows.(1) In the wireless sensor network, energy consumption androuting algorithmare studied, and a variety of filtering models and their advantages and disadvantages are analyzed.(2) It is proposed that the two end nodes of each transmission data be incorporated into the energy distance. The remaining energy of the two nodes is considered, and the calculation formula is given.(3) This article aims to improve the adaptability of minimum spanning tree routing algorithm. With the help of this algorithm, data fusion point is set, so that it plays the r ole of data noise reduction and redundancy.(4) An algorithm of moving average fusion algorithm based on dynamic linked list for N order history data is proposed. Mining the relationship between the sensor node history data, to forecast the current level of data, and to distinguish whether this data will be sent.(5) Experiment and data analysis.Set up a number of simulation environment and event scenarios, using the above algorithm to track environmental data. Through data analysis, chartsdisplay and other testing demonstrates the validity of the algorithm and thefiltering level of redundant data.