Abstract
Due to limited battery life and fault tolerance issues posed by Wireless Sensor Networks (WSNs), efficient methods which ensure reliable coverage are highly desirable. One solution is to use disjoint set covers to cover the targets. We formulate a problem called MDC which addresses the maximum coverage by using disjoint set covers S 1 and S 2. We prove that MDC is \(\mathcal{NP}\)-complete and propose a \(\sqrt{n}\)-approximation algorithm for the MDC problem to cover n targets.
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
Gallais, A., Carle, J.: An adaptive localized algorithm for multiple sensor area coverage. In: Proc. of the Int’l Conf on Advanced Networking and Applications, pp. 525–532 (2007)
Srivastava, V., Motani, M.: Worst and best-case coverage in sensor networks. IEEE Transanctions on Mobile Computing 3(4), 84–92 (2004)
Li, X.-Y.: Coverage in wireless ad hoc sensor networks. IEEE Transanctions on Computers 52(6), 753–763 (2003)
Haas, Z.: On the relaying capability of the reconfigurable wireless networks. In: Proc. of the Int’l Conf. on Vehicular Technology, pp. 1148–1152 (1997)
Cardei, M., Thai, M., Li, Y., Wu, W.: Energy-efficient target coverage in wireless sensor networks. In: Proc. of the IEEE Int’l Conf. on Computer Communications, pp. 1976–1984 (2005)
Zorbas, D., Glynos, D., Kotzanikolaou, P., Douligeris, C.: Solving coverage problems in wireless sensor networks using coversets. Ad Hoc Networks 8(4), 400–415 (2010)
Jaggi, N., Abouzeid, A.A.: Energy-efficient connected coverage in wireless sensor networks. In: Proc. of the Int’l Conf. on Asian International Mobile Computing, pp. 4–7 (2006)
Cardei, M., Du, D.Z.: Improving wireless sensor network lifetime through power aware organization. Wireless Networks 11(3), 333–340 (2005)
Slijepcevic, S., Potkonjak, M.: Power efficient organization of wireless sensor networks. In: Proc. of the Int’l Conf. on Communications, pp. 472–476 (2005)
Cheng, M.X., Ruan, L., Wu, W.: Achieving minimum coverage breach under bandwidth constraints in wireless sensor networks. In: Proc. of the IEEE Int’l Conf. on Computer Communications, pp. 2638–2645 (2005)
Cheng, M.X., Ruan, L., Wu, W.: Coverage breach problems in bandwidth-constrained sensor networks. ACM Transactions on Sensor Networks 3(2), 1–23 (2007)
Abrams, Z., Goel, A., Plotkin, S.: Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. In: Proc. of the Symposium on Information Processing in Sensor Networks, pp. 26–27 (2004)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Henna, S., Erlebach, T. (2013). Approximating Maximum Disjoint Coverage in Wireless Sensor Networks. In: Cichoń, J., Gȩbala, M., Klonowski, M. (eds) Ad-hoc, Mobile, and Wireless Network. ADHOC-NOW 2013. Lecture Notes in Computer Science, vol 7960. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39247-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-39247-4_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39246-7
Online ISBN: 978-3-642-39247-4
eBook Packages: Computer ScienceComputer Science (R0)