Computer Engineering and Applications ›› 2022, Vol. 58 ›› Issue (6): 103-109.DOI: 10.3778/j.issn.1002-8331.2009-0358

• Network, Communication and Security • Previous Articles     Next Articles

Resource Optimization Scheme for Non-orthogonal Multiple Access in Internet of Vehicles

ZHANG Haibo, TAO Xiaofang, LIU Kaijian   

  1. Chongqing Key Laboratory of Mobile Communications Technology, Engineering Research Center of Mobile Communications of the Ministry of Education, School of Communication and Information Engineering, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
  • Online:2022-03-15 Published:2022-03-15

面向非正交多址的车联网中资源优化方案

张海波,陶小方,刘开健   

  1. 重庆邮电大学 通信与信息工程学院 移动通信教育部工程研究中心,移动通信技术重庆市重点实验室,重庆 400065

Abstract: In order to solve the problems of insufficient computing power on the vehicle side, large task processing delay, and high energy consumption, this article considers the use of non-orthogonal multiple access technology for task upload and data packet downloading of the vehicle edge computing system. The allocation of decision-making, computing and cache resources are jointly optimized, and a random optimization problem with the goal of minimizing the average energy consumption of mobile edge computing servers is proposed. Using Lyapunov optimization theory, the penalty drift function is constructed and decoupled into two independent sub-problems, and the optimal solution of the problem is obtained by 0-1 programming and linear programming. The simulation results show that compared with the traditional orthogonal multiple access scheme, the offloading cache scheme in the vehicle edge computing system based on non-orthogonal multiple access can significantly reduce the system energy consumption.

Key words: Internet of vehicles, mobile edge computing, non-orthogonal multiple access(NOMA), resource allocation, Lyapunov optimization

摘要: 为了解决车辆端计算能力不足、任务处理时延大、能源消耗多、无线资源缺乏等问题,该文考虑利用非正交多址技术进行任务上传和数据包下载的车辆边缘计算系统,对系统的卸载决策、缓存决策、计算和缓存资源的分配进行联合优化。由于车辆需要在动态网络环境下实时确定任务卸载和缓存策略,提出了一个以移动边缘计算服务器平均能耗最小化为目标的随机优化问题,以获得最佳性能。利用李雅普诺夫优化理论,构建惩罚漂移函数后将其解耦为两个独立的子问题,采用0-1规划和线性规划求出问题的最优解。仿真结果表明,与传统正交多址接入方案相比,基于非正交多址的车辆边缘计算系统中的卸载缓存方案能显著降低系统能耗。

关键词: 车联网, 移动边缘计算, 非正交多址, 资源分配, 李雅普诺夫优化