Approximating Barrier Resilience in Wireless Sensor Networks
 Sergey Bereg,
 David Kirkpatrick
 … show all 2 hide
Abstract
Barrier coverage in a sensor network has the goal of ensuring that all paths through the surveillance domain joining points in some start region S to some target region T will intersect the coverage region associated with at least one sensor. In this paper, we revisit a notion of redundant barrier coverage known as kbarrier coverage.
We describe two different notions of width, or impermeability, of the barrier provided by the sensors in \(\cal A\) to paths joining two arbitrary regions S to T. The first, what we refer to as the thickness of the barrier, counts the minimum number of sensor region intersections, over all paths from S to T. The second, what we refer to as the resilience of the barrier, counts the minimum number of sensors whose removal permits a path from S to T with no sensor region intersections. Of course, a configuration of sensors with resilience k has thickness at least k and constitutes a kbarrier for S and T.
Our result demonstrates that any (Euclidean) shortest path from S to T that intersects a fixed number of distinct sensors, never intersects any one sensor more than three times. It follows that the resilience of \(\cal A\) (with respect to S and T) is at least onethird the thickness of \(\cal A\) (with respect to S and T). (Furthermore, if points in S and T are moderately separated (relative to the radius of individual sensor coverage) then no shortest path intersects any one sensor more than two times, and hence the resilience of \(\cal A\) is at least onehalf the thickness of \(\cal A\) .)
A second result, which we are only able to sketch here, shows that the approximation bounds can be tightened (to 1.666 in the case of moderately separated S and T) by exploiting topological properties of simple paths that make double visits to a collection of disks.
 Cardei, M., Wu, J.: Coverage in wireless sensor networks. In: Ilyas, M., Mahgoub, I. (eds.) Handbook of Sensor Networks: Compact Wireless and Wired Sensing Systems, ch. 19, pp. 432–446. CRC Press, Boca Raton (2005)
 Carr, R.D., Doddi, S., Konjevod, G., Marathe, M.: On the redblue set cover problem. In: Proc. 11th ACMSIAM Symp. on Discr. Algor., pp. 345–353 (2000)
 Chen, A., Kumar, S., Lai, T.H.: Designing localized algorithms for barrier coverage. In: Proc. of the 13th Annual ACM International Conference on Mobile Computing and Networking (MobiCom 2007), pp. 63–74 (2007)
 Chen, A., Lai, T.H., Xuan, D.: Measuring and guaranteeing quality of barriercoverage in wireless sensor networks. In: MobiHoc 2008: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing, pp. 421–430. ACM, New York (2008) CrossRef
 Feige, U.: A threshold of ln n for approximating set cover. J. ACM 45(4), 634–652 (1998) CrossRef
 Gage, D.W.: Command control for manyrobot systems. In: Proc. 19th Annu. AUVS Tech. Symp., AUVS 1992, Hunstville AL, pp. 28–34 (1992)
 Jacob, R., Koniedov, G., Krumke, S., Marathe, M., Ravi, R., Wirth, H.: The minimum label path problem. In: Unpublished manuscript, Los Alamos National Laboratory (1999)
 Jiang, C.D., Chen, G.L.: Double barrier coverage in dense sensor networks. J. Comput. Sci. and Tech. 23(1), 154–165 (2008) CrossRef
 Kloder, S., Hutchinson, S.: Barrier coverage for variable boundedrange lineofsight guards. In: Proc. of IEEE International Conference on Robotics and Automation (ICRA 2007), pp. 391–396 (2007)
 Kumar, S.: Foundations of coverage in wireless sensor networks. PhD thesis, Columbus, OH, USA, AdviserLai, Ten H (2006)
 Kumar, S., Lai, T.H., Arora, A.: Barrier coverage with wireless sensors. In: Proc. of the 11th Annual International Conference on Mobile Computing and Networking (MobiCom 2005), pp. 284–298 (2005)
 Kumar, S., Lai, T.H., Arora, A.: Barrier coverage with wireless sensors. Wireless Networks 13(6) (2007)
 Lazos, L., Poovendran, R., Ritcey, J.A.: Probabilistic detection of mobile targets in heterogeneous sensor networks. In: IPSN 2007: Proceedings of the 6th international conference on Information processing in sensor networks, pp. 519–528. ACM, New York (2007) CrossRef
 Liu, B., Dousse, O., Wang, J., Saipulla, A.: Strong barrier coverage of wireless sensor networks. In: MobiHoc 2008: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing, pp. 411–420. ACM, New York (2008) CrossRef
 Meguerdichian, A., Koushanfar, F., Qu, G., Potkonjak, N.: Exposure in wireless adhoc sensor networks. In: Proc. of the 7th Annual International Conference on Mobile Computing and Networking (MobiCom 2001), pp. 139–150 (2001)
 Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.: Coverage problems in wireless adhoc sensor networks. In: Proc. of the 20th Annual Joint Conference of the IEEE Conference on Computer and Communications (INFOCOM 2001), vol. 3, pp. 1380–1387 (2001)
 Yuan, S., Vannat, S., Juex, J.P.: Minimumcolor path problems for reliability in mesh networks. In: Proc. 24th Annu. Joint Conf. of the IEEE Computer and Communications Societies (INFOCOM 2005), vol. 4, pp. 2658–2669 (2005)
 Title
 Approximating Barrier Resilience in Wireless Sensor Networks
 Book Title
 Algorithmic Aspects of Wireless Sensor Networks
 Book Subtitle
 5th International Workshop, ALGOSENSORS 2009, Rhodes, Greece, July 1011, 2009. Revised Selected Papers
 Pages
 pp 2940
 Copyright
 2009
 DOI
 10.1007/9783642054341_5
 Print ISBN
 9783642054334
 Online ISBN
 9783642054341
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 5804
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag Berlin Heidelberg
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors

 Shlomi Dolev ^{(16)}
 Editor Affiliations

 16. Department of Computer Science, Ben Gurion University of the Negev
 Authors

 Sergey Bereg ^{(17)}
 David Kirkpatrick ^{(18)}
 Author Affiliations

 17. Department of Computer Science, University of Texas at Dallas, USA
 18. Department of Computer Science, University of British Columbia, Canada
Continue reading...
To view the rest of this content please follow the download PDF link above.