Sampling based δ-approximate data aggregation in sensor equipped IoT networks

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Emerging needs in data sensing applications result in the usage of IoT networks. These networks are widely deployed and exploited for various efficient data transfer. Wireless sensors can be incorporated in IoT networks to reduce the deployment costs and maintenance costs. One of the critical problems in sensor equipped IoT devices is to design an energy efficient data aggregation method that processes the maximum value query and distinct set query. Therefore, in this paper, we propose two approximate algorithms to process the maximum queries and distinct-set queries in wireless sensor networks. These two algorithms are based on uniform sampling. Solid theoretical proofs are offered which can make sure the proposed algorithms can return correct query results with a given probability. Simulation results show that both δ -approximate maximum value and δ-approximate distinct set algorithms perform significantly better than a simple distributed algorithm in terms of energy consumption.

Cite

CITATION STYLE

APA

Li, J., Siddula, M., Cheng, X., Cheng, W., Tian, Z., & Li, Y. (2018). Sampling based δ-approximate data aggregation in sensor equipped IoT networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10874 LNCS, pp. 249–260). Springer Verlag. https://doi.org/10.1007/978-3-319-94268-1_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free