Open Access iconOpen Access

ARTICLE

crossmark

Heterogeneous Task Allocation Model and Algorithm for Intelligent Connected Vehicles

by Neng Wan1,2, Guangping Zeng1,*, Xianwei Zhou1

1 School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, 100083, China
2 School of Mechanical and Transportation, Southwest Forestry University, Kunming, 650224, China

* Corresponding Author: Guangping Zeng. Email: email

(This article belongs to the Special Issue: Advanced Communication and Networking Technologies for Internet of Things and Internet of Vehicles)

Computers, Materials & Continua 2024, 80(3), 4281-4302. https://doi.org/10.32604/cmc.2024.054794

Abstract

With the development of vehicles towards intelligence and connectivity, vehicular data is diversifying and growing dramatically. A task allocation model and algorithm for heterogeneous Intelligent Connected Vehicle (ICV) applications are proposed for the dispersed computing network composed of heterogeneous task vehicles and Network Computing Points (NCPs). Considering the amount of task data and the idle resources of NCPs, a computing resource scheduling model for NCPs is established. Taking the heterogeneous task execution delay threshold as a constraint, the optimization problem is described as the problem of maximizing the utilization of computing resources by NCPs. The proposed problem is proven to be NP-hard by using the method of reduction to a 0–1 knapsack problem. A many-to-many matching algorithm based on resource preferences is proposed. The algorithm first establishes the mutual preference lists based on the adaptability of the task requirements and the resources provided by NCPs. This enables the filtering out of un-schedulable NCPs in the initial stage of matching, reducing the solution space dimension. To solve the matching problem between ICVs and NCPs, a new many-to-many matching algorithm is proposed to obtain a unique and stable optimal matching result. The simulation results demonstrate that the proposed scheme can improve the resource utilization of NCPs by an average of 9.6% compared to the reference scheme, and the total performance can be improved by up to 15.9%.

Keywords


Cite This Article

APA Style
Wan, N., Zeng, G., Zhou, X. (2024). Heterogeneous task allocation model and algorithm for intelligent connected vehicles. Computers, Materials & Continua, 80(3), 4281-4302. https://doi.org/10.32604/cmc.2024.054794
Vancouver Style
Wan N, Zeng G, Zhou X. Heterogeneous task allocation model and algorithm for intelligent connected vehicles. Comput Mater Contin. 2024;80(3):4281-4302 https://doi.org/10.32604/cmc.2024.054794
IEEE Style
N. Wan, G. Zeng, and X. Zhou, “Heterogeneous Task Allocation Model and Algorithm for Intelligent Connected Vehicles,” Comput. Mater. Contin., vol. 80, no. 3, pp. 4281-4302, 2024. https://doi.org/10.32604/cmc.2024.054794



cc Copyright © 2024 The Author(s). Published by Tech Science Press.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 423

    View

  • 176

    Download

  • 0

    Like

Share Link