@article {11387931120160401,
	title = {Efficient deployment quality analysis for intrusion detection in wireless sensor networks.},
	journal = {Wireless Networks (10220038)},
	volume = {22},
	number = {3},
	year = {2016},
	pages = {991 - 1006},
	abstract = {The intrusion detection in a Wireless Sensor Network is defined as a mechanism to monitor and detect any intruder in a sensing area. The sensor deployment quality is a critical issue since it reflects the cost and detection capability of a wireless sensor network. The quality of deterministic deployment can be determined sufficiently by a rigorous analysis before the deployment. However, when random deployment is required, determining the deployment quality becomes challenging. In the intrusion detection application, it is necessary to define more precise measures of sensing range, transmission range, and node density that impact overall system performance. The major question is centred around the quality of intrusion detection in WSN, how we can guarantee that each point of the sensing area is covered by at least one sensor node, and what a sufficient condition to guarantee the network connectivity? In this paper, we propose an appropriate probabilistic model which provides the cover},
	keywords = {Graph theory, Integer programming, Intrusion detection probability, Intrusion detection systems (Computer security), Multiple access protocols (Computer network protocols), Network connectivity, Network coverage, Quality of service, Sensing range, Transmission range, Wireless sensor networks},
	issn = {10220038},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=113879311\&site=ehost-live},
	author = {Assad, Noureddine and Elbhiri, Brahim and Faqihi, Moulay and Ouadou, Mohamed and Aboutajdine, Driss}
}
@article {10906318320150205,
	title = {Analysis of the Deployment Quality for Intrusion Detection in Wireless Sensor Networks.},
	journal = {Journal of Computer Networks \& Communications},
	volume = {2015},
	year = {2015},
	pages = {1 - 7},
	abstract = {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 int},
	keywords = {Intrusion detection systems (Computer security), Mathematical models, Probability theory, Wireless sensor networks, Wireless sensor nodes},
	issn = {20907141},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=109063183\&site=ehost-live},
	author = {Assad, Noureddine and Elbhiri, Brahim and Faqihi, Moulay Ahmed and Ouadou, Mohamed and Aboutajdine, Driss}
}
