A critical line based boundary surveillance strategy in wireless sensor networks

Environment monitoring is an important wireless sensor network application. A traditional method for such applications is to deploy sensors all over a region and aim to cover as much area as possible. However, this method is not only a great waste of money and resources, but also unnecessary and unrealistic. It also invokes many data collisions and places a serious burden on 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 a target or target event rather than tracking it. As coverage is an important factor impacting monitoring, we study boundary coverage capability under several conditions and consider different deployments of sensors. We also compare our surveillance strategy to the traditional one, and the results show that our strategy saves many sensors. Furthermore, we abstract a model of the problem, which provides an optimizing solution to surveillance applications.

[1]  Jie Li,et al.  A novel power control MAC protocol for mobile ad hoc networks , 2008, Int. J. Sens. Networks.

[2]  Tho Le-Ngoc,et al.  Power-efficient cooperative coding with hybrid-ARQ soft combining for wireless sensor networks in block-fading environment , 2008, Int. J. Sens. Networks.

[3]  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.

[4]  Victor C. M. Leung,et al.  Reliable and energy-efficient routing protocol in dense wireless sensor networks , 2008, Int. J. Sens. Networks.

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

[6]  Wesley E. Snyder,et al.  Secure target localisation in sensor networks using relaxation labelling , 2008, Int. J. Sens. Networks.

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

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

[9]  Xiaodong Wang,et al.  Energy efficiency of a per-hop relay selection scheme for sensor networks using cooperative MIMO , 2008, Int. J. Sens. Networks.

[10]  Vasilis Friderikos,et al.  Quality of service adaptation in mobile ad hoc networks , 2008, Int. J. Sens. Networks.

[11]  Yu Wang,et al.  Energy-efficient topology control for three-dimensional sensor networks , 2008, Int. J. Sens. Networks.

[12]  Charalampos Konstantopoulos,et al.  ABP: a low-cost, energy-efficient clustering algorithm for relatively static and quasi-static MANETs , 2008, Int. J. Sens. Networks.

[13]  Nicolas Krommenacker,et al.  Energy-efficient image transmission in sensor networks , 2008, Int. J. Sens. Networks.

[14]  Jiannong Cao,et al.  Hole-shadowing routing in large-scale MANETs , 2008, Int. J. Sens. Networks.

[15]  Haibin Yu,et al.  Investigating upper bounds on lifetime for target tracking sensor networks , 2008, Int. J. Sens. Networks.

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

[17]  Sagar Naik,et al.  Skipping technique in face routing for wireless ad hoc and sensor networks , 2008, Int. J. Sens. Networks.

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

[19]  Athanasios V. Vasilakos,et al.  Emerging techniques for wireless vehicular communications , 2011, Wirel. Commun. Mob. Comput..

[20]  Li Yin,et al.  Energy-efficient data gathering algorithm in sensor networks with partial aggregation , 2008, Int. J. Sens. Networks.

[21]  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 .

[22]  Gianluigi Ferrari,et al.  A simple performance analysis of RFID networks with binary tree collision arbitration , 2008, Int. J. Sens. Networks.

[23]  Ying Zhang,et al.  Coverage and Detection of a Randomized Scheduling Algorithm in Wireless Sensor Networks , 2010, IEEE Transactions on Computers.

[24]  Wassim El-Hajj,et al.  A fuzzy-based virtual backbone routing for large-scale MANETs , 2008, Int. J. Sens. Networks.

[25]  Yang Xiao,et al.  A boundary surveillance strategy based on critical line in wireless sensor networks , 2009, 2009 International Conference on Mechatronics and Automation.

[26]  Xiaojiang Du,et al.  Two and three-dimensional intrusion object detection under randomized scheduling algorithms in sensor networks , 2009, Comput. Networks.

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

[28]  Chang Wen Chen,et al.  Correlated data gathering in wireless sensor networks based on distributed source coding , 2008, Int. J. Sens. Networks.

[29]  Yang Xiao,et al.  Divide- and conquer-based surveillance framework using robots, sensor nodes, and RFID tags , 2011, Wirel. Commun. Mob. Comput..

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

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

[32]  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.

[33]  Edward Sazonov,et al.  Reservation-based protocol for monitoring applications using IEEE 802.15.4 sensor networks , 2008, Int. J. Sens. Networks.

[34]  Mohsen Guizani,et al.  Weak many vs. strong few: reducing BER through packet duplication in power-budgeted wireless connections , 2008, Int. J. Sens. Networks.

[35]  Songwu Lu,et al.  PEAS: a robust energy conserving protocol for long-lived sensor networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[36]  Peter Langendörfer,et al.  Public key cryptography empowered smart dust is affordable , 2008, Int. J. Sens. Networks.

[37]  Tat-Ming Lok,et al.  Cooperative protocols for multiple-source multiple-relay wireless networks , 2008, Int. J. Sens. Networks.

[38]  Lian Zhao,et al.  A hierarchical clustering-based routing protocol for wireless sensor networks supporting multiple data aggregation qualities , 2008, Int. J. Sens. Networks.

[39]  Roberto Pagliari,et al.  Decentralised binary detection with non-constant SNR profile at the sensors , 2008, Int. J. Sens. Networks.

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

[41]  Janelle J. Harms,et al.  Efficient aggregation using first hop selection in WSNs , 2008, Int. J. Sens. Networks.

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