ArticleScientific reports2026
Dynamic fog node placement optimization using adaptive dynamic pufferfish optimization for real-time IoT networks.
Article in Scientific reports, 2026. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
4 authors.
Funding
No grant is acknowledged in the PubMed record.
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.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.