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.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
