Two-dimensional dynamic matching algorithm for mobile edge computing in intelligent mine

Abstract

In the application of mobile edge computing(MEC) in intelligent mine, the mobile users unload tasks to non-optimal edge servers due to unreasonable resource allocation, which leads to extra transmission time and execution delay, thus resulting in the decrease of the total task completion rate. In order to solve the above problem, a two-dimensional dynamic matching algorithm based on preference is proposed to optimize the resource allocation decision in MEC system. The data of the position of a mobile user in MEC system and the calculation amount required by a task in one time slot is sent to the edge server. The preference table of the edge server for the mobile user is formed according to the set preference value. At the same time, the preference table for all the edge servers is formed by the mobile user according to different physical distances. The two preference tables are combined to form a two-dimensional dynamic preference table, which is abstracted into a two-dimensional matrix. The two-dimensional matrix is processed by a two-dimensional dynamic matching algorithm based on preference, and the matching optimization results of mobile users and edge servers are obtained. The simulation results show that compared with the conventional MEC scene unloading algorithm, the preference-based two-dimensional dynamic matching algorithm can effectively alleviate the problem of the decrease of the total task completion rate in a large number of sudden task scenes, and can achieve the total task completion rate of more than 60% in extreme cases.

Keywords

• intelligent mine
• mobile edge computing
• edge server
• mobile user
• two-dimensional dynamic matching
• preference
• total task completion rate