Abstract
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.
Original language | English |
---|---|
Title of host publication | Proceedings of the 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008 |
Publisher | IEEE Computer Society |
Pages | 801-806 |
Number of pages | 6 |
ISBN (Print) | 9780769534732 |
DOIs | |
Publication status | Published - 1 Jan 2008 |
Event | 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008 - Yilan, Taiwan Duration: 9 Dec 2008 → 12 Dec 2008 |
Conference
Conference | 3rd IEEE Asia-Pacific Services Computing Conference, APSCC 2008 |
---|---|
Country/Territory | Taiwan |
City | Yilan |
Period | 9/12/08 → 12/12/08 |
ASJC Scopus subject areas
- Computer Science Applications
- Software
- Electrical and Electronic Engineering