Salehi, Ahmad, Azizi, Sadoon. (1403). An Efficient Resource Allocation Algorithm for Task Offloading in the Internet of Vehicles. سامانه مدیریت نشریات علمی, (), -. doi: 10.22067/cke.2024.89721.1129
Ahmad Salehi; Sadoon Azizi. "An Efficient Resource Allocation Algorithm for Task Offloading in the Internet of Vehicles". سامانه مدیریت نشریات علمی, , , 1403, -. doi: 10.22067/cke.2024.89721.1129
Salehi, Ahmad, Azizi, Sadoon. (1403). 'An Efficient Resource Allocation Algorithm for Task Offloading in the Internet of Vehicles', سامانه مدیریت نشریات علمی, (), pp. -. doi: 10.22067/cke.2024.89721.1129
Salehi, Ahmad, Azizi, Sadoon. An Efficient Resource Allocation Algorithm for Task Offloading in the Internet of Vehicles. سامانه مدیریت نشریات علمی, 1403; (): -. doi: 10.22067/cke.2024.89721.1129
An Efficient Resource Allocation Algorithm for Task Offloading in the Internet of Vehicles
1Department of Computer Engineering and IT, University of Kurdistan, Sanandaj, Iran
2Department of Computer Engineering and IT, University of Kurdistan, Sannadaj, Iran
چکیده
The Internet of Vehicles (IoV) represents a transformative paradigm in Intelligent Transportation Systems (ITS), enabling real-time communication between vehicles, infrastructure, and cloud platforms to improve traffic management, safety, and efficiency. However, the resource limitations in vehicles pose significant challenges for delay-sensitive applications such as autonomous driving and automated navigation. Vehicular Edge Computing (VEC) offers a promising solution by offloading tasks to edge servers near vehicles, reducing transmission delays and enhancing computational efficiency. In this paper, we address the complex task offloading and resource allocation problem in VEC environments. We model this challenge as an Integer Linear Programming (ILP) problem, aiming to maximize the system’s overall profit. To mitigate the computational complexity of solving the ILP problem, we propose an efficient heuristic algorithm. This approach considers various task types, accounting for the diversity and specific requirements of each. The algorithm optimizes CPU resource allocation based on task generation rates, average task sizes, and a calculated weight coefficient for each task type. Simulation results demonstrate that the proposed algorithm reduces memory costs and penalties from rejected tasks, while improving overall system profit. In particular, it outperforms existing algorithms by an average of 18.26% in terms of profit, demonstrating its effectiveness in practical VEC applications.