Computation Offloading Scheduling Using Game Abstraction in Ultra-dense Networks

Ultra-dense networks are a key technology for 5G, characterized by having more cells than active users. However, as the density of small cell base stations (SBS) increases, ultra-dense networks introduce challenges in the exploration of resource allocation methods, particularly with respect to computational complexity and network scalability. To address these issues, this paper proposes a computation offloading and scheduling model for each SBS in ultra-dense networks. Specifically, in the proposed model, each SBS receives computing tasks from mobile devices and stores them in a queue buffer. Subsequently, each SBS first determines how many tasks need to be processed locally and whether offloading them is necessary. To tackle the complexity of this decision-making process, we employ game theory abstraction to reduce the large-scale state space and design a fast, adaptive computation offloading algorithm (FACOA). This algorithm enables each SBS to learn efficiently and quickly adapt to strategy changes made by other SBSs. Finally, simulation and experiments show that the proposed algorithm shorten the convergence time by 6 times.

Authors

Institutions

Publication Details

Published
2024-12-13
DOI
https://doi.org/10.1109/hpcc64274.2024.00040
Primary Topic
IoT and Edge/Fog Computing
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Computation Offloading Scheduling Using Game Abstraction in Ultra-dense Networks

Luxiu Yin, Ying Qiao, Chun Wang, Juan Luo
IoT and Edge/Fog Computing
article

Computation Offloading Scheduling Using Game Abstraction in Ultra-dense Networks

Luxiu Yin, Ying Qiao, Chun Wang, Juan Luo
article en

Abstract

Ultra-dense networks are a key technology for 5G, characterized by having more cells than active users. However, as the density of small cell base stations (SBS) increases, ultra-dense networks introduce challenges in the exploration of resource allocation methods, particularly with respect to computational complexity and network scalability. To address these issues, this paper proposes a computation offloading and scheduling model for each SBS in ultra-dense networks. Specifically, in the proposed model, each SBS receives computing tasks from mobile devices and stores them in a queue buffer. Subsequently, each SBS first determines how many tasks need to be processed locally and whether offloading them is necessary. To tackle the complexity of this decision-making process, we employ game theory abstraction to reduce the large-scale state space and design a fast, adaptive computation offloading algorithm (FACOA). This algorithm enables each SBS to learn efficiently and quickly adapt to strategy changes made by other SBSs. Finally, simulation and experiments show that the proposed algorithm shorten the convergence time by 6 times.

Hunan University of Science and Technology (CN), Hunan University (CN), Hunan Normal University (CN), Changsha Normal University (CN)
National Natural Science Foundation of China, Natural Science Foundation of Hunan Province
Openalex Percentile: Top 64%
IoT and Edge/Fog Computing
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.