Two-dimensional dynamic matching algorithm for mobile edge computing in intelligent mine
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 or...
Saved in:
| Published in | Gong kuang zi dong hua = Industry and mine automation Vol. 48; no. 4; pp. 89 - 95 |
|---|---|
| Main Authors | , , , |
| Format | Journal Article |
| Language | Chinese |
| Published |
Editorial Department of Industry and Mine Automation
01.04.2022
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 1671-251X |
| DOI | 10.13272/j.issn.1671-251x.17782 |
Cover
| Summary: | 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 m |
|---|---|
| ISSN: | 1671-251X |
| DOI: | 10.13272/j.issn.1671-251x.17782 |