@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 { ISI:000372921300019,
	title = {Efficient deployment quality analysis for intrusion detection in wireless sensor networks},
	journal = {WIRELESS NETWORKS},
	volume = {22},
	number = {3},
	year = {2016},
	month = {APR},
	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 coverage and connectivity in k-sensing detection of a wireless sensor network. We have proved the capability of our approach using a geometric analysis and a probabilistic model.},
	issn = {1022-0038},
	doi = {10.1007/s11276-015-1015-z},
	author = {Assad, Noureddine and Elbhiri, Brahim and Faqihi, Moulay Ahmed and Ouadou, Mohamed and Aboutajdine, Driss}
}
@article { ISI:000362266900001,
	title = {An Energy-Efficient Clustering Routing Algorithm Based on Geographic Position and Residual Energy for Wireless Sensor Network},
	journal = {JOURNAL OF COMPUTER NETWORKS AND COMMUNICATIONS},
	year = {2015},
	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 determine the clusters and to elect the cluster{\textquoteright}s heads of a WSN. The simulation results show that if the clusters are not constructed in an optimal way and/or the number of the clusters is greater or less than the optimal number of clusters, the total consumed energy of the sensor network per round is increased exponentially.},
	issn = {2090-7141},
	doi = {10.1155/2015/170138},
	author = {Jorio, Ali and El Fkihi, Sanaa and Elbhiri, Brahim 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}
}
@article { ISI:000339687600009,
	title = {Estimation of time card of collision (TTC) based on the optical flot in para-cadioptric vision},
	journal = {TRAITEMENT DU SIGNAL},
	volume = {31},
	number = {1-2},
	year = {2014},
	month = {JAN-JUN},
	pages = {197-219},
	issn = {0765-0019},
	author = {Benamar, Fatima Zahra and El Fkihi, Sanaa and Demonceaux, Cedric and Mouaddib, El Mustapha and Aboutajdine, Driss}
}
