Resource-Optimized Vehicular Edge Networks With Fairness Constraints

Intelligent transportation systems (ITSs) have witnessed a rising interest from researchers because of their promising features. These features include lane change assistance, infotainment, and collision avoidance, among others. To effectively operate ITSs for these functions, there is a need for ed...

Full description

Saved in:
Bibliographic Details
Published in:IEEE access 2024, Vol.12, p.67924-67934
Main Authors: Rashid, Aamir, Khan, Latif U., Khan, Naeem, Min, Hong, Ahmad, Ayaz, Ahmad, Shabir
Format: Article
Language:English
Subjects:
association
Automobiles
Collision avoidance
Cost function
Costs
Edge computing
fairness
Games
Intelligent transportation systems
Iterative solution
Lane changing
Network latency
Performance degradation
Radio spectrum management
Resource allocation
Resource management
Roadsides
Servers
Task analysis
Vehicular ad hoc networks
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Intelligent transportation systems (ITSs) have witnessed a rising interest from researchers because of their promising features. These features include lane change assistance, infotainment, and collision avoidance, among others. To effectively operate ITSs for these functions, there is a need for edge computing. One can install edge computing servers at the roadside units (RSUs). There must be seamless communication between the edge servers and the cars. Additionally, there will be some cars that experience higher delays and thus, are not preferable because they will highly degrade the performance. Therefore, in this work, we consider a vehicular network scenario and define a cost function that takes into account the latency that is determined by the car's computing frequency, association, and resource allocation while considering fairness constraints. Our cost function is to minimize the total latency (i.e., both local computing latency and transmission latency). The cost of the optimization problem is minimized by optimizing the car's local frequency allocation, resource allocation, and association. The problem is separable, therefore, we first compute the local frequencies of the cars using a convex optimizer. Next, we split the core problem into two separate problems: (a) the distribution of resources and (b) association, because the last defined problem (joint association and resource allocation) is NP-hard. We then suggest an iterative solution. In the end, we offer numerical findings to support the suggested solution.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2024.3388891