Skip to content

TELECOM: Latency-Aware Load-Balanced Task Offloading in Vehicular Fog Computing

Nov 2026 · IEEE Internet of Things Journal · Vol 13, pp. 50188-50207 · 0 citations · 40 references

Abstract

Task execution latency in Internet of Things (IoT) frameworks remains a critical challenge. In this regard, fog computing was introduced as a suitable strategy to bring data processing centers closer to the edge and reduce latency. One application of fog computing is vehicular fog computing (VFC), whose primary objective is to help mitigate computational limitations of vehicles connected to this structure and their lack of full environmental awareness. With the constant expansion of communication networks, the widespread implementation of VFC still faces various challenges. One of these challenges is the increased distance of vehicles from the execution location of assigned tasks, which leads to the migration phenomenon. Another challenge is managing the significant workload offloaded to the fog nodes while meeting the execution time requirements and offering better availability levels. In this research, we have proposed TELECOM, a task offloading algorithm that takes a unique approach and introduces a communication-aware interzone service model to reduce the dependency on explicit task migration and maintain service continuity under mobility-induced zone changes. The mobility model for edge and vehicular fog nodes is obtained using real-world scenarios. The goal is to reduce latency and balance the task execution so that tasks are distributed proportionally between nodes without causing overload. TELECOM improved the network’s latency by an average of 37.72% and load balancing by an average of 17.94% compared to other methods. In addition, availability was also improved by an average of 33.73% and 32.35% when considering 2- and 4-s thresholds, respectively.

View source

Similar papers

#computer vision Review Sep 2017

Agile Software Development Methods: Review and Analysis

This publication proposes a definition and a classification of agile software development approaches and analyses ten software development methods that can be characterized as being "agile" against the defined criterion.

P. Abrahamsson, O. Salo, Jussi Ronkainen et al. · 727 citations · ⚡54
#computer vision Jun 2008

The impact of agile practices on communication in software development

The study shows that agile practices improve both informal and formal communication, but indicates that, in larger development situations involving multiple external stakeholders, a mismatch of adequate communication mechanisms can sometimes even hinder the communication.

M. Pikkarainen, Jukka Haikara, O. Salo et al. · 401 citations · ⚡48
#machine learning Review Open access Oct 2014

Software development in startup companies: A systematic mapping study

The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.

Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al. · 394 citations · ⚡54

Related blog posts

Microsoft Research Blog Oct 29, 2026

Microsoft Research Focus – Edition #97

Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

Microsoft Research Blog Oct 21, 2026

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.