Lyapunov-Guided Optimal Service Placement in Vehicular Edge Computing

Vehicular Edge Computing(VEC)brings the computational resources in close proximity to the service requestors and thus supports explosive computing demands from smart vehicles.However,the limited computing capability of VEC cannot simultaneously respond to large amounts of offloading requests,thus restricting the performance of VEC system.Besides,a mass of traffic data can incur tremendous pressure on the front-haul links between vehicles and the edge server.To strengthen the performance of VEC,in this paper we propose to place services beforehand at the edge server,e.g.,by deploying the services/tasks-oriented data(e.g.,related libraries and databases)in advance at the network edge,instead of downloading them from the remote data center or offloading them from vehicles during the runtime.In this paper,we formulate the service placement problem in VEC to minimize the average response latency for all requested services along the slotted timeline.Specifically,the time slot spanned optimization problem is converted into per-slot optimization problems based on the Lyapunov optimization.Then a greedy heuristic is introduced to the drift-plus-penalty-based algorithm for seeking the approximate solution.The simulation results reveal its advantages over others in terms of optimal values and our strategy can satisfy the long-term energy constraint.

Joint computation offloading and resource allocation in vehicular edge computing networks

Vehicular Edge Computing(VEC)is a promising technique to accommodate the computation-intensive and delaysensitive tasks through offloading the tasks to the RoadSide-Unit(RSU)equipped with edge computing servers or neighboring vehicles.Nevertheless,the limited computation resources of edge computing servers and the mobility of vehicles make the offloading policy design very challenging.In this context,through considering the potential transmission gains brought by the mobility of vehicles,we propose an efficient computation offloading and resource allocation scheme in VEC networks with two kinds of offloading modes,i.e.,Vehicle to Vehicle(V2V)and Vehicle to RSU(V2R).We define a new cost function for vehicular users by incorporating the vehicles’offloading delay,energy consumption,and expenses with a differentiated pricing strategy,as well as the transmission gain.An optimization problem is formulated to minimize the average cost of all the task vehicles under the latency and computation capacity constraints.A distributed iterative algorithm is proposed by decoupling the problem into two subproblems for the offloading mode selection and the resource allocation.Matching theorybased and Lagrangian-based algorithms are proposed to solve the two subproblems,respectively.Simulation results show the proposed algorithm achieves low complexity and significantly improves the system performance compared with three benchmark schemes.

Task Offloading Based on Vehicular Edge Computing for Autonomous Platooning

Autonomous platooning technology is regarded as one of the promising technologies for the future and the research is conducted actively.The autonomous platooning task generally requires highly complex computations so it is difficult to process only with the vehicle’s processing units.To solve this problem,there are many studies on task offloading technique which transfers complex tasks to their neighboring vehicles or computation nodes.However,the existing task offloading techniques which mainly use learning-based algorithms are difficult to respond to the real-time changing road environment due to their complexity.They are also challenging to process computation tasks within 100 ms which is the time limit for driving safety.In this paper,we propose a novel offloading scheme that can support autonomous platooning tasks being processed within the limit and ensure driving safety.The proposed scheme can handle computation tasks by considering the communication bandwidth,delay,and amount of computation.We also conduct simulations in the highway environment to evaluate the existing scheme and the proposed scheme.The result shows that our proposed scheme improves the utilization of nearby computing nodes,and the offloading tasks can be processed within the time for driving safety.

NOMA-Based Energy-Efficient Task Scheduling in Vehicular Edge Computing Networks: A Self-Imitation Learning-Based Approach

Mobile Edge Computing(MEC)is promising to alleviate the computation and storage burdens for terminals in wireless networks.The huge energy consumption of MEC servers challenges the establishment of smart cities and their service time powered by rechargeable batteries.In addition,Orthogonal Multiple Access(OMA)technique cannot utilize limited spectrum resources fully and efficiently.Therefore,Non-Orthogonal Multiple Access(NOMA)-based energy-efficient task scheduling among MEC servers for delay-constraint mobile applications is important,especially in highly-dynamic vehicular edge computing networks.The various movement patterns of vehicles lead to unbalanced offloading requirements and different load pressure for MEC servers.Self-Imitation Learning(SIL)-based Deep Reinforcement Learning(DRL)has emerged as a promising machine learning technique to break through obstacles in various research fields,especially in time-varying networks.In this paper,we first introduce related MEC technologies in vehicular networks.Then,we propose an energy-efficient approach for task scheduling in vehicular edge computing networks based on DRL,with the purpose of both guaranteeing the task latency requirement for multiple users and minimizing total energy consumption of MEC servers.Numerical results demonstrate that the proposed algorithm outperforms other methods.

