Edge and Fog Computing for IoT: Architectures, Applications, and Emerging Trends
Bibliographic record
Abstract
The rapid expansion of the Internet of Things (IoT) devices has produced a new amount of data that requires efficient, low latency, and scalable computing systems. The demanding needs of real-time and latency-sensitive applications cannot always be satisfied with the traditional cloud-centric architecture, which is why decentralized computing paradigms are required. Edge and fog computing have become complementary to each other and they allow processing of data nearer to the source and reduce latency, optimize bandwidth, improve reliability and privacy. This survey gives an insight into the essential concepts, architectures, and key technologies as well as communication models of edge and fog computing. It examines their uses across multiple fields such as smart cities, industrial IoT, medical care, transportation, as well as agriculture and points out the performance measures that are important to the assessment of such systems. Along with that, the paper explains the key challenges, including scalability, heterogeneity, security, and resource management, and lists the emerging trends, including the combination of AI and machine learning, next-generation networks, blockchain, energy-efficient designs, and federated learning. This survey would synthesize what is currently known about edge and fog computing and point out the directions that future research needs to take in order to help researchers and practitioners harness the power of edge and fog computing technologies to create intelligent, safe, and also sustainable IoT ecosystems.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.003 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.006 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".