Jul 2026· International Conference on Future Internet of Things and Cloud· pp. 230-235· 0 citations· 12 references
Abstract
The rapid growth of Internet of Things (IoT) deployments has intensified the need for efficient, decentralized computation management at the network edge. This paper presents a lightweight, neighbor-aware one-hop task offloading framework designed for resource-constrained IoT networks. The proposed adaptive scheme combines Exponential Weighted Moving Average (EWMA) load estimation with a queue-depth gate to prevent unnecessary offloading under transient load spikes, and an assignment-pressure mechanism to distribute tasks more evenly across neighboring nodes. We evaluate the framework using a custom-developed discrete-event simulator on a 90-node ringplus-chord topology with heterogeneous hotspot and light nodes, comparing against three baselines: local-only execution, random offloading, and least-loaded neighbor selection. Results show that a load-aware but pressure-unaware least-loaded strategy surprisingly produces the highest load variance (377.25), worse than random offloading (114.84), due to severe task funneling toward persistently fast nodes. The proposed scheme eliminates task drops entirely, achieves an average latency of 148.7 ms, and reduces task-count variance to 44.33 - an $8.5 \times$ improvement over the least-loaded baseline and 4.6× over local-only execution - while requiring only 28.21% of tasks to be offloaded. These results demonstrate that assignment-pressure tracking is essential for fair load distribution in energy-limited IoT deployments.
The Internet of Things (IoT) has grown rapidly in recent years, enabling the interconnection of a large number of heterogeneous and distributed devices. This number is expected to exceed 70 billion according to Statista. With this massive scale, fulfilling complex IoT applications that require combinations of multiple...
Sirine Hakim, Sonia Yassa· International Conference on...· 0 citations
The results demonstrate that QoS-aware distributed work stealing matches the makespan of the evaluated centralised dynamic scheduler without placing it on the critical path, scales without performance degradation across the evaluated range of up to 64 devices, and achieves the highest and most consistent cluster utilis...
Jorge Coelho, L. Nogueira· Wireless networks· 0 citations
The rapid growth of Internet-of-Things (IoT) devices has increased the need for computing support close to end users, particularly for applications that cannot tolerate long processing delays or excessive energy consumption. Fog computing has emerged as a practical extension of the cloud to address these requirements,...
Ashish Bagla, Deepak Dagar, Pratik Srivastava· International Journal For Mu...· 0 citations
A lightweight, QoS-aware service placement algorithm that evaluates latency, bandwidth, and node load in real time is introduced that yields reduced latency and more consistent wait times relative to heuristic and genetic baselines.
Anshul Atre, K. Singh, Brijesh Kumar Chaurasia et al.· Journal of Circuits, Systems...· 0 citations
The key idea is to exploit the latency budget of tasks to control their execution timing, enabling a more balanced distribution of workload over time and reducing peak congestion across the continuum.
Keyvan Aghababaiyan, B. Coll-Perales, Javier Gozálvez· 0 citations
This article proposes Volunteer Edge, a cost-effective real-time task offloading framework that exploits underutilized computing resources of privately managed nodes to execute offloaded workloads and reduces edge rental costs by 54.0% on average compared with conventional public-edge-based offloading while maintaining...