VECSim:改进iFogSim2的面向车载边缘计算的建模与仿真模拟器

目前,研究人员着眼于车载边缘计算(vehicular edge computing,VEC)环境下高效应用和资源调度策略的研究,然而,这些应用和策略的实机验证往往受限于成本和时间,无法快速有效地进行。边缘/雾计算仿真器如iFogSim2的出现降低了实验成本,然而,高速移动车辆的连接切换和资源分配需求对边缘/雾计算仿真器在VEC下应用提出了挑战。因此,改进了iFogSim2,设计了支持高速移动的VEC环境仿真器VECSim。集成开源基站数据并构建车辆轨迹数据集,以便研究人员专注于资源分配策略。首先,为了简化实验步骤,改进了移动轨迹数据解析模块并适配了微观交通仿真软件Simulation of Urban Mobility(SUMO)生成的车辆轨迹数据。其次,基于分布式数据流模型对VEC下的分布式应用进行建模,并提供了服务迁移基准策略算法。此外,VECSim还引入了时间性能优化方法,通过并行化操作,加速仿真事件处理,从而提高了仿真工具的时间性能。实验表明,相比于iFogSim2中同类的服务迁移算法,提出的服务迁移算法在大规模机动车轨迹数据集验证下表现出良好的稳定性,时间性能优化方法在执行时间上取得了5.3%的性能提升。代码开源地址:https://github.com/LiuZi-yuan-CS/VECSim。

Enhancing the robustness of object detection via 6G vehicular edge computing

Academic and industrial communities have been paying significant attention to the 6th Generation (6G) wireless communication systems after the commercial deployment of 5G cellular communications. Among the emerging technologies, Vehicular Edge Computing (VEC) can provide essential assurance for the robustness of Artificial Intelligence (AI) algorithms to be used in the 6G systems. Therefore, in this paper, a strategy for enhancing the robustness of AI model deployment using 6G-VEC is proposed, taking the object detection task as an example. This strategy includes two stages: model stabilization and model adaptation. In the former, the state-of-the-art methods are appended to the model to improve its robustness. In the latter, two targeted compression methods are implemented, namely model parameter pruning and knowledge distillation, which result in a trade-off between model performance and runtime resources. Numerical results indicate that the proposed strategy can be smoothly deployed in the onboard edge terminals, where the introduced trade-off outperforms the other strategies available.

Privacy-Preserving Incentive Mechanism for Platoon Assisted Vehicular Edge Computing with Deep Reinforcement Learning

Platoon assisted vehicular edge computing has been envisioned as a promising paradigm of implementing offloading services through platoon cooperation.In a platoon,a vehicle could play as a requester that employs another vehicles as performers for workload processing.An incentive mechanism is necessitated to stimulate the performers and enable decentralized decision making,which avoids the information collection from the performers and preserves their privacy.We model the interactions among the requester(leader)and multiple performers(followers)as a Stackelberg game.The requester incentivizes the performers to accept the workloads.We derive the Stackelberg equilibrium under complete information.Furthermore,deep reinforcement learning is proposed to tackle the incentive problem while keeping the performers’information private.Each game player becomes an agent that learns the optimal strategy by referring to the historical strategies of the others.Finally,numerical results are provided to demonstrate the effectiveness and efficiency of our scheme.

Computing Paradigms in Emerging Vehicular Environments:A Review

Determining how to structure vehicular network environments can be done in various ways.Here,we highlight vehicle networks’evolution from vehicular ad-hoc networks(VANET)to the internet of vehicles(Io Vs),listing their benefits and limitations.We also highlight the reasons in adopting wireless technologies,in particular,IEEE 802.11 p and 5 G vehicle-toeverything,as well as the use of paradigms able to store and analyze a vast amount of data to produce intelligence and their applications in vehicular environments.We also correlate the use of each of these paradigms with the desire to meet existing intelligent transportation systems’requirements.The presentation of each paradigm is given from a historical and logical standpoint.In particular,vehicular fog computing improves on the deficiences of vehicular cloud computing,so both are not exclusive from the application point of view.We also emphasize some security issues that are linked to the characteristics of these paradigms and vehicular networks,showing that they complement each other and share problems and limitations.As these networks still have many opportunities to grow in both concept and application,we finally discuss concepts and technologies that we believe are beneficial.Throughout this work,we emphasize the crucial role of these concepts for the well-being of humanity.

