Naouri, Abdenacer, Nouri, Nabil Abdelkader, Khelloufi, Amar, Sada, Abdelkarim Ben, Ning, Huansheng and Dhelim, Sahraoui
ORCID: 0000-0002-3620-1395
(2024)
Efficient fog node placement using nature-inspired metaheuristic for IoT applications.
Cluster Computing, 27
(6).
pp. 8225-8241.
ISSN 1386-7857
Abstract
Managing the explosion of data from the edge to the cloud requires intelligent supervision, such as fog node deployments, which is an essential task to assess network operability. To ensure network operability, the deployment process must be carried out effectively regarding two main factors: connectivity and coverage. The network connectivity is based on fog node deployment, which determines the network’s physical topology, while the coverage determines the network accessibility. Both have a significant impact on network performance and guarantee the network quality of service. Determining an optimum fog node deployment method that minimizes cost, reduces computation and communication overhead, and provides a high degree of network connection coverage is extremely hard. Therefore, maximizing coverage and preserving network connectivity is a non-trivial problem. In this paper, we propose a fog deployment algorithm that can effectively connect the fog nodes and cover all edge devices. Firstly, we formulate fog deployment as an instance of multi-objective optimization problems with a large search space. Then, we leverage Marine Predator Algorithm (MPA) to tackle the deployment problem and prove that MPA is well-suited for fog node deployment due to its rapid convergence and low computational complexity, compared to other population-based algorithms. Finally, we evaluate the proposed algorithm on a different benchmark of generated instances with various fog scenario configurations. Our algorithm outperforms state-of-the-art methods, providing promising results for optimal fog node deployment. It demonstrates a 50% performance improvement compared to other algorithms, aligning with the No Free Lunch Theorem (NFL Theorem) Theorem’s assertion that no algorithm has a universal advantage across all problem domains. This underscores the significance of selecting tailored algorithms based on specific problem characteristics.
Metadata
| Item Type: | Article (Published) |
|---|---|
| Refereed: | Yes |
| Subjects: | Computer Science > Algorithms Computer Science > Artificial intelligence Computer Science > Computer networks Computer Science > Machine learning |
| DCU Faculties and Centres: | DCU Faculties and Schools > Faculty of Engineering and Computing DCU Faculties and Schools > Faculty of Engineering and Computing > School of Computing |
| Publisher: | Springer New York LLC |
| Official URL: | https://link.springer.com/article/10.1007/s10586-0... |
| Copyright Information: | Authors |
| ID Code: | 32444 |
| Deposited On: | 20 Mar 2026 15:25 by Sahraoui Dhelim . Last Modified 20 Mar 2026 15:25 |
Documents
Full text available as:
Preview |
PDF
- Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Creative Commons: Attribution 4.0 1MB |
Metrics
Altmetric Badge
Dimensions Badge
Downloads
Downloads
Downloads per month over past year
Archive Staff Only: edit this record