Online combinatorial based mechanism for MEC network resource allocation

Abstract

SummaryIn 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.