Joint offloading strategy based on quantum particle swarm optimization for MEC-enabled vehicular networks

With the development of the mobile communication technology,a wide variety of envisioned intelligent transportation systems have emerged and put forward more stringent requirements for vehicular communications.Most of computation-intensive and power-hungry applications result in a large amount of energy consumption and computation costs,which bring great challenges to the on-board system.It is necessary to exploit traffic offloading and scheduling in vehicular networks to ensure the Quality of Experience(QoE).In this paper,a joint offloading strategy based on quantum particle swarm optimization for the Mobile Edge Computing(MEC)enabled vehicular networks is presented.To minimize the delay cost and energy consumption,a task execution optimization model is formulated to assign the task to the available service nodes,which includes the service vehicles and the nearby Road Side Units(RSUs).For the task offloading process via Vehicle to Vehicle(V2V)communication,a vehicle selection algorithm is introduced to obtain an optimal offloading decision sequence.Next,an improved quantum particle swarm optimization algorithm for joint offloading is proposed to optimize the task delay and energy consumption.To maintain the diversity of the population,the crossover operator is introduced to exchange information among individuals.Besides,the crossover probability is defined to improve the search ability and convergence speed of the algorithm.Meanwhile,an adaptive shrinkage expansion factor is designed to improve the local search accuracy in the later iterations.Simulation results show that the proposed joint offloading strategy can effectively reduce the system overhead and the task completion delay under different system parameters.

VEC中基于动态优先级的抢占式任务调度方法

在车载边缘计算(vehicular edge computing,VEC)环境中,车载应用的计算任务常被卸载至VEC服务器上处理,在解决车辆计算能力不足的同时降低车联网通信服务的时延。然而,服务器有限的计算资源以及不合理的调度顺序会导致任务的失败率升高,甚至危及车辆用户安全。针对此问题,首先分析车载应用的特点,设计一个多因素任务优先级模型。其次,设计基于任务紧迫性的优先级动态调整策略。最后,设计结合任务最大可等待时间和优先级的任务抢占机制,使紧迫性升高的任务及时得到处理,从而降低任务失败率。仿真结果表明,相比于直接抢占调度方案,所提方案可以减少任务争抢资源所带来的抢占次数,降低频繁抢占对失败率的影响;相比于静态优先级调度和高响应比优先调度方案,所提方案可以实现在任务时延约束下失败率最小化的目标。

面向绿色计算的车辆协同任务卸载方法

车辆边缘计算(VEC)为处理计算密集、延迟敏感型任务提供了新的范式,然而边缘服务器在整合可再生能源方面的能力较差。因此,为了提高边缘服务器的能效,该文设计了一种面向绿色计算的车辆协同任务卸载框架。在该框架中,车辆配备能源收集(EH)设备,通过彼此间共享绿色能源和计算资源协作执行任务。为有效促进车辆的参与积极性,该文通过动态定价激励车辆,并综合考虑了车辆的移动性、任务优先级等。为了使卸载决策适应动态环境的变化,该文提出了一种基于双延迟深度确定性策略梯度(TD3)的任务卸载方法,以在最大化所有车辆平均任务完成效用的同时减少边缘端电网电力的使用。最后,仿真结果验证了该方法的有效性,相比基于深度确定性策略梯度(DDPG)和基于贪心原则(GPE)的方法在性能上分别提升了7.34%和37.47%。

基于Q学习的蜂窝车联网边缘计算系统PC-5/Uu接口联合卸载策略

智能驾驶等智能交通服务对时延要求高,在车辆本身算力不足的情况下,车辆需要周围车辆和路旁边缘计算单元帮助其一起完成任务的计算处理.本文在既有车联网边缘计算卸载策略基础上,考虑了蜂窝车联网系统5G-NR接口与PC-5接口链路的特征差异,提出了一种基于Q学习的PC-5/Uu接口联合边缘计算卸载策略.在对蜂窝车联网PC-5链路传输成功率进行建模的基础上,推导了PC-5链路的传输速率表征方法.以最小化蜂窝车联网任务处理时延为目标,以任务车辆发射功率与边缘计算车辆的计算能量损耗为约束,构建了系统时延最小化的有约束马尔科夫决策过程.通过拉格朗日方法,将有约束马尔科夫决策过程问题转化为一个等价的极小极大的无约束马尔科夫决策过程,引入Q学习设计卸载策略,进而提出基于Q学习的蜂窝车联网边缘计算系统卸载策略.仿真结果表明,与其他基线方案相比,本文提出的算法可以降低系统时延27.3%以上.

