SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Proceedings of the 7th annual international conference on Mobile computing and networking
Building efficient wireless sensor networks with low-level naming
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Informix under CONTROL: Online Query Processing
Data Mining and Knowledge Discovery
| Hi-index | 0.00 |
Sensor networks gather tremendous data from some wide range of area and databases are good to process and manage such tremendous data. However, there might happen some problems on applying database concepts into wireless sensor networks. The reason is because from the viewpoint of wireless sensor networks, situations under which some operations should be performed on non-existing data may occur frequently. For instance, consider the following examples: How can we write a query to get the locations at which the temperature is 22°C, given a sensor network area in which there are some spots at exactly 22°C but there is no sensor node to announce exactly 22°C? Can we write a query to get the temperature of a spot with no sensor node? In order to solve the above described problems, we propose the new database operation for sensor networks and show how the above queries' results could be obtained using this new operation. This new database operation can provide more effective data management and standard interfaces to application programs for sensor networks. Furthermore, it is also helpful to save a node's energy by reducing the number of communications for processing a query and enhances the robustness of a sensor network system.