Game Theory for Distributed Task Scheduling in Mist Computing

Mist computing addresses limitations in cloud and fog architectures by enabling computational resources closer to IoT devices, ensuring low latency and efficient resource utilization. Task scheduling in such environments poses challenges due to dynamic workloads, resource constraints, and network variability. This research introduces a game-theoretic framework for distributed task scheduling, leveraging non-cooperative game models to optimize resource allocation, reduce system latency, and improve energy efficiency. Through simulation-driven validation, the proposed mechanism demonstrates significant improvements in task completion time, resource utilization, and system scalability, paving the way for practical applications in IoT and real-time systems.

Authors

Institutions

Publication Details

Published
2025-06-20
DOI
https://doi.org/10.1109/conit65521.2025.11167778
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Game Theory for Distributed Task Scheduling in Mist Computing

Anjan Bandyopadhyay, Sujata Swain, Udita Singh, Harshit Singhania et al.
Distributed and Parallel Computing Systems
article

Game Theory for Distributed Task Scheduling in Mist Computing

Anjan Bandyopadhyay, Sujata Swain, Udita Singh, Harshit Singhania, Neeraj Sharma, Chinmay Kumar Ojha
article en

Abstract

Mist computing addresses limitations in cloud and fog architectures by enabling computational resources closer to IoT devices, ensuring low latency and efficient resource utilization. Task scheduling in such environments poses challenges due to dynamic workloads, resource constraints, and network variability. This research introduces a game-theoretic framework for distributed task scheduling, leveraging non-cooperative game models to optimize resource allocation, reduce system latency, and improve energy efficiency. Through simulation-driven validation, the proposed mechanism demonstrates significant improvements in task completion time, resource utilization, and system scalability, paving the way for practical applications in IoT and real-time systems.

Lovely Professional University (IN), KIIT University (IN)
Openalex Percentile: Top 70%
Distributed and Parallel Computing Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.