Mohamed EL FISSAOUI

Mohamed EL FISSAOUI


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2019 in Procedia Computer Science
Verified
Journal Article
Open access
BCBadreddine Cherkaoui
Badreddine Cherkaoui
ABAbderrahim Beni-Hssane
Abderrahim Beni-Hssane
MFMohamed EL FISSAOUI
Mohamed EL FISSAOUI
MEMohammed Erritali
Mohammed Erritali

19 February 2018 in Journal of Ambient Intelligence and Humanized Computing
Verified
Journal Article
Closed access
PDF file
MFMohamed EL FISSAOUI
Mohamed EL FISSAOUI
ABAbderrahim Beni-Hssane
Abderrahim Beni-Hssane
MSMostafa Saadi
Mostafa Saadi

2 May 2018 in EURASIP Journal on Wireless Communications and Networking
Verified
Journal Article
Open access
PDF file
MFMohamed EL FISSAOUI
Mohamed EL FISSAOUI
ABAbderrahim Beni-Hssane
Abderrahim Beni-Hssane
MSMostafa Saadi
Mostafa Saadi
Mobile agent (MA)-based wireless sensor networks present a good alternative to the traditional client/server paradigm. Instead of sending the data gathered by each node to the sink as in client/server, MAs migrate to the sensor nodes (SNs) to collect data, thus reducing energy consumption and bandwidth usage. For MAs, to migrate among SNs, an itinerary should be planned before the migration. Many approaches have been proposed to solve the problem of itinerary planning for MAs, but all of these approaches are based on the assumption that MAs visit all SNs. This assumption, however, is inefficient because of the increasing size of the MAs after visiting each node. Also, in case of node(s) failure, as it is often the case in WSNs, the MAs may not be able to migrate among SNs. None of the proposed approaches takes into consideration the problem of fault tolerance. In this paper, we propose multi-mobile agent itinerary planning-based energy and fault aware data aggregation in wireless sensor networks (MAEF) to plan itineraries for MAs. This can be achieved by grouping nodes in clusters and planning itineraries efficiently among cluster heads (CHs) only. What is more, an alternative itinerary is planned in case of node(s) failure. The simulation result clearly shows that our novel approach performs better than the existing ones.

28 January 2021 in Journal of Ambient Intelligence and Humanized Computing
Verified
Journal Article
Closed access
PDF file
AEAnas El-Ansari
Anas El-Ansari
ABAbderrahim Beni-hssane
Abderrahim Beni-hssane
MSMostafa Saadi
Mostafa Saadi
MFMohamed EL FISSAOUI
Mohamed EL FISSAOUI

4 March 2020 in Archives of Computational Methods in Engineering
Verified
Journal Article
Closed access
PDF file
MFMohamed EL FISSAOUI
Mohamed EL FISSAOUI
ABAbderrahim Beni-hssane
Abderrahim Beni-hssane
SOSlimane Ouhmad
Slimane Ouhmad
KMKhalid El Makkaoui
Khalid El Makkaoui

1 January 2017 in Procedia Computer Science
Verified
Journal Article
Open access
MFMohamed EL FISSAOUI
Mohamed EL FISSAOUI
ABAbderrahim Beni-Hssane
Abderrahim Beni-Hssane
MSMostafa Saadi
Mostafa Saadi