@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}
}
@article {10906318420150210,
	title = {An Energy-Efficient Clustering Routing Algorithm Based on Geographic Position and Residual Energy for Wireless Sensor Network.},
	journal = {Journal of Computer Networks \& Communications},
	volume = {2015},
	year = {2015},
	pages = {1 - 11},
	abstract = {Recently wireless sensor network (WSN) has become one of the most interesting networking technologies, since it can be deployed without communication infrastructures. A sensor network is composed of a large number of sensor nodes; these nodes are responsible for supervision of the physical phenomenon and transmission of the periodical results to the base station. Therefore, improving the energy efficiency and maximizing the networking lifetime are the major challenges in this kind of networks. To deal with this, a hierarchical clustering scheme, called Location-Energy Spectral Cluster Algorithm (LESCA), is proposed in this paper. LESCA determines automatically the number of clusters in a network. It is based on spectral classification and considers both the residual energy and some properties of nodes. In fact, our approach uses the K-ways algorithm and proposes new features of the network nodes such as average energy, distance to BS, and distance to clusters centers in order to deter},
	keywords = {Data transmission systems, Energy consumption, Routing algorithms, Wireless sensor networks, Wireless sensor nodes},
	issn = {20907141},
	url = {http://search.ebscohost.com/login.aspx?direct=true\&db=iih\&AN=109063184\&site=ehost-live},
	author = {Jorio, Ali and El Fkihi, Sanaa and Elbhiri, Brahim and Aboutajdine, Driss}
}