车辆边缘计算中基于深度学习的任务判别卸载

车辆边缘计算(VEC)将移动边缘计算(MEC)与车联网(IoV)技术相结合,将车载任务下沉至网络边缘,以此解决车辆终端计算能力有限问题。为了克服任务数量骤增的车载任务调度难题并提供一个低时延服务环境,首先依据所选的5大特征参数的动态关联变化准则,使用改进型层次分析法(AHP)将车载任务划分为3类主要任务,基于3种卸载决策进行资源分配联合建模;随后,利用调度算法和罚函数来消除建模的约束条件,所获的代价值为之后的深度学习算法提供输入;最后,提出一种基于深度学习的分布式卸载网络算法来有效降低VEC系统的能耗与时延。仿真实验结果表明,所提卸载方案相较传统深度学习卸载方案具有更好环境适应性与稳定性,并降低了任务平均处理时延与能耗。

A Reverse Auction Mechanism for Time-Varying Multidimensional Resource Allocation in Vehicular Fog Computing with Cloud and Edge Collaboration

It is a hot issue to allocate resources using auction mechanisms in vehicular fog computing(VFC)with cloud and edge collaboration.However,most current research faces the limitation of only considering single type resource allocation,which cannot satisfy the resource requirements of users.In addition,the resource requirements of users are satisfied with a fixed amount of resources during the usage time,which may result in high cost of users and even cause a waste of resources.In fact,the actual resource requirements of users may change with time.Besides,existing allocation algorithms in the VFC of cloud and edge collaboration cannot be directly applied to time-varying multidimensional resource allocation.Therefore,in order to minimize the cost of users,we propose a reverse auction mechanism for the time-varying multidimensional resource allocation problem(TMRAP)in VFC with cloud and edge collaboration based on VFC parking assistance and transform the resource allocation problem into an integer programming(IP)model.And we also design a heuristic resource allocation algorithm to approximate the solution of the model.We apply a dominant-resource-based strategy for resource allocation to improve resource utilization and obtain the lowest cost of users for resource pricing.Furthermore,we prove that the algorithm satisfies individual rationality and truthfulness,and can minimize the cost of users and improve resource utilization through comparison with other similar methods.Above all,we combine VFC smart parking assistance with reverse auction mechanisms to encourage resource providers to offer resources,so that more vehicle users can obtain services at lower prices and relieve traffic pressure.

VEC中基于动态定价的车辆协同计算卸载方案

车载边缘计算(Vehicular Edge Computing, VEC)是移动边缘计算(Mobile Edge Computing, MEC)在车联网中的一个重要应用。在VEC中,请求服务的车辆可以通过付费的方式,将计算任务卸载到VEC服务器或者空闲计算资源丰富的服务车辆上,从而满足车辆任务对计算服务的需求。然而,对于VEC运营商来说,收益最大化是其追求的目标之一。由于系统中的计算需求和计算资源是动态变化的,因此如何在车辆协同场景下确定一个合理的定价策略是一个不容忽视的问题。针对该问题制定了一个动态定价策略,使VEC服务器和服务车辆的价格随着计算资源的供需关系而动态调整。基于此,设计了运营商收益最大化的车辆协同计算卸载方案,通过将时延约束下的VEC运营商收益最大化问题转化为多用户匹配问题,使用Kuhn-Munkres(KM)算法求得卸载结果。仿真实验表明,相比已有定价策略,该动态定价策略下VEC服务器和服务车辆的价格均可以根据计算资源供需关系动态调整,从而实现运营商收益最大化;相比已有卸载方案,该方案可以在满足任务时延约束的前提下提高运营商的收益。

基于负载均衡的VEC服务器联合计算任务卸载方案

在车载边缘计算(Vehicular Edge Computing,VEC)网络中,车辆计算资源受限导致无法处理海量的计算任务,需要将车载应用产生的计算任务卸载到VEC服务器上进行处理。但车辆的移动性和区域部署的差异性易导致VEC服务器负载不均衡,造成了计算卸载效率和资源利用率降低。为解决该问题,提出一种计算卸载和资源分配方案,以使用户效用最大化。将用户效用最大化问题转化成服务器选择决策和卸载比例与计算资源分配联合优化两个子问题,在此基础上设计基于匹配的服务器选择决策算法和基于Adam梯度优化法的计算任务卸载比例与资源分配联合优化算法,并对上述两种算法进行联合迭代,直至收敛,从而得到近似最优解以达到负载均衡。仿真结果表明,相比最近卸载方案和预测卸载方案,该方案能有效降低计算任务处理时延和车辆能耗,增大车辆效用,促进负载均衡。

