首页> 外文期刊>Internet of Things Journal, IEEE >Joint Computation Offloading and Resource Allocation for MEC-Enabled IoT Systems With Imperfect CSI
【24h】

Joint Computation Offloading and Resource Allocation for MEC-Enabled IoT Systems With Imperfect CSI

机译:具有不完美CSI的MEC的IOT系统的联合计算卸载和资源分配

获取原文
获取原文并翻译 | 示例
           

摘要

Mobile-edge computing (MEC) is considered as a promising technology to reduce the energy consumption (EC) and task accomplishment latency of smart mobile user equipments (UEs) by offloading computation-intensive tasks to the nearby MEC servers. However, the Quality of Experience (QoE) for computation highly depends on the wireless channel conditions when computation tasks are offloaded to MEC servers. In this article, by considering the imperfect channel-state information (CSI), we study the joint offloading decision, transmit power, and computation resources to minimize the weighted sum of EC of all UEs while guaranteeing the probabilistic constraint in multiuser MEC-enabled Internet-of-Things (IoT) networks. This formulated optimization problem is a stochastic mixed-integer nonconvex problem and challenging to solve. To deal with it, we develop a low-complexity two-stage algorithm. In the first stage, we solve the relaxed version of the original problem to obtain offloading priorities of all UEs. In the second stage, we solve an iterative optimization problem to obtain a suboptimal offloading decision. As both stages include solving a series of nonconvex stochastic problems, we present a constrained stochastic successive convex approximation-based algorithm to obtain a near-optimal solution with low complexity. The numerical results demonstrate that the proposed algorithm provides comparable performance to existing approaches.
机译:移动边缘计算(MEC)被认为是通过将计算密集型任务卸载到附近的MEC服务器来减少智能移动用户设备(UE)的能耗(EC)和任务完成延迟的有希望的技术。然而,当计算任务卸载到MEC服务器时,计算的经验质量(QoE)高度取决于无线信道条件。在本文中,通过考虑不完美的信道状态信息(CSI),我们研究了联合卸载决策,传输功率和计算资源,以最小化所有UE的EC的加权之和,同时保证了支持多用户的MEC Internet中的概率约束-of-astion(物联网)网络。该配制的优化问题是一个随机混合整数的非核解问题,并具有挑战性地解决。要处理它,我们开发了一种低复杂性的两阶段算法。在第一阶段,我们解决了原始问题的轻松版本,以获得所有UE的卸载优先级。在第二阶段,我们解决了一个迭代优化问题,以获得次优卸载决定。由于这两个阶段包括解决一系列非凸起的随机问题,我们呈现了一个受约束的随机连续凸近似算法,以获得具有低复杂度的近最佳溶液。数值结果表明,所提出的算法对现有方法提供了可比性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号