A Task Offloading Solution for Internet of Vehicles Using Combination Auction Matching Model Based on Mobile Edge Computing

From a global perspective, an Internet of Vehicles task offloading solution based on mobile edge computing is proposed, which satisfies the application requirements (high reliability) strictly. The average time for completing a task can be minimized with the reasonable task offloading solution. Firstly, we model the wireless network, the transmission time and the movement of vehicles. Besides, heterogeneous wireless network architecture is adopted, data centers are deployed at Small-cell Base Stations, Macro-cell Base Stations and Internet. Then considering the limitedness, heterogeneity and task diversity of resources, we utilize matching model based on combination auction to design the offloading model. Furthermore, the multi-round sequential combination auction mechanism is proposed, which equals the matching problem to the multi-dimensional grouping knapsack problem and uses dynamic programming to get the optimal match. This solution is based on virtual machine technology and voltage scaling technology in the task execution time model. Moreover, the computing resources can be measured by CPU frequency. We propose an optimization problem for the shortest average task completion time with limited resources. Finally, the effects of these parameters (such as the number of tasks per unit time, the amount of data offloaded and the number of CPU cycles) on the task execution efficiency are analyzed and compared with other algorithms by simulation experiments. Compared to existing schemes, simulation results show that the proposed algorithm can reduce system overhead and shorten task execution time effectively.