Complete ternary tree-based data aggregation routing algorithm for wireless sensor networks

摘要

According to the characteristics of wireless sensor networks, a routing protocols based on complete ternary tree structure of the non-linear polynomial regression function data aggregation is proposed. Especially, The parent node receives coefficients and aggregate them with the data that coming from the surrounding non-tree node, and then pass on the new series of coefficients with the coefficients from son node to its parent node, until it reaches the sink node. Which not only greatly reduce the amount of data transmission, but also to quickly query to the location of the node information. Experimental results show that the proposed routing protocols of the nonlinear polynomial regression function data aggregation which based on complete ternary tree structure is higher accuracy and higher compression ratio than the complete binary tree-based routing protocol.