Skip to Main Content
One of the main objectives of query processing in wireless sensor networks is to achieve high resource efficiency. In this paper, we focus on scheduling multiple queries which may have temporal and spatial overlapping in querying operations. Our purpose is to schedule the operations on the sensor nodes so as to save the total cost by maximizing the overlapping in time among the queries. We propose an algorithm, called RSQS, which allows the newly arrived query to best share the operations with existing queries. The simulation results showed that our proposed approach can be used to effectively reduce the amount of sensory data transmitted in the network. This leads to energy and bandwidth saving in wireless sensor network.