Dynamic fog node placement optimization using adaptive dynamic pufferfish optimization for real-time IoT networks

0Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The exponential growth of Internet of Things (IoT) deployments demands fog computing architectures that position computational resources at the network edge to ensure low-latency processing. However, optimal fog node placement in dynamic environments remains a significant challenge due to node mobility, random failures, and fluctuating traffic patterns, which require continuous adaptation to maintain service quality. This paper introduces the Dynamic Pufferfish Optimization Algorithm (D-POA), a bio-inspired metaheuristic that leverages behavioral strategies observed in pufferfish species to adaptively reposition fog nodes in real-time, balancing exploration of the solution space with refinement of promising configurations. D-POA formulates the placement problem as a continuous multi-objective optimization that simultaneously addresses network connectivity, area coverage, and movement costs to minimize service disruption during reconfiguration. Comprehensive experimental evaluation across five dynamic scenarios demonstrates that D-POA achieves 97.8% connectivity and 98.4% coverage while reducing movement costs by 38–57% compared to baseline algorithms, with near-linear scalability maintaining over 96% solution quality across networks ranging from 50 to 1000 nodes.

Cite

CITATION STYLE

APA

Abu-Ein, A. A., Al-Hazaimeh, O. M., Tawfik, M., & Fathi, I. S. (2026). Dynamic fog node placement optimization using adaptive dynamic pufferfish optimization for real-time IoT networks. Scientific Reports, 16(1). https://doi.org/10.1038/s41598-026-41740-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free