An energy-efficient resource allocation strategy in massive MIMO-enabled vehicular edge computing networks

The vehicular edge computing(VEC)is a new paradigm that allows vehicles to offload computational tasks to base stations(BSs)with edge servers for computing.In general,the VEC paradigm uses the 5G for wireless communications,where the massive multi-input multi-output(MIMO)technique will be used.However,considering in the VEC environment with many vehicles,the energy consumption of BS may be very large.In this paper,we study the energy optimization problem for the massive MIMO-based VEC network.Aiming at reducing the relevant BS energy consumption,we first propose a joint optimization problem of computation resource allocation,beam allocation and vehicle grouping scheme.Since the original problem is hard to be solved directly,we try to split the original problem into two subproblems and then design a heuristic algorithm to solve them.Simulation results show that our proposed algorithm efficiently reduces the BS energy consumption compared to other schemes.

Trust Access Authentication in Vehicular Network Based on Blockchain

Data sharing and privacy securing present extensive opportunities and challenges in vehicular network.This paper introducestrust access authentication scheme’as a mechanism to achieve real-time monitoring and promote collaborative sharing for vehicles.Blockchain,which can provide secure authentication and protected privacy,is a crucial technology.However,traditional cloud computing performs poorly in supplying low-latency and fast-response services for moving vehicles.In this situation,edge computing enabled Blockchain network appeals to be a promising method,where moving vehicles can access storage or computing resource and get authenticated from Blockchain edge nodes directly.In this paper,a hierarchical architecture is proposed consist of vehicular network layer,Blockchain edge layer and Blockchain network layer.Through a authentication mechanism adopting digital signature algorithm,it achieves trusted authentication and ensures valid verification.Moreover,a caching scheme based on many-to-many matching is proposed to minimize average delivery delay of vehicles.Simulation results prove that the proposed caching scheme has a better performance than existing schemes based on central-ized model or edge caching strategy in terms of hit ratio and average delay.

V2X Offloading and Resource Allocation in SDN-Assisted MEC-Based Vehicular Networks

As an important application scenario of 5G, the vehicular network has a huge amount of computing data, which brings challenges to the scarce network resources. Mobile edge computing(MEC) sinks cloud services to the edge of network, which reduces the delay jitter caused by remote cloud computing. Software-defined networking(SDN) is an emerging network paradigm with the features of logic centralized control and programmability. In this paper, we construct an SDN-assisted MEC network architecture for the vehicular network. By introducing SDN controller, the efficiency and flexibility of vehicular network are improved, and the network state can be perceived from the global perspective. To further reduce the system overhead, the problem of vehicle to everything(V2X) offloading and resource allocation is proposed, where the optimal offloading decision, transmission power control, subchannels assignment, and computing resource allocation scheme are given. The optimization problem is transformed into three stages because of the heterogeneity of the offloaded tasks and the NP-hard property of the problem. Firstly, the analytic hierarchy process is used to select initial offloading node, then stateless Q-learning is adopted to allocate transmission power, subchannels and computing resources. In addition, the offloading decision is modeled as a potential game, and the Nash equilibrium is proved by the potential function construction. Finally, the numerical results show that the proposed mechanism can effectively reduce the system overhead and achieve better results compared with others’ algorithms.

车载边缘计算中多任务部分卸载方案研究

现有车载应用设备对时延有更严苛的要求,车载边缘计算(VEC)能够充分利用网络边缘设备,如路边单元(RSU)进行协作处理,可有效地降低时延。现有研究多假设RSU计算资源充足,可提供无限的服务,但实际其计算资源会随着所需处理任务数量的增加而受限,对时延敏感的车载应用造成限制。该文针对此问题,提出一种车载边缘计算中多任务部分卸载方案,该方案在充分利用RSU的计算资源条件下,考虑邻近车辆的剩余可用计算资源,以最小化总任务处理时延。首先在时延限制和资源约束下分配各任务在本地、RSU和邻近车辆的最优卸载决策变量比例,其次以最小处理时延为目的在一跳通信范围内选择合适的空闲车辆作为处理部分任务的邻近车辆。仿真结果表明所提车载边缘计算中多任务部分卸载方案相较现有方案能较好地降低时延。