Abstract
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.
This work is supported by National Natural Science Foundations of China (10671152), NSFC (60603003), the National Science Foundation under grant CCF-0514796 and CNS-0524429. This work was completed when Dr. Zhao Zhang visiting Department of Computer Science, The University of Texas at Dallas.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wilschut, A.N., Apers, P.M.G.: Dataflow Query Execution in a Parallel Main-Memory Environment. Distributed and Parallel Databases 1(1), 103–128 (1993)
Bonnet, P., Gehrke, J., Seshadri, P.: Towards Sensor Database Systems. Mobile Data Management, 3–14 (2001)
Cheng, R., Prabhakar, S.: Managing Uncertainty in Sensor Database. ACM SIGMOD 32(4), 41–46 (2003)
Estrin, D., Govindan, R., Heidemann, J.: Embedding the Internet: Introduction. Communications of the ACM Journal 43(5), 38–41 (2000)
Gonen, M., Shavitt, Y.: A Θ (log n)-Approximation for the Set Cover Problem with Set Ownership. Information Processing Letters 109, 183–186 (2009)
Govindan, R., Hellerstein, J.M., Hong, W., Madden, S., Franklin, M., Shenker, S.: The Sensor Network as a Database, USC Computer Science Department Technical Report (September 2002)
Hellerstein, J.M., Avnur, R., Ranman, V.: Informix under CONTROL: Online Query Processing. Data Mining and knowledge Discovery 4(4) (October 2000)
Seshadri, P., Livny, M., Ramaakrishman, R.: SEQ: A Model for Sequence Databases. In: Proceedings of the 11th International Conference on Data Engineering (ICDE), pp. 232–239 (1995)
Abrams, Z., Goel, A., Plotkin, S.: Set k-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks. In: Proceedings of the 3rd Conference on Information Processing in Sensor Networks, IPSN 2004 (2004)
Cardei, M., Wu, J.: Energy-Efficient Coverage Problems in Wireless Ad-Hoc Sensor Networks. Computer Communications 29(4), 413–420 (2006)
Cardei, M., Thai, M., Li, Y., Wu, W.: Energy-Efficient Target Coverage in Wireless Sensor Networks. In: Proceedings of 24th Annual Joint Conference of the IEEE Computer and Communication Societies (INFOCOM 2005), Miami, Florida USA, March 13-17, pp. 1976–1984 (2005)
Cardei, M., Du, D.Z.: Improving Wireless Sensor Network Lifetime through Power Aware Organization. ACM Wireless Networks 11(3), 333–340 (2005)
Cerdeira, J.O., Pinto, L.S.: Requiring Connectivity in the Set Covering Problem. Journal of Combinatorial Optimization 9, 35–47 (2005)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn (2002)
Feige, U.: A Threshold of ln n for Approximating Set Cover. In: Proceedings of the 28th ACM Symposium on Theory of Computing (ACM 1996), pp. 314–318 (1996)
Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Company, New York (1979)
Gupta, H., Das, S.R., Gu, Q.: Connected Sensor Cover: Self-Organization of Sensor Networks for Efficient Query Execution. In: Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2003 (2003)
Huang, C.F., Tseng, Y.C.: The Coverage Problem in a Wireless Sensor Network. In: Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications, pp. 115–121 (2003)
Jaggi, N., Abouzeid, A.A.: Energy-Efficient Connected Coverage in Wireless Sensor Networks. In: Proceedings of 4th Asian International Mobile Computing Conference, Kolkata, India, pp. 77–86 (2006)
Li, X.Y., Wan, P.J., Frieder, O.: Coverage in Wireless Ad-Hoc Sensor Networks. IEEE Transactions on Computers 52(6), 753–763 (2003)
Madden, S.R., Franklin, M.J., Hellerstein, J.M., Hong, W.: TAG: A Tiny Aggregation Service for Ad-Hoc Sensor Networks. In: OSDI (2002)
Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Coverage Problems in Wireless Ad-Hoc Sensor Networks. In: Proceedings of Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001), vol. 3, pp. 1380–1387 (2001)
Shuai, T.-P., Hu, X.: Connected Set Cover Problem and its Applications. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol. 4041, pp. 243–254. Springer, Heidelberg (2006)
Suurballe, J.W., Tarjan, R.E.: A Quick Method for Finding Shortest Pairs of Disjoint Paths. Networks 14, 325–336 (1984)
Tague, P., Lee, J., Poovendran, R.: A Set-Covering Approach for Modeling Attacks on Key Predistribution in Wireless Sensor Networks, Technical Report CACR, 41 (2005)
Thai, M.T., Wang, F., Du, H., Jia, X.: Coverage Problems in Wireless Sensor Networks: Designs and Analysis. International Journal of Sensor Networks, special issue on Coverage Problems in Sensor Networks 3(3), 191–200 (2008)
Zhou, Z.H., Das, S., Gupta, H.: Connected K-Coverage Problem in Sensor Networks. In: Proceedings of the 13th International Conference onComputer Communications and Networks (ICCCN 2004), pp. 373–378 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, Z., Gao, X., Zhang, X., Wu, W., Xiong, H. (2009). Three Approximation Algorithms for Energy-Efficient Query Dissemination in Sensor Database System. In: Bhowmick, S.S., Küng, J., Wagner, R. (eds) Database and Expert Systems Applications. DEXA 2009. Lecture Notes in Computer Science, vol 5690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03573-9_68
Download citation
DOI: https://doi.org/10.1007/978-3-642-03573-9_68
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03572-2
Online ISBN: 978-3-642-03573-9
eBook Packages: Computer ScienceComputer Science (R0)