Djamila Mechta
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Djamila Mechta has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Saad Harous
Department of Computer science, University of Sharjah, Sharjah, United Arab Emirates
11 shared publications - Lemia Louail
Université de Lorraine, CNRS, CRAN, Nancy, France
7 shared publications - Sara Hebal
Setif 1 University Ferhat Abbas
6 shared publications - Lina Benchikh
LRSD Laboratory, Faculty of Sciences, University Ferhat Abbas Sétif 1, Setif, Algeria
3 shared publications Saad Harous
Department of Computer Science, College of Computing and Informatics University of Sharjah Sharjah United Arab Emirates
3 shared publications- Assala Nacef
LRSD Laboratory, Department of Computer Science, Faculty of Sciences, University Ferhat Abbas Setif 1, Sétif, Algeria
2 shared publications
Latest Publications
- 19 November 2025
- Published by Elsevier in Computers and Electrical Engineering
- Vol. 129
Prosumers matching and energy routing through Yens and SOS algorithms in P2P energy trading systems
- 19 November 2025
- Published by Elsevier in Computers and Electrical Engineering
- Vol. 129
Prosumers matching and energy routing through Yens and SOS algorithms in P2P energy trading systems
- 10 October 2025
- Published by Springer Nature in Energy Efficiency
- Vol. 18 (7) , 1-42
Advancements in optimization strategies for energy routing, demand response, and load forecasting in energy internet and smart grid: an overview
- 10 October 2025
- Published by Springer Nature in Energy Efficiency
- Vol. 18 (7) , 1-42
Advancements in optimization strategies for energy routing, demand response, and load forecasting in energy internet and smart grid: an overview
- 29 September 2025
- Published by Springer Nature in Cluster Computing
- Vol. 28 (14) , 1-24
A quantum genetic-based routing protocol for real-time peer-to-peer energy transactions
- 29 September 2025
- Published by Springer Nature in Cluster Computing
- Vol. 28 (14) , 1-24
A quantum genetic-based routing protocol for real-time peer-to-peer energy transactions
- Top Cited Papers
- 25 February 2025
- Published by Springer Nature in Cluster Computing
- Vol. 28 (4) , 1-25
Network Intrusion Detection System Using Convolutional Neural Networks: NIDS-DL-CNN for IoT Security
- 25 February 2025
- Published by Springer Nature in Cluster Computing
- Vol. 28 (4) , 1-25
Top Cited PapersNetwork Intrusion Detection System Using Convolutional Neural Networks: NIDS-DL-CNN for IoT Security
- 5 February 2025
- Published by Springer Nature
- p. 14-28
A Semi-decentralized Congestion-Free Multi-path Energy Routing for P2P Energy Trading Systems
- 5 February 2025
- Published by Springer Nature
- p. 14-28
A Semi-decentralized Congestion-Free Multi-path Energy Routing for P2P Energy Trading Systems
- 3 June 2024
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 80 (14) , 20583-20639
A comparative study of energy routing algorithms to optimize energy transmission in energy internet
- 3 June 2024
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 80 (14) , 20583-20639
A comparative study of energy routing algorithms to optimize energy transmission in energy internet
- 8 April 2024
- Published by Springer Nature in Energy Systems
- Vol. 17 (1) , 277-314
A survey on energy routing approaches in energy internet
- 8 April 2024
- Published by Springer Nature in Energy Systems
- Vol. 17 (1) , 277-314
A survey on energy routing approaches in energy internet
- 14 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 162-167
Tasks classification across edge servers nodes using K-means With multi-objective constraints Chebyshev distance
Edge computing provides benefits such as reduced latency by processing data closer to its source, but it faces challenges due to limited processing power, memory, and storage capacity. To address these limitations and enhance system efficiency, task classification becomes crucial in edge computing. By categorizing tasks, resources can be allocated effectively. This paper presents a novel approach for classifying tasks and edge servers based on CPU and memory capacities. The proposed model treats tasks and edge servers as points and applies the K-means method by adding multi-objective constraints Chebyshev distance. The distance metric considers two objectives: the distance between points and the number of tasks and edge servers. Unlike traditional K-means algorithms that often result in clusters with either one server or clusters without servers, our model ensures that nearly every cluster contains at least one server. Simulation results demonstrate the fast convergence of the proposed model, evaluated through clustering using inertia and silhouette coefficient. It is important to note that this classification does not directly influence task scheduling or resource allocation processes. Instead, it serves as a preliminary step to improve the effectiveness of these subsequent processes. By strategically placing more powerful tasks on higher-capacity servers, and vice versa, our approach aims to reduce the workload of the scheduler and enhance resource allocation or task scheduling. This classification framework has the potential to achieve efficient task and resource management in edge computing environments.
- 14 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 162-167
Tasks classification across edge servers nodes using K-means With multi-objective constraints Chebyshev distance
Edge computing provides benefits such as reduced latency by processing data closer to its source, but it faces challenges due to limited processing power, memory, and storage capacity. To address these limitations and enhance system efficiency, task classification becomes crucial in edge computing. By categorizing tasks, resources can be allocated effectively. This paper presents a novel approach for classifying tasks and edge servers based on CPU and memory capacities. The proposed model treats tasks and edge servers as points and applies the K-means method by adding multi-objective constraints Chebyshev distance. The distance metric considers two objectives: the distance between points and the number of tasks and edge servers. Unlike traditional K-means algorithms that often result in clusters with either one server or clusters without servers, our model ensures that nearly every cluster contains at least one server. Simulation results demonstrate the fast convergence of the proposed model, evaluated through clustering using inertia and silhouette coefficient. It is important to note that this classification does not directly influence task scheduling or resource allocation processes. Instead, it serves as a preliminary step to improve the effectiveness of these subsequent processes. By strategically placing more powerful tasks on higher-capacity servers, and vice versa, our approach aims to reduce the workload of the scheduler and enhance resource allocation or task scheduling. This classification framework has the potential to achieve efficient task and resource management in edge computing environments.
- 17 June 2023
- Published by Springer Nature
- p. 418-432
Subscriber Matching in Energy Internet Using the Firefly Algorithm
- 17 June 2023
- Published by Springer Nature
- p. 418-432
Subscriber Matching in Energy Internet Using the Firefly Algorithm
- 4 December 2021
- Published by Wiley in International Journal of Communication Systems
- Vol. 35 (4) , e5055
ACOMAR: ACO‐based MAC‐aware routing protocol
Summary: In this work, we present a new nature‐inspired cross‐layer routing protocol named ACO‐based MAC‐aware routing protocol (ACOMAR). An enhancement of time division multiple access (TDMA) algorithm is proposed where slots allocation algorithm considers the geographical distance between nodes and the sink. The nodes that are far away from the sink have better chance to be scheduled first. This strategy will result in more efficiency than a usual random TDMA schedule. This algorithm uses a metric based on the pheromone's value of Ant Colony Optimization (ACO) to choose the best next hop with the aim of reducing latency and energy and extending the network lifetime. Comparisons are made between ACOMAR, MAC‐aware routing (MAR) and the latest cross‐layer protocol latency and energy MAC‐aware routing (LEMAR). The experimental results show that ACOMAR outperforms considerably LEMAR by 80%, 20%, 81%, and 54% in latency, energy, hop count, and throughput, respectively. Consequently, ACOMAR is a suitable solution for healthcare applications where WSN‐based critical IoT devices interact quickly in emergence cases (high rate in latency optimization 80%).
- 4 December 2021
- Published by Wiley in International Journal of Communication Systems
- Vol. 35 (4) , e5055
ACOMAR: ACO‐based MAC‐aware routing protocol
Summary: In this work, we present a new nature‐inspired cross‐layer routing protocol named ACO‐based MAC‐aware routing protocol (ACOMAR). An enhancement of time division multiple access (TDMA) algorithm is proposed where slots allocation algorithm considers the geographical distance between nodes and the sink. The nodes that are far away from the sink have better chance to be scheduled first. This strategy will result in more efficiency than a usual random TDMA schedule. This algorithm uses a metric based on the pheromone's value of Ant Colony Optimization (ACO) to choose the best next hop with the aim of reducing latency and energy and extending the network lifetime. Comparisons are made between ACOMAR, MAC‐aware routing (MAR) and the latest cross‐layer protocol latency and energy MAC‐aware routing (LEMAR). The experimental results show that ACOMAR outperforms considerably LEMAR by 80%, 20%, 81%, and 54% in latency, energy, hop count, and throughput, respectively. Consequently, ACOMAR is a suitable solution for healthcare applications where WSN‐based critical IoT devices interact quickly in emergence cases (high rate in latency optimization 80%).