Abstract
The target coverage problem in wireless sensor networks is concerned with maximizing the lifetime of the network while continuously monitoring a set of targets. We add a QoS requirement to the target coverage such that the targets are covered by more than one sensor at any time. Given an integer vector Q, where q i is the minimum number of sensors to simultaneously cover targets i, the problem becomes Q-coverage problem. In this paper, we study the target Q-coverage problem. The objective is to maximize sensor network lifetime satisfying Q-coverage requirement. The problem is shown to be NP-complete and there is no known practical algorithm. We propose a heuristic and show that the proposed algorithm yields solution very near to the optimal solution. Our algorithm has two important features. It uses a greedy heuristic to generate Q-covers by prioritizing sensors in terms of the residual battery life and the algorithm assigns a small constant of lifetime to Q-covers so generated. In this process, it allows the sensors to participate in many Q-covers. We observe that the smaller the constant, the closer is the solution to optimal solution. Through experiments on randomly generated problem instances, we show that the proposed algorithm yields near-optimal solution.
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
Ai, J., Abouzeid, A.A.: Coverage by directional sensors in randomly deployed wireless sensor networks. J. Comb. Optim. 11, 21–41 (2006)
Cardei, M., Wu, J.: Energy efficient coverage problems in wireless ad hoc sensor networks. Computer Communications 29(4), 413–420 (2006)
Funke, S., Kesselman, A., Kuhn, F., Lotker, Z., Segal, M.: Improved approximation algorithms for connected sensor cover. Wireless Networks 13, 153–164 (2007)
Gu, Y., Liu, H., Zhao, B.: Target Coverage with QoS Requirements in Wireless Sensor Networks. In: IPC 2007, pp. 35–38 (2007)
Moscibroda, T., Wattenhofer, R.: Maximizing the Lifetime of Dominating Sets, IPDPS 19, p. 8 (2005)
Wang, L., Xiao, Y.: A survey of energy-efficient scheduling mechanisms in sensor networks. Mobile Networks and Applications 11, 723–740 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chaudhary, M., Pujari, A.K. (2008). Q-Coverage Problem in Wireless Sensor Networks. In: Garg, V., Wattenhofer, R., Kothapalli, K. (eds) Distributed Computing and Networking. ICDCN 2009. Lecture Notes in Computer Science, vol 5408. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92295-7_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-92295-7_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92294-0
Online ISBN: 978-3-540-92295-7
eBook Packages: Computer ScienceComputer Science (R0)