Designing Data Aggregation Algorithm for WSNs Based on N-Order Weighted Moving Average Value

This electronic document is a “live” template and a Abstract-Data aggregation is one of the most important methods to improve transmission efficiency in WSNs, but existing data aggregation algorithms do not well meet the demand of WSNs' application: firstly, real time performance of transmission is influenced by filtering messages procedure; secondly, the reduplicated messages filtering ratio is relative low; and extra hardware should be added to obtain high performance. To resolve these problems, based on clustering routing algorithm, a real time and efficient data aggregation algorithm is proposed. In this algorithms' filtering procedure, a dynamical list will be established in every filtering node, and it is designed to store last n periods' transmission state by filtering node, and the message's redundancy can be judged without much delay by browsing message list. To improve the filtering efficiency, the message list can be adjusted dynamically. The whole procedure of data aggregation is introduced, and the algorithm is designed in detail in this paper. At last, a series of experiments are simulated to prove the performance of this algorithm, and its advantages are analyzed in theory.