Sheng Huang
Hunan International Economics University, Changsha, China
ABSTRACT
Sensor networks have received considerable attention in recent years. Users do not only collect the sensor node data in many kinds of network system applications, query a group of nodes data aggregation is also often needed, such as average, sum, count and MAX. The in-network aggregation is adopted to save the limited sensor network resources. The common in-network aggregation method is the tree-based data aggregation. However, the shortcoming of the tree-based aggregation is that the packeting missing can cause the lower reliability. One of the solution is the multi-routing data aggregation. A sensor data can produce many copies which can be transmitted in the sensor network. However, multi-routing aggregation leads to the problem of the sensor recounting. In this study, we propose a sensor data aggregation method based on dynamic counting sketches for providing user to elastically set the following system parameters: (1) The want of performing data aggregation function, (2) The request of data aggregation accuracy and (3) The request of protecting privacy right. According to the system parameters set by the users, our system will effectively perform the needed sensor data aggregation query based on multi-path routing method and dynamic counting sketches. The method proposed in the study shows that the packeting space can be effectively saved in the certain accuracy by adopting the simulated data, the real data , the efficiency and the elasticity of the verification method in the wireless sensor network environment.
PDF References Citation
How to cite this article
Sheng Huang, 2013. Research on Handling the Sensor Data Aggregation Based on Dynamic Counting
Sketches. Information Technology Journal, 12: 7069-7075.
DOI: 10.3923/itj.2013.7069.7075
URL: https://scialert.net/abstract/?doi=itj.2013.7069.7075
DOI: 10.3923/itj.2013.7069.7075
URL: https://scialert.net/abstract/?doi=itj.2013.7069.7075
REFERENCES
- Chen, J. Y., G. Pandurangan and D. Xu, 2006. Robust computation of aggregates in wireless sensor networks: Distributed randomized algorithms and analysis. IEEE Trans. Parallel Distribut. Sys., 17: 987-1000.
CrossRef - Considine, J., F. Li, G. Kollios and J. Byers, 2004. Approximate aggregation techniques for sensor databases. Procedings of the 20th International Conference on Data Engineering, March 30 -2 April, 2004, Boston, MA, USA, pp: 449-460.
CrossRef - Fan, Y.C. and A.L.P., Chen, 2008. Efficient and robust sensor data aggregation using linear counting sketches. Proceedings of the IEEE International Symposium on Parallel and Distributed Processing, April 14-18 ,2008, Miami, Florida, USA., pp:1-12.
CrossRef - He, W., X. Liu, H. Nguyen, K. Nahrstedt and T. Abdelzaher, 2007. PDA: Privacy-preserving data aggregation in wireless sensor networks. Proceedings of the 26th IEEE International Conference on Computer Communications, May 6-12, Anchorage, pp: 2045-2053.
CrossRef - Manjhi, A., S. Nath and P.B. Gibbons, 2005. Tributaries and Deltas: efficient and robust aggregation in sensor network streams. Proceedings of the ACM SIGMOD International Conference on Management of Data, June 14-16, 2005, Baltimore, Maryland, USA., pp: 287-298.
CrossRef