Two-Tier Matching Game in Small Cell Networks for Mobile Edge Computing

Abstract

Mobile edge computing (MEC) enables computing services at the network edge closer to mobile users (MUs) to reduce network transmission latency and energy consumption. Deploying edge computing servers in small base stations (SBSs), operators make profit by offering MUs with computing services, while MUs purchase services to solve their own computation tasks quickly and energy-efficiently. In this context, it is of particular importance to optimize computing resource allocation and computing service pricing in each SBS, subject to its limited computing and communication resources. To address this issue, we formulate an optimization problem of computing resource management and trading in small-cell networks and tackle this problem using a two-tier matching. Specifically, the first tier targets at the association algorithm between MUs and SBSs to achieve maximum social welfare, and the second tier focuses on the collaboration algorithm among SBSs to make efficient usage of limited computing resources. We further show that the two proposed algorithms contribute to stable matchings and achieve weak Pareto optimality. In particular, we verify that the first algorithm arrives at a competitive equilibrium. Simulation results demonstrate that our proposed algorithms can achieve a better network social welfare than baseline algorithms while retaining a close-optimal performance.