Computation Offloading and Server Deployment in Heterogeneous Mobile Edge Computing Networks

This paper considers the cost minimization problem in a heterogeneous mobile edge computing network, where the macro base stations are scattered over the ground to ensure the service coverage, and the small base stations are clustered around the user hotspots to improve the users’ quality of service. Specifically, the network-wide communication and computation performance are analyzed using stochastic geometry and queueing theory. Taking the obtained performance metrics as constraints, a cost minimization problem is formulated. To solve the formulated problem, we propose a globally optimal algorithm, whose optimality and complexity are theoretically analyzed. Then, to further reduce the computational complexity, the problem is reformulated as the difference of convex programming problems, which can be addressed by the concave-convex procedure. Numerical simulations verify the accuracy of the theoretical results and illustrate the superiority of the proposed algorithms.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Communications
Published
2025-05-08
DOI
https://doi.org/10.1109/tcomm.2025.3568225
Citations
1
Primary Topic
IoT and Edge/Fog Computing
Type
article
Field-Weighted Citation Impact
1.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Computation Offloading and Server Deployment in Heterogeneous Mobile Edge Computing Networks

Long Yang, Lu Lv, Min Hui, Jian Chen et al.
1 citations
IEEE Transactions on Communications
IoT and Edge/Fog Computing
1.49
article

Computation Offloading and Server Deployment in Heterogeneous Mobile Edge Computing Networks

Long Yang, Lu Lv, Min Hui, Jian Chen, Zhiguo Ding, Yun Hou
article en
1 citations

Abstract

This paper considers the cost minimization problem in a heterogeneous mobile edge computing network, where the macro base stations are scattered over the ground to ensure the service coverage, and the small base stations are clustered around the user hotspots to improve the users’ quality of service. Specifically, the network-wide communication and computation performance are analyzed using stochastic geometry and queueing theory. Taking the obtained performance metrics as constraints, a cost minimization problem is formulated. To solve the formulated problem, we propose a globally optimal algorithm, whose optimality and complexity are theoretically analyzed. Then, to further reduce the computational complexity, the problem is reformulated as the difference of convex programming problems, which can be addressed by the concave-convex procedure. Numerical simulations verify the accuracy of the theoretical results and illustrate the superiority of the proposed algorithms.

IEEE Transactions on CommunicationsVol. 73(11)
Xidian University (CN), Khalifa University of Science and Technology (AE), Hang Seng University of Hong Kong (HK), University of Hong Kong (HK)
Openalex Percentile: Top 18%
IoT and Edge/Fog Computing
1.49
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.