Zhixin Liu;Jiawei Su;Jianshuai Wei;Wenxuan Chen;Kit Yan Chan;Yazhou Yuan;Xinping Guan
{"title":"Joint Robust Power Control and Task Scheduling for Vehicular Offloading in Cloud-Assisted MEC Networks","authors":"Zhixin Liu;Jiawei Su;Jianshuai Wei;Wenxuan Chen;Kit Yan Chan;Yazhou Yuan;Xinping Guan","doi":"10.1109/TNSE.2024.3508847","DOIUrl":null,"url":null,"abstract":"Leveraging the abundance of computational resources, the cloud-edge collaborative architecture provide stronger data processing capabilities for vehicular networks, which not only significantly enhances the timeliness of offloading operations for delay-sensitive tasks but also substantially mitigates resource expenditure associated with non-delay-sensitive tasks. Addressing the communication scenarios characterized by diverse task types, this paper introduces cloud-assisted mobile-edge computing (C-MEC) networks, underscored by a novel optimization scheme. The scheme incorporates a utility function that is correlated with offloading delays during the transmission and computation phases, effectively balancing resource allocations and enhancing the operational efficiency of vehicular networks. However, the mobility of vehicles introduces channel uncertainty, adversely affecting the offloading stability of C-MEC networks. To develop a practical channel model, a first-order Markov process is employed, taking into account vehicular mobility. Additionally, probability constraints regarding co-channel interference are imposed on signal links to ensure the offloading quality. The Bernstein approximation method is utilized to transform the original interference constraints into a tractable form, and the Successive Convex Approximation (SCA) technique is meticulously applied to address the non-convex robust optimization problem. Furthermore, this paper proposes a robust iterative algorithm to ascertain optimal power control and task scheduling strategies. Numerical simulations are conducted to assess the effective of the proposed algorithm against benchmark methods, with a particular focus on robustness in task offloading and utility in resource allocation.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 2","pages":"698-709"},"PeriodicalIF":6.7000,"publicationDate":"2024-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10771695/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0
Abstract
Leveraging the abundance of computational resources, the cloud-edge collaborative architecture provide stronger data processing capabilities for vehicular networks, which not only significantly enhances the timeliness of offloading operations for delay-sensitive tasks but also substantially mitigates resource expenditure associated with non-delay-sensitive tasks. Addressing the communication scenarios characterized by diverse task types, this paper introduces cloud-assisted mobile-edge computing (C-MEC) networks, underscored by a novel optimization scheme. The scheme incorporates a utility function that is correlated with offloading delays during the transmission and computation phases, effectively balancing resource allocations and enhancing the operational efficiency of vehicular networks. However, the mobility of vehicles introduces channel uncertainty, adversely affecting the offloading stability of C-MEC networks. To develop a practical channel model, a first-order Markov process is employed, taking into account vehicular mobility. Additionally, probability constraints regarding co-channel interference are imposed on signal links to ensure the offloading quality. The Bernstein approximation method is utilized to transform the original interference constraints into a tractable form, and the Successive Convex Approximation (SCA) technique is meticulously applied to address the non-convex robust optimization problem. Furthermore, this paper proposes a robust iterative algorithm to ascertain optimal power control and task scheduling strategies. Numerical simulations are conducted to assess the effective of the proposed algorithm against benchmark methods, with a particular focus on robustness in task offloading and utility in resource allocation.
期刊介绍:
The proposed journal, called the IEEE Transactions on Network Science and Engineering (TNSE), is committed to timely publishing of peer-reviewed technical articles that deal with the theory and applications of network science and the interconnections among the elements in a system that form a network. In particular, the IEEE Transactions on Network Science and Engineering publishes articles on understanding, prediction, and control of structures and behaviors of networks at the fundamental level. The types of networks covered include physical or engineered networks, information networks, biological networks, semantic networks, economic networks, social networks, and ecological networks. Aimed at discovering common principles that govern network structures, network functionalities and behaviors of networks, the journal seeks articles on understanding, prediction, and control of structures and behaviors of networks. Another trans-disciplinary focus of the IEEE Transactions on Network Science and Engineering is the interactions between and co-evolution of different genres of networks.