Premium
Online combinatorial based mechanism for MEC network resource allocation
Author(s) -
Wu Xiaogang,
Jiang Weiheng,
Zhang Yu,
Yu Wanxin
Publication year - 2019
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.3928
Subject(s) - computer science , resource allocation , combinatorial auction , mathematical optimization , auction algorithm , resource management (computing) , greedy algorithm , mobile edge computing , resource (disambiguation) , distributed computing , enhanced data rates for gsm evolution , computer network , algorithm , auction theory , common value auction , revenue equivalence , artificial intelligence , statistics , mathematics
Summary In this paper, the resource allocation problem for mobile edge computing (MEC) network is discussed. We focus on the design of online resource allocation strategy by considering the time‐varying demands of the combinatorial resources for the mobile users. To handle this issue, at first, a time splitting‐based online allocation mechanism is introduced. Then, for a given resource allocation period of the time splitting, a combinatorial auction mechanism for the combination resources allocation is proposed. We further prove that the proposed combinatorial auction is both individual rational and incentive‐compatible, and which can bring a higher revenue to the service provider. In order to verify the performance of the proposed mechanism, a variable‐relaxed‐based performance‐bound algorithm and a greedy optimization‐based suboptimal algorithm are presented for comparison purpose. Finally, the performance of these proposed algorithms are testified by numerical simulations, which confirm the analysis results.