In-network multi-sensors query aggregation algorithm for wireless sensor networks database

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

Abstract

In-network adaptive query optimization for Wireless Sensor Networks (WSNs) database considered as a distributed database has been a wide research field. Due to a limited battery of sensors, the research direction regarding energy efficiency has attracted increasing interest in different monitoring applications for extending the lifetime of WSNs. Finding the best aggregation node for multi-sensors query optimization in WSNs is achieving this goal. In this work, in-network distributed data aggregation is studied. We propose In-network Aggregation Algorithms (InAA), which can be used in both Tree-based network structure and Graph-based network structure, for finding the best aggregation node and scheduling the transmission of the data packet. Firstly, we analyze how this algorithm could find the optimal aggregation node. Then, we show the query execution scheme generated by InAA is the most energy efficient. Finally, we evaluate the performance of InAA by a case study and give some future research works.

Cite

CITATION STYLE

APA

Yan, H., Al-Hoqani, N., & Yang, S. H. (2018). In-network multi-sensors query aggregation algorithm for wireless sensor networks database. In ICNSC 2018 - 15th IEEE International Conference on Networking, Sensing and Control (pp. 1–8). Institute of Electrical and Electronics Engineers Inc. https://doi.org/10.1109/ICNSC.2018.8361280

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