A boundary surveillance strategy based on critical line in wireless sensor networks

Environment monitoring is an important class of wireless sensor networks applications. A traditional way for such applications is to deploy sensors all over a region and always aim to cover as more area as possible. However, this way is not only a great waste of money and recourses but also unnecessary and unrealistic. It also invokes many data collisions and brings serious burden to the network protocols. In this paper, we propose a critical line based environment surveillance strategy. We deploy sensors along critical lines instead of all over the region. Our aim is to capture or detect the target or target event rather than tracking it. As coverage is an important factor impacting monitoring, we study the boundary coverage capability under several conditions with consideration of different deploying methods of sensors. We also compare our surveillance strategy with the traditional way, and the results show that our strategy saves great amount of sensors in our strategy.

[1]  Mingyan Liu,et al.  Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[2]  Songwu Lu,et al.  PEAS: a robust energy conserving protocol for long-lived sensor networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[3]  Sudarshan S. Chawathe,et al.  Organizing Hot-Spot Police Patrol Routes , 2007, 2007 IEEE Intelligence and Security Informatics.

[4]  Yang Xiao,et al.  IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, PAPER ID: TPDS-0307-0605.R1 1 Random Coverage with Guaranteed Connectivity: Joint Scheduling for Wireless Sensor Networks , 2022 .

[5]  Yang Xiao,et al.  WSN10-3: Maximizing Network Lifetime under QoS Constraints in Wireless Sensor Networks , 2006, IEEE Globecom 2006.

[6]  Yang Xiao,et al.  Modeling Detection Metrics in Randomized Scheduling Algorithm in Wireless Sensor Networks , 2007, 2007 IEEE Wireless Communications and Networking Conference.

[7]  Himanshu Gupta,et al.  Connected sensor cover: self-organization of sensor networks for efficient query execution , 2003, IEEE/ACM Transactions on Networking.

[8]  Yang Xiao,et al.  Lightweight Deployment-Aware Scheduling for Wireless Sensor Networks , 2005, Mob. Networks Appl..

[9]  R. Srikant,et al.  Unreliable sensor grids: coverage, connectivity and diameter , 2005, Ad Hoc Networks.

[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).

[11]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration in wireless sensor networks , 2003, SenSys '03.

[12]  Di Tian,et al.  A coverage-preserving node scheduling scheme for large wireless sensor networks , 2002, WSNA '02.

[13]  Peter Braß.  Bounds on coverage and target detection capabilities for models of networks of mobile sensors , 2007, TOSN.

[14]  Miodrag Potkonjak,et al.  Power efficient organization of wireless sensor networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[15]  Jennifer C. Hou,et al.  Maintaining Sensing Coverage and Connectivity in Large Sensor Networks , 2005, Ad Hoc Sens. Wirel. Networks.

[16]  Ashish Goel,et al.  Set k-cover algorithms for energy efficient monitoring in wireless sensor networks , 2003, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.