상세 보기
초록
To capture the ubiquitous randomness such as timevarying 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 timeslot and achieves an [O(epsilon);O(1/epsilon)]-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.
키워드
- 제목
- Momentum-Based Online Cost Minimization for Task Offloading in NOMA-Aided MEC Networks
- 저자
- Jing, Zewei; Yang, Qinghai; Qin, Meng; Kwak, Kyung Sup
- 발행일
- 2020
- 유형
- Proceedings Paper
- 저널명
- 2020 IEEE 92ND VEHICULAR TECHNOLOGY CONFERENCE (VTC2020-FALL)