Data caching-based query processing in multi-sink wireless sensor networks Online publication date: Fri, 23-Mar-2012
by Zhipeng Cai; Shouling Ji; Jinbao Li
International Journal of Sensor Networks (IJSNET), Vol. 11, No. 2, 2012
Abstract: In multi-sink Wireless Sensor Networks (WSNs), different sinks may issue same queries and therefore they can share some common query results. As a classical data-sharing method, data caching is employed widely in traditional databases and it can also bring benefits in WSNs thanks to the emergence of sensors with Flash Memory. Therefore, a query-processing method based on common subtree (CS) caching in multi-sink WSNs is proposed. We first construct CSs and then cache the results of processed queries at the roots of CSs. Subsequently, later common queries can obtain their expected results from the common roots. Furthermore, in order to achieve a higher degree of data sharing, we propose a loop-removing algorithm. Extensive simulations indicate that the proposed method can reduce the energy consumption and the query response time significantly for WSNs.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com