Barrier Counting in Mixed Wireless Sensor Networks

Barrier coverage problems in sensor networks involve detecting intruders that attempt to cross a region of interest. In this paper, we formulate the k-connect barrier count problem for Mixed Sensor Networks (MSNs). The k-connect barrier count problem is to find the maximum number of barriers in an arbitrary MSN where at most k distinct mobile sensors can be used to construct any given virtual edge used in a barrier. We present the solution for the k-connect barrier count problem for k ∈ {0, 1, 2} via Integer Linear Programming. Using simulation results, we show that as k increases, the density of sensors required to achieve barrier coverage decreases. The results quantitatively demonstrate the benefits of mobile sensors.

[1]  Anish Arora,et al.  Barrier coverage with wireless sensors , 2005, MobiCom '05.

[2]  Miodrag Potkonjak,et al.  Minimal and maximal exposure path algorithms for wireless embedded sensor networks , 2003, SenSys '03.

[3]  Miodrag Potkonjak,et al.  Exposure in Wireless Sensor Networks: Theory and Practical Solutions , 2002, Wirel. Networks.

[4]  Xiang-Yang Li,et al.  Coverage in Wireless Ad Hoc Sensor Networks , 2003, IEEE Trans. Computers.

[5]  Ai Chen,et al.  Designing localized algorithms for barrier coverage , 2007, MobiCom '07.

[6]  Douglas W. Gage,et al.  Command Control for Many-Robot Systems , 1992 .

[7]  Béla Bollobás,et al.  Reliable density estimates for coverage and connectivity in thin strips of finite length , 2007, MobiCom '07.

[8]  Jie Wang,et al.  Strong barrier coverage of wireless sensor networks , 2008, MobiHoc '08.

[9]  Guoliang Xing,et al.  Barrier coverage with sensors of limited mobility , 2010, MobiHoc '10.

[10]  Miodrag Potkonjak,et al.  Coverage problems in wireless ad-hoc sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).