Analysis of the Deployment Quality for Intrusion Detection in Wireless Sensor Networks

The intrusion detection application in a homogeneous wireless sensor network is defined as a mechanism to detect unauthorized intrusions or anomalous moving attackers in a field of interest. The quality of deterministic sensor nodes deployment can be determined sufficiently by a rigorous analysis before the deployment. However, when random deployment is required, determining the deployment quality becomes challenging. An area may require that multiple nodes monitor each point from the sensing area; this constraint is known as k-coverage where k is the number of nodes. The deployment quality of sensor nodes depends directly on node density and sensing range; mainly a random sensor nodes deployment is required. The major question is centred around the problem of network coverage, how can we guarantee that each point of the sensing area is covered by the required number of sensor nodes and what a sufficient condition to guarantee the network coverage? To deal with this, probabilistic intrusion detection models are adopted, called single/multi-sensing detection, and the deployment quality issue is surveyed and analysed in terms of coverage. We evaluate the capability of our probabilistic model in homogeneous wireless sensor network, in terms of sensing range, node density, and intrusion distance.

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

[2]  Jie Jia,et al.  Exploiting sensor redistribution for eliminating the energy hole problem in mobile sensor networks , 2012, EURASIP J. Wirel. Commun. Netw..

[3]  Guoliang Xing,et al.  Integrated coverage and connectivity configuration for energy conservation in sensor networks , 2005, TOSN.

[4]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[5]  Sandeep Mann,et al.  Coverage in Wireless Sensor Networks : A Survey , 2013 .

[6]  Lachlan L. H. Andrew,et al.  Connectivity, Coverage and Placement in Wireless Sensor Networks , 2009, Sensors.

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

[8]  Vlady Ravelomanana,et al.  Extremal properties of three-dimensional sensor networks with applications , 2004, IEEE Transactions on Mobile Computing.

[9]  Xue Zhang,et al.  Topology Control for Wireless Sensor Networks , 2007 .

[10]  Chee-Yee Chong,et al.  Sensor networks: evolution, opportunities, and challenges , 2003, Proc. IEEE.

[11]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2005, Mob. Networks Appl..

[12]  Donald F. Towsley,et al.  A study of the coverage of large-scale sensor networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[13]  Hakan Deliç,et al.  How many sensors for an acceptable breach detection probability? , 2006, Comput. Commun..

[14]  Prasant Mohapatra,et al.  Power conservation and quality of surveillance in target tracking sensor networks , 2004, MobiCom '04.

[15]  Yu-Chee Tseng,et al.  The Coverage Problem in a Wireless Sensor Network , 2003, WSNA '03.

[16]  Liu Gang,et al.  Topology Control for Wireless Sensor Networks , 2007, 2007 IFIP International Conference on Network and Parallel Computing Workshops (NPC 2007).

[17]  József Balogh,et al.  On k−coverage in a mostly sleeping sensor network , 2008, Wirel. Networks.