Abstract
Various notions of coverage have been introduced as basic quality-of-service measures for wireless sensor networks. One natural measure of coverage is referred to as resilience: given a starting region S and a target region T, the resilience a sensor configuration with respect to S and T is the minimum number of sensors that need to be deactivated before an S − T path can exist that does not cross any active sensor region. We demonstrate that determining resilience of a network of unit-line-segment sensors is NP-hard. Furthermore, we can extend our proof to show that the resilience problem remains NP-hard for other types of non-symmetric sensor coverage regions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alt, H., Cabello, S., Giannopoulus, P., Knauer, C.: On some connection problems in straight-line segment arrangements. In: 27th European Workshop on Computational Geometry, pp. 27–30 (2011)
Bereg, S., Kirkpatrick, D.: Approximating Barrier Resilience in Wireless Sensor Networks. In: Dolev, S. (ed.) ALGOSENSORS 2009. LNCS, vol. 5804, pp. 29–40. Springer, Heidelberg (2009)
Cardei, M., Wu, J.: Coverage in wireless sensor networks. In: Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems, pp. 432–446. CRC Press (2005)
Gage, D.W.: Command control for many-robot systems. In: Proceedings of the 19th Annual AUVS Technical Symposium, AUVS 1992, pp. 28–34 (1992)
Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theoretical Computer Science pp. 237 – 267 (1976)
Gregg, W., Esaias, W., Feldman, G., Frouin, R., Hooker, S., McClain, C., Woodward, R.: Coverage opportunities for global ocean color in a multimission era. IEEE Transactions on Geoscience and Remote Sensing, 1620–1627 (1998)
Håstad, J.: Some optimal inapproximability results. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 1–10 (1997)
Kumar, S.: Foundations of coverage in wireless sensor networks. Ph.D. thesis, Ohio State University (2006)
Kumar, S., Lai, T.H., Arora, A.: Barrier coverage with wireless sensors. In: Proceedings of the 11th Annual International Conference on Mobile Computing and Networking, pp. 284–298 (2005)
Liu, B., Dousse, O., Wang, J., Saipulla, A.: Strong barrier coverage of wireless sensor networks. In: Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 411–420 (2008)
Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.: Coverage problems in wireless ad-hoc sensor networks. In: INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE, pp. 1380–1387 (2001)
Meguerdichian, S., Koushanfar, F., Qu, G., Potkonjak, M.: Exposure in wireless ad-hoc sensor networks. In: Proceedings of the 7th Annual International Conference on Mobile Computing and Networking, pp. 139–150 (2001)
Tseng, K.C.R.: Resilience of Wireless Sensor Networks. Master’s thesis, University of British Columbia (2011)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tseng, KC.R., Kirkpatrick, D. (2012). On Barrier Resilience of Sensor Networks. In: Erlebach, T., Nikoletseas, S., Orponen, P. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2011. Lecture Notes in Computer Science, vol 7111. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28209-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-28209-6_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28208-9
Online ISBN: 978-3-642-28209-6
eBook Packages: Computer ScienceComputer Science (R0)