Advertisement
Published in:
2019 | OriginalPaper | Chapter
A Markov Approximation Algorithm for Computation Offloading and Resource Scheduling in Mobile Edge Computing
Authors : Haowei Chen, Mengran Liu, Yunpeng Wang, Weiwei Fang, Yi Ding
Published in: Cyberspace Data and Intelligence, and Cyber-Living, Syndrome, and Health
Publisher: Springer Singapore
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
Mobile edge computing has become a key technology in IoT and 5G networks, which provides cloud-computing services in the edge of the mobile access network to realize the flexible use of computing and storage resources. While most existing research focuses on network optimization in small-scale scenes, this paper jointly considers the resources scheduling of servers, channels and powers for mobile users to minimize the system energy consumption. It’s an NP-hard problem which can only be solved through the exhaustive search with complexity of exponential level. The lightweight distributed algorithm proposed in this paper based on the Markov approximation framework can make the system converge to an approximate optimal solution with only linear level complexity. The simulation results show that the proposed algorithm is able to generate near-optimal solutions and outperform other benchmark algorithms.