{"title":"集群NOMA网络中移动边缘计算的卸载效率最大化","authors":"M. W. Baidas","doi":"10.1109/IEMCON51383.2020.9284932","DOIUrl":null,"url":null,"abstract":"This paper considers the problem of offloading-efficiency maximization for a mobile edge computing (MEC) nonorthogonal multiple-access (NOMA) network with user clusters. The goal is to maximize network offloading-efficiency via joint power allocation, and computing resource allocation (J-PA-CRA), under the partial offloading mode, and subject to delay and transmit power constraints. However, the formulated problem happens to be non-convex, and thus is computationally-prohibitive. In turn, a low-complexity solution procedure is proposed, which optimally solves problem J-PA-CRA via successive convex approximation. Simulation results are provided to validate the proposed solution procedure, illustrating that it yields the optimal network offloading-efficiency, in comparison to the J-PA-CRA scheme (solved via a global optimization package), and superior to its OMA counterpart schemes (e.g. FDMA and TDMA).","PeriodicalId":6871,"journal":{"name":"2020 11th IEEE Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)","volume":"70 1","pages":"0101-0107"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Offloading-Efficiency Maximization for Mobile Edge Computing in Clustered NOMA Networks\",\"authors\":\"M. W. Baidas\",\"doi\":\"10.1109/IEMCON51383.2020.9284932\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers the problem of offloading-efficiency maximization for a mobile edge computing (MEC) nonorthogonal multiple-access (NOMA) network with user clusters. The goal is to maximize network offloading-efficiency via joint power allocation, and computing resource allocation (J-PA-CRA), under the partial offloading mode, and subject to delay and transmit power constraints. However, the formulated problem happens to be non-convex, and thus is computationally-prohibitive. In turn, a low-complexity solution procedure is proposed, which optimally solves problem J-PA-CRA via successive convex approximation. Simulation results are provided to validate the proposed solution procedure, illustrating that it yields the optimal network offloading-efficiency, in comparison to the J-PA-CRA scheme (solved via a global optimization package), and superior to its OMA counterpart schemes (e.g. FDMA and TDMA).\",\"PeriodicalId\":6871,\"journal\":{\"name\":\"2020 11th IEEE Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)\",\"volume\":\"70 1\",\"pages\":\"0101-0107\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-11-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 11th IEEE Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IEMCON51383.2020.9284932\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 11th IEEE Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEMCON51383.2020.9284932","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Offloading-Efficiency Maximization for Mobile Edge Computing in Clustered NOMA Networks
This paper considers the problem of offloading-efficiency maximization for a mobile edge computing (MEC) nonorthogonal multiple-access (NOMA) network with user clusters. The goal is to maximize network offloading-efficiency via joint power allocation, and computing resource allocation (J-PA-CRA), under the partial offloading mode, and subject to delay and transmit power constraints. However, the formulated problem happens to be non-convex, and thus is computationally-prohibitive. In turn, a low-complexity solution procedure is proposed, which optimally solves problem J-PA-CRA via successive convex approximation. Simulation results are provided to validate the proposed solution procedure, illustrating that it yields the optimal network offloading-efficiency, in comparison to the J-PA-CRA scheme (solved via a global optimization package), and superior to its OMA counterpart schemes (e.g. FDMA and TDMA).