Abstract

Wireless sensor networks (WSNs) are almost everywhere, they are exploited for thousands of applications in a densely distributed manner. Such deployment makes WSNs one of the highly anticipated key contributors of the big data nowadays. Hence, data aggregation is attracting much attention from researchers as efficient way to reduce the huge volume of data generated in WSNs by eliminating the redundancy among sensing data. In this paper, we propose an efficient data aggregation technique for clustering-based periodic wireless sensor networks. Further to a local aggregation at sensor node level, our technique allows cluster-head to eliminate redundant data sets generated by neighbouring nodes by applying three data aggregation methods. These proposed methods are based on the sets similarity functions, the one-way Anova model with statistical tests and the distance functions, respectively. Based on real sensor data, we have analyed their performances according to the energy consumption and the data latency and accuracy, and we show how these methods can significantly improve the performance of sensor networks.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.