首页> 外文会议>IEEE Vehicular Technology Conference >Momentum-Based Online Cost Minimization for Task Offloading in NOMA-Aided MEC Networks
【24h】

Momentum-Based Online Cost Minimization for Task Offloading in NOMA-Aided MEC Networks

机译:基于势头的在线在线成本最小化,以便在NOMA辅助MEC网络中卸载的任务卸载

获取原文

摘要

To capture the ubiquitous randomness such as time-varying wireless channel and unpredictable task arrivals in the non-orthogonal multiple access aided multi-access edge computing networks, we formulate a stochastic optimization problem aiming to minimize the time-average cost for Internet of Things devices in this paper. Due to the absence of distribution of random network information, we develop a stochastic gradient descent (SGD) based method to learn the randomness online and minimize the cost asymptotically. The proposed SGD method makes decisions only depending on the observed network information in each time-slot and achieves an [O(ϵ),O(1/ϵ)]-tradeoff between the cost-optimality and task queue backlog. To polish this tradeoff, we further propose a momentum-based SGD method by amending SGD iterations with momentum terms, which can efficiently accelerate algorithm convergence while reducing the task queue backlog without loss of cost-optimality. Finally, simulation results confirm the outstanding performance of the proposed methods.
机译:为了捕获无处不在的无线信道和非正交多址多访问多址计算网络中的时变无线信道和不可预测的任务,我们制定了一个随机优化问题,其目的是最小化物联网设备的时间平均成本在本文中。由于没有随机网络信息的分布,我们开发了一种基于随机梯度下降(SGD)的方法,以在线学习随机性并最小化渐近的成本。所提出的SGD方法仅根据每个时隙中观察到的网络信息,并实现[O(ε),o(1 /ε)] - 成本最优性和任务队列积压之间的权衡。为了波动此权衡,我们进一步提出了一种基于动量的SGD方法,通过动量术语修改SGD迭代,这可以有效地加速算法融合,同时减少任务队列积压而不损失成本最优的次数。最后,仿真结果证实了所提出的方法的出色性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号