Dataflow query execution in a parallel main-memory environment
Distributed and Parallel Databases - Selected papers from the first international conference on parallel and distributed information systems
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Embedding the Internet: introduction
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Introduction to Algorithms
Informix under CONTROL: Online Query Processing
Data Mining and Knowledge Discovery
SEQ: A Model for Sequence Databases
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Towards Sensor Database Systems
MDM '01 Proceedings of the Second International Conference on Mobile Data Management
Connected sensor cover: self-organization of sensor networks for efficient query execution
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Managing uncertainty in sensor database
ACM SIGMOD Record
Set k-cover algorithms for energy efficient monitoring in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Coverage problems in wireless sensor networks: designs and analysis
International Journal of Sensor Networks
A Θ( logn)-approximation for the set cover problem with set ownership
Information Processing Letters
Energy-efficient coverage problems in wireless ad-hoc sensor networks
Computer Communications
Connected set cover problem and its applications
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Coverage in wireless ad hoc sensor networks
IEEE Transactions on Computers
| Hi-index | 0.00 |
Sensor database is a type of database management system which offers sensor data and stored data in its data model and query languages. In this system, when a user poses a query to this sensor database, the query will be disseminated across the database. During this process, each sensor generates data that match the query from its covered area and then returns the data to the original sensor. In order to achieve an energy-efficient implementation, it will be useful to select a minimally sufficient subset of sensors to keep active at any given time. Thus, how to find a subset efficiently is an important problem for sensor database system. We define this problem as sensor database coverage (SDC) problem. In this paper, we reduce the SDC problem to connected set cover problem, then present two approximation algorithms to select a minimum connected set cover for a given sensor database. Moreover, to guarantee robustness and accuracy, we require a fault-tolerant sensor database, which means that each target in a query region will be covered by at least m sensors, and the selected sensors will form a k -connected subgraph. We name this problem as (k ,m )-SDC problem and design another approximation algorithm. These three algorithms are the first approximation algorithms with guaranteed approximation ratios to SDC problem. We also provide simulations to evaluate the performance of our algorithms. We compare the results with algorithms in [17]. The comparison proves the efficiency of our approximations. Thus, our algorithms will become a new efficient approach to solve coverage problem in sensor database systems.