Abstract
Wireless sensor networks have recently posed many new system building challenges. One of the main problems is energy conservation since most of the sensors are devices with limited battery life and it is infeasible to replenish energy via replacing batteries. An effective approach for energy conservation is scheduling sleep intervals for some sensors, while the remaining sensors stay active providing continuous service. In this paper we consider the problem of selecting a set of active sensors of minimum cardinality so that sensing coverage and network connectivity are maintained. We show that the greedy algorithm that provides complete coverage has an approximation factor of Ω(log n), where n is the number of sensor nodes. Then we present algorithms that provide approximate coverage while the number of nodes selected is a constant factor far from the optimal solution.
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
Abrams, Z., Goel, A., Plotkin, S.: Set K-Cover Algorithms for Energy Efficient Monitoring in Wireless Sensor Networks. In: Proc. of Third International Symposium on Information Processing in Sensor Networks, IPSN (2004)
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless Sensor Networks:A Survey. Computer Networks (March 2002)
Berman, P., Calinescu, G., Shah, C., Zelikovsky, A.: Power Efficient Monitoring Management in Sensor Networks. In: IEEE Wireless Communication and Networking Conference (WCNC 2004), Atlanta (March 2004)
Badrinath, B., Srivastava, M., Mills, K., Holtz, J.S., Sollins, K. (eds.): Special Issue on Smart Spaces and Environments. IEEE Personal Communications (2000)
Ben-Moshe, B., Katz, M.J., Segal, M.: Obnoxious Facility Location: Complete Service with Minimal Harm. International Journal of Computational Geometry and Applications 10, 581–592 (2000)
Bose, P., Maheshwari, A., Morin, P., Morrison, J.: The grid placement problem. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol. 2125, pp. 180–191. Springer, Heidelberg (2001)
Cerpa, A., Estrin, D.: ASCENT: Adaptive Self-Configuring Sensor Networks Topologies. In: Proc. of INFOCOM 2002, NewYork, NY, USA (June 2002)
Chakrabarty, K., Iyengar, S.S., Qi, H., Cho, E.: Grid coverage for surveillance and target location in distributed sensor networks. IEEE Transactions on Computers 51(12), 1448–1453 (2002)
Chen, B., Jamieson, K., Balakrishnan, H., Morris, R.: Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks. In: ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom 2001), Rome, Italy (July 2001)
Clark, B., Colbourn, C., Johnson, D.: Unit Disk Graphs. Discrete Mathematics 86, 165–177 (1990)
Dhillon, S.S., Chakrabarty, K.: Sensor placement for effective coverage and surveillance in distributed sensor networks. In: Proc. of IEEE Wireless Communications and Networking Conference, pp. 1609–1614 (2003)
Estrin, D., Govindan, R., Heidemann, J.: Special Issue on Embedding the Internet. Communications of the ACM 43 (2000)
Guha, S., Khuller, S.: Improved Methods for Approximating NodeWeighted Steiner Trees and Connected Dominating Sets. Inf. Comput. 150(1), 57–74 (1999)
Gupta, H., Das, S.R., Gu, Q.: Connected Sensor Cover: Self-Organization of Sensor Networks for Efficient Query Execution. In: Proc. of MobiHoc 2003, Annapolis, Maryland (June 2003)
Huang, H., Richa, A., Segal, M.: Dynamic Coverage and Related Problems in Ad-hoc Sensor Networks. ACM Mobile Networks and Applications: Special Issue on Algorithmic Solutions for Wireless, Mobile, Ad Hoc and Sensor Networks (2003)
Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. System Sci. 9, 256–278 (1974)
Kar, K., Banerjee, S.: Node Placement for Connected Coverage in Sensor Networks. In: Proceedings of WiOpt 2003, Sophia-Antipolis, France (March 2003)
Lee, D.T., Sarrafzadeh, M., Wu, Y.F.: Minimum cut for circular-arc graphs. SIAM J. Computing 19(6), 1041–1050 (1990)
Li, X., Wan, P., Frieder, O.: Coverage in wireless ad-hoc sensor networks. In: ICC 2002, NewYork City (2002)
Mainwaring, A., Polastre, J., Szewczyk, R., Culler, D.: Wireless sensor networks for habitat monitoring. In: First ACM International Workshop on Wireless Workshop in Wireless Sensor Networks and Applications (August 2002)
Masuda, S., Nakajima, K.: An optimal algorithm for finding a maximum independent set of a circular-arc graph. SIAM Journal on Computing 17(1), 41–52 (1988)
Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.B.: Coverage Problems inWireless Ad-hoc Sensor Networks. In: Proc. of IEEE Infocom 2001 (2001)
Meguerdichian, S., Potkonjak, M.: Low Power 0/1 Coverage and Scheduling Techniques in Sensor Networks, UCLA Technical Report 030001 (January 2003)
Slijepcevic, S., Potkonjak, M.: Power efficient organization of wireless sensor networks. In: Proc. of IEEE International Conference on Communications (ICC), pp. 472–476 (2001)
Tian, D., Georganas, N.D.: A Coverage-preserved Node Scheduling scheme for Large Wireless Sensor Networks. In: Proc. of First International Workshop on Wireless Sensor Networks and Applications, Atlanta, USA (September 2002)
Wan, P.J., Alzoubi, K., Frieder, O.: Distributed Construction of Connected Dominating Set inWireless ad hoc networks. In: Proc. of INFOCOM 2002 (2002)
Wang, X., Xing, G., Zhang, Y., Lu, C., Pless, R., Gill, C.D.: Integrated Coverage and Connectivity Configuration inWireless Sensor Networks. In: Proc. of SenSys 2003 (2003)
Xu, Y., Heidemann, J., Estrin, D.: Geography-informed Energy Conservation for Ad Hoc Routing. In: ACM/IEEE International Conference on Mobile Computing and Networking (Proc. of MobiCom 2001), Rome, Italy (July 2001)
Ye, F., Zhong, G., Lu, S., Zhang, L.: Peas: A robust energy conserving protocol for longlived sensor networks. In: Proc. of The 23nd International Conference on Distributed Computing Systems, ICDCS (2003)
Zhang, H., Hou, J.C.: Maintaining Sensing Coverage and Connectivity in Large Sensor Networks. Technical Report UIUC, UIUCDCS-R-2003-2351 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Funke, S., Kesselman, A., Lotker, Z., Segal, M. (2004). Improved Approximation Algorithms for Connected Sensor Cover. In: Nikolaidis, I., Barbeau, M., Kranakis, E. (eds) Ad-Hoc, Mobile, and Wireless Networks. ADHOC-NOW 2004. Lecture Notes in Computer Science, vol 3158. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28634-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-28634-9_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22543-0
Online ISBN: 978-3-540-28634-9
eBook Packages: Springer Book Archive