Search

Due to the rapid development of the Internet of Vehicles (IoV), the combination of IoV and edge computing, known as vehicle edge computing (VEC), has received considerable attention from both academia and industry. However, task offloading in diverse intersection scenarios remains suffering from inefficiency of resource allocation and low quality of service for task execution due to the imbalance of traffic flow and the rigid requirement of latency. To address these issues, we develop a task offloading strategy by a fuzzy decision-making algorithm to handle uncertainty and imprecision. This task offloading strategy comprises two components: (1) A VEC resource pool with available vehicles at each intersection is constructed when taking the rotating direction of the recognition region. Then, we introduce a fuzzy decision-making algorithm to select a set of high-quality service vehicles from this VEC resource pool as an auxiliary edge server (AS). (2) We employ an edge service provider (ESP) to manage the computational resources of a main edge server (MS) and an AS deployed at a traffic intersection. The negotiation between the ESP and the task vehicles is modeled as a Stackelberg game. We prove the existence of the unique perfect Nash equilibrium, and a genetic algorithm is applied to find the optimum. Finally, we conduct simulation experiments with datasets collected in real-world scenarios. The results demonstrate that our scheme decreases task execution time by 9.73% compared to the cloud server scheme and reduces energy consumption by 13.78% compared to the state-of-the-art reinforcement learning (RL) strategy. [ABSTRACT FROM AUTHOR]

Copyright of Telecommunication Engineering is the property of Telecommunication Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

With the rapid advancement of Internet of vehicles and autonomous driving technology, there is a growing need for increased computing power in vehicle operations. However, the strict latency requirements of vehicle tasks may pose challenges to communication and computing resources within the vehicle edge computing network. This paper introduces a two-stage joint optimization to address challenges, focusing on minimizing vehicle task latency and optimizing resource allocation. In addition, the task completion rate is considered an important indicator to ensure safety and reliability in practical application scenarios. Next, we propose a global adaptive offloading and resource allocation optimization model named GOAL. The GOAL model dynamically adjusts the weight coefficients of the reward function to optimize the model, integrating the actor-critic algorithm to effectively adapt to uncertain environments. Through experimental comparisons of various weight coefficients for task arrival rates and reward functions, we were able to determine the optimal hyperparameters for our proposed model. The simulation results show that the GOAL model outperforms the benchmark methods by over 30% in reward value. It also performs better in terms of task delay and energy consumption. Additionally, the GOAL model has a higher task completion rate compared to the benchmark methods, and it exhibits strong search capabilities and faster convergence speed. [ABSTRACT FROM AUTHOR]

Copyright of Computer Measurement & Control is the property of Magazine Agency of Computer Measurement & Control and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Recently, as computing-intensive services such as object recognition for autonomous vehicles have increased, power consumption and computational loads of vehicles have been prominent. To tackle this issue, there have been growing interests in edge computing technology, which offloads workloads of services to nearby vehicle edge computing (VEC) servers. However, the existing offloading technologies in the VEC server made independent offloading decisions for each service, and they did not consider shared workloads of multimodal vision applications. In this paper, we first aim to capture the intricate workload relationships among multimodal applications in modeling an integrated process-network load balancing for a VEC-assisted autonomous vehicle system. To this end, we formulate an energy minimization problem of a vehicle constrained by outage probability of service requests where the decision variables are (i) dynamic offloading policy between vehicle and VEC server and (ii) onboard CPU clock frequency of a vehicle every time slot. To solve this problem, we leverage Lyapunov optimization to transform the long-term average problem into a slot-by-slot problem. Then, by minimizing the slot-by-slot objective function every time slot, we develop a latency-sensitive energy minimization (LEMON) algorithm. Finally, we evaluate the performance of the proposed algorithm in realistic vehicular network environment, and show that the proposed LEMON algorithm which captures the shared workloads reduces 57% of average queue backlog and 37% of average power consumption compared to the existing algorithm which does not consider shared workload characteristics.

In vehicular edge computing (VEC) networks, the rapid expansion of intelligent transportation and the corresponding enormous numbers of tasks bring stringent requirements on timely task offloading. However, many tasks typically appear within a short period rather than arriving simultaneously, which makes it difficult to realize effective and efficient resource scheduling. In addition, some key information about tasks could be learned due to the regular data collection and uploading processes of sensors, which may contribute to developing effective offloading strategies. Thus, in this paper, we propose a model that considers the deterministic demand of multiple tasks. It is possible to generate effective resource reservations or early preparation decisions in offloading strategies if some feature information of the deterministic demand can be obtained in advance. We formulate our scenario as a 0-1 programming problem to minimize the average delay of tasks and transform it into a convex form. Finally, we proposed an efficient optimal offloading algorithm that uses the interior point method. Simulation results demonstrate that the proposed algorithm has great advantages in optimizing offloading utility.

In vehicular edge computing (VEC) networks, the rapid expansion of intelligent transportation and the corresponding enormous numbers of tasks bring stringent requirements on timely task offloading. However, many tasks typically appear within a short period rather than arriving simultaneously, which makes it difficult to realize effective and efficient resource scheduling. In addition, some key information about tasks could be learned due to the regular data collection and uploading processes of sensors, which may contribute to developing effective offloading strategies. Thus, in this paper, we propose a model that considers the deterministic demand of multiple tasks. It is possible to generate effective resource reservations or early preparation decisions in offloading strategies if some feature information of the deterministic demand can be obtained in advance. We formulate our scenario as a 0‐1 programming problem to minimize the average delay of tasks and transform it into a convex form. Finally, we proposed an efficient optimal offloading algorithm that uses the interior point method. Simulation results demonstrate that the proposed algorithm has great advantages in optimizing offloading utility. [ABSTRACT FROM AUTHOR]

Cloudlet-based vehicular networks are a promising paradigm to enhance computation services through a distributed computation method, where the vehicle edge computing (VEC) cloudlet are deployed in the vicinity of the vehicle. In order to further improve the computing efficiency and reduce the task processing delay, we present a parallel task scheduling strategy based on the multi-agent deep reinforcement learning (DRL) approach for delay-optimal VEC in vehicular networks, where multiple computation tasks select the target threads in a VEC server to execute the computing tasks. We model the target thread decision of computation tasks as a multi-agent reinforcement learning problem, which is further solved by using a task scheduling algorithm based on multi-agent DRL that is implemented in a distributed manner. The computation tasks, with each selection acting on the target thread acting as an agent, collectively interact with the VEC environment and receive observations with respect to a common reward and learn to reduce the task processing delay by updating the multi-agent deep Q network (MADQN) using the obtained experiences. The experimental results show that the proposed DRL-based scheduling algorithm can achieve significant performance improvement, reducing the task processing delay by 40% and increasing the processing probability of success for computation tasks by more than 30% compared with the traditional task scheduling algorithms. [ABSTRACT FROM AUTHOR]

The emergence of vehicular edge computing (VEC) has introduced a new computational paradigm for high-quality processing of computing services in Internet of Vehicles (IoV) scenarios. However, due to the limited computational resources of the VEC server, it is not sufficient to adequately meet the demand for highly concurrent computational services in high-density vehicular communication networks. To address this issue, we consider an idle mobile vehicles assisted vehicular edge computing framework and propose a hybrid Stackelberg-Match cooperative task offloading and resource pricing algorithm (SMOP). The algorithm considers the mobility of vehicles and the duration of channels, coordinating the computational resources of fixed VEC servers and idle mobile vehicles within the vehicular network (VN). This enhances offloading efficiency and maximizes participant benefits. Specifically, the Stackelberg game is used to derive differentiated pricing schemes for idle mobile vehicles and VEC servers for different vehicular tasks, and the stable matching method is employed to determine task offloading strategies. Finally, we conduct experiments on a real Chengdu traffic dataset. The results demonstrate that the proposed solution effectively reduces offloading costs and exhibits strong robustness in handling latency-sensitive and data-intensive service requests. [ABSTRACT FROM AUTHOR]

The rapid growth and technological progressions in the vehicle edge computing and networks (VECON) enhanced existing vehicular administrations through information sharing and information investigation, which further incremented traffic security difficulties. This carries the need to verify vehicle networks with gigantic information stockpiling substances. Recognizing the vehicles that communicate fashioned messages and ensuring the protection of every vehicle is an essential assignment. Blockchain can be utilized as an effective solution to provide security during vehicle edge computing. Every transaction and data is recorded in the blockchain, which expands the number of blocks after some time. Another test in blockchain methods is utilizing a consensus mechanism, which can be effectively undermined by the attackers. Artificial intelligence (AI) trained by machine learning (ML) algorithms as an amazing paradigm can be incorporated with blockchain to settle these issues. The data storing methods of blockchain can likewise be enhanced with the assistance of ML algorithms. In this paper, a two-tier authenticated consortium blockchain (TTA-CB) protocol is proposed for secure information partaking in Vehicle Edge Computing and Networks (VECONs). Utilizing a one-time password (OTP) based notoriety estimation calculation, the misbehaving vehicles are recognized. The use of Particle Swarm Optimization (PSO) understands the ideal data provider selection issue utilizing notoriety esteems. Exploratory outcomes demonstrate the importance of the proposed strategy, and the correlation results demonstrate that the proposed technique is unrivaled and secure. [ABSTRACT FROM AUTHOR]

Vehicle edge computing (VEC) is expected to be widely used in 5G wireless network in the future owing to its low latency, high reliability, and easy deployment. Unfortunately, the computation resources of roadside units (RSUs) equipped with computing ability are limited, which makes us need to seek other computing nodes. In this article, we explore an offloading model to meet this challenge. Future vehicles equipped with computing abilities can provide VEC services in vehicular fog networks (VeFN), which greatly reduces task delay and improves the efficiency of transportation system. We consider that a package consisting of several tasks is offloaded to vehicles with different computing abilities via multicast, and these vehicles process tasks at the same time. First, we use the mathematical method to construct the system utility function, aiming to obtain low delay and low computing cost, and produce a 0-1 programming problem with inequality constraints. We then solve the slack form of the primary problem based on the interior point method. Finally, a low-complexity algorithm is proposed to optimize the task delay and cost. Numerical results show that the algorithm has fast convergence speed and superior performance.

Mobile Edge Computing (MEC) is a promising technology to extend the diverse services to the edge of Internet of Things (IoT) system. However, the static edge server deployment may cause “service hole” in IoT networks in which the location and service requests of the User Equipments (UEs) may be dynamically changing. In this paper, we firstly explore a vehicle edge computing network architecture in which the vehicles can act as the mobile edge servers to provide computation services for nearby UEs. Then, we propose as vehicle-assisted offloading scheme for UEs while considering the delay of the computation task. Accordingly, an optimization problem is formulated to maximize the long-term utility of the vehicle edge computing network. Considering the stochastic vehicle traffic, dynamic computation requests and time-varying communication conditions, the problem is further formulated as a semi-Markov process and two reinforcement learning methods: $Q$ -learning based method and deep reinforcement learning (DRL) method, are proposed to obtain the optimal policies of computation offloading and resource allocation. Finally, we analyze the effectiveness of the proposed scheme in the vehicular edge computing network by giving numerical results. [ABSTRACT FROM AUTHOR]

Basic safety message (BSM) are messages that contain core elements of a vehicle such as vehicle’s size, position, speed, acceleration and others. BSM are lightweight messages that can be regularly broadcast by the vehicles to enable a variety of applications. On the other hand, event-driven message (EDM) are messages generated at the time of occurrence such as accidents or roads sliding and can contain much more heavy elements including pictures, audio or videos. Security, architecture and communication solutions for BSM use cases have been largely documented on in the literature contrary to EDM due to several concerns such as the variant size of EDM, the appropriate architecture along with latency, privacy and security. In this paper, we propose a secure and blockchain based EDM protocol for 5G enabled vehicular edge computing. To offer scalability and latency for the proposed scenario, we adopt a 5G cellular architecture due to its projected features compared to 4G tong-term evaluation (LTE) for vehicular communications. We consider edge computing to provide local processing of EDM that can improve the response time of public agencies (ambulances or rescue teams) that may intervene to the scene. We make use of lightweight multi-receiver signcryption scheme without pairing that offers low time consuming operations, security, privacy and access control. EDM records need to be kept into a distributed system which can guarantee reliability and auditability of EDM. To achieve this, we construct a private blockchain based on the edge nodes to store EDM records. The performance analysis of the proposed protocol confirms its efficiency.

Basic safety message (BSM) are messages that contain core elements of a vehicle such as vehicle's size, position, speed, acceleration and others. BSM are lightweight messages that can be regularly broadcast by the vehicles to enable a variety of applications. On the other hand, event-driven message (EDM) are messages generated at the time of occurrence such as accidents or roads sliding and can contain much more heavy elements including pictures, audio or videos. Security, architecture and communication solutions for BSM use cases have been largely documented on in the literature contrary to EDM due to several concerns such as the variant size of EDM, the appropriate architecture along with latency, privacy and security. In this paper, we propose a secure and blockchain based EDM protocol for 5G enabled vehicular edge computing. To offer scalability and latency for the proposed scenario, we adopt a 5G cellular architecture due to its projected features compared to 4G tong-term evaluation (LTE) for vehicular communications. We consider edge computing to provide local processing of EDM that can improve the response time of public agencies (ambulances or rescue teams) that may intervene to the scene. We make use of lightweight multi-receiver signcryption scheme without pairing that offers low time consuming operations, security, privacy and access control. EDM records need to be kept into a distributed system which can guarantee reliability and auditability of EDM. To achieve this, we construct a private blockchain based on the edge nodes to store EDM records. The performance analysis of the proposed protocol confirms its efficiency. [ABSTRACT FROM AUTHOR]

Basic safety message (BSM) are messages that contain core elements of a vehicle such as vehicle's size, position, speed, acceleration and others. BSM are lightweight messages that can be regularly broadcast by the vehicles to enable a variety of applications. On the other hand, event-driven message (EDM) are messages generated at the time of occurrence such as accidents or roads sliding and can contain much more heavy elements including pictures, audio or videos. Security, architecture and communication solutions for BSM use cases have been largely documented on in the literature contrary to EDM due to several concerns such as the variant size of EDM, the appropriate architecture along with latency, privacy and security. In this paper, we propose a secure and blockchain based EDM protocol for 5G enabled vehicular edge computing. To offer scalability and latency for the proposed scenario, we adopt a 5G cellular architecture due to its projected features compared to 4G tong-term evaluation (LTE) for vehicular communications. We consider edge computing to provide local processing of EDM that can improve the response time of public agencies (ambulances or rescue teams) that may intervene to the scene. We make use of lightweight multi-receiver signcryption scheme without pairing that offers low time consuming operations, security, privacy and access control. EDM records need to be kept into a distributed system which can guarantee reliability and auditability of EDM. To achieve this, we construct a private blockchain based on the edge nodes to store EDM records. The performance analysis of the proposed protocol confirms its efficiency.