Energy consumption optimization scheme in UAV-assisted MEC system based on optimal SIC order
In uplink non-orthogonal multiple access (NOMA)-based unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) system, the successive interference cancellation (SIC) order of NOMA became a bottleneck limiting the transmission performance of task offload in uplink link.To reduce the energy...
Saved in:
Main Authors: | , , , , , |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2024-02-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2024042/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | In uplink non-orthogonal multiple access (NOMA)-based unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) system, the successive interference cancellation (SIC) order of NOMA became a bottleneck limiting the transmission performance of task offload in uplink link.To reduce the energy consumption of the system, the SIC order was discussed and the optimal SIC order based on channel gain and task delay constraint was proposed.The optimization problem of minimizing the system energy consumption was proposed based on the optimal SIC order while satisfying the constraints of the given task delay of the device, the maximum transmit power constraint of the device, and the UAV trajectory.Since the problem was a complex non-convex problem, an alternating optimization method was adopted to solve the optimization problem to achieve power allocation and UAV trajectory optimization.A low-complexity algorithm based on matching theory was proposed to obtain the optimal device grouping in different time slots.Simulation results show that the optimal SIC order can realize smaller system energy consumption under the same task delay constraint compared with other SIC order, the proposed low-complexity device grouping algorithm can obtain the optimal device grouping. |
---|---|
ISSN: | 1000-436X |