Approximating Barrier Resilience in Wireless Sensor Networks
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 k-barrier 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 k-barrier 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 one-third 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 one-half 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.
KeywordsSensor Network Short Path Wireless Sensor Network Coverage Region Arbitrary Region
Unable to display preview. Download preview PDF.
- 1.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)Google Scholar
- 2.Carr, R.D., Doddi, S., Konjevod, G., Marathe, M.: On the red-blue set cover problem. In: Proc. 11th ACM-SIAM Symp. on Discr. Algor., pp. 345–353 (2000)Google Scholar
- 3.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)Google Scholar
- 6.Gage, D.W.: Command control for many-robot systems. In: Proc. 19th Annu. AUVS Tech. Symp., AUVS 1992, Hunstville AL, pp. 28–34 (1992)Google Scholar
- 7.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)Google Scholar
- 9.Kloder, S., Hutchinson, S.: Barrier coverage for variable bounded-range line-of-sight guards. In: Proc. of IEEE International Conference on Robotics and Automation (ICRA 2007), pp. 391–396 (2007)Google Scholar
- 10.Kumar, S.: Foundations of coverage in wireless sensor networks. PhD thesis, Columbus, OH, USA, Adviser-Lai, Ten H (2006)Google Scholar
- 11.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)Google Scholar
- 12.Kumar, S., Lai, T.H., Arora, A.: Barrier coverage with wireless sensors. Wireless Networks 13(6) (2007)Google Scholar
- 15.Meguerdichian, A., Koushanfar, F., Qu, G., Potkonjak, N.: Exposure in wireless ad-hoc sensor networks. In: Proc. of the 7th Annual International Conference on Mobile Computing and Networking (MobiCom 2001), pp. 139–150 (2001)Google Scholar
- 16.Meguerdichian, S., Koushanfar, F., Potkonjak, M., Srivastava, M.: Coverage problems in wireless ad-hoc 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)Google Scholar
- 17.Yuan, S., Vannat, S., Juex, J.P.: Minimum-color 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)Google Scholar