Collaboration Improves the Capacity of Mobile Edge Computing

Abstract

This article studies the capacity of edge caching systems. Capacity is analyzed from the perspective of node mobility, caching, content popularity, etc., neglecting the influence of edge node cooperation on system performance. However, cooperation among edge nodes has been shown to substantially improve the system performance at the expense of a cooperation cost. Therefore, we attempt to maximize the capacity of mobile edge computing (MEC) subject to a budget constraint on the cooperation cost. We first transform the capacity maximization problem into a transmission distance minimization problem; then, we explore the average transmission distance of each source-to-destination pair under the assumption that the locations of the edge nodes follow a Poisson point process (PPP). We find that both the average transmission distance and the cooperation cost are associated with a key parameter, i.e., the number of content copies. We use the Lagrangian multiplier method to calculate the optimal copy number and propose a file allocation algorithm to store these copies. Finally, we analyze the influence of various parameters on the system capacity. The numerical results verify the efficiency of our solution compared with classic works.