Pith. sign in

REVIEW 1 cited by

Optimal Task Assignment and Power Allocation for NOMA Mobile-Edge Computing Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1904.12389 v1 pith:IS6QZI4F submitted 2019-04-28 cs.IT math.IT

classification cs.ITmath.IT
keywords taskcomputingnomaoffloadingpoweralgorithmnetworksoptimal
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Mobile edge computing (MEC) can enhance the computing capability of mobile devices, and non-orthogonal multiple access (NOMA) can provide high data rates. Combining these two technologies can effectively benefit the network with spectrum and energy efficiency. In this paper, we investigate the task completion time minimization in NOMA multiuser MEC networks, where multiple users can offload their tasks simultaneously via the same frequency band. We adopt the \emph{partial} offloading, in which each user can partition its computation task into offloading computing and locally computing parts. We aim to minimize the maximum task latency among users by optimizing their tasks partition ratios and offloading transmit power. By considering the energy consumption and transmitted power limitation of each user, the formulated problem is quasi-convex. Thus, a bisection search (BSS) iterative algorithm is proposed to obtain the minimum task completion time. To reduce the complexity of the BSS algorithm and evaluate its optimality, we further derive the closed-form expressions of the optimal task partition ratio and offloading power for two-user NOMA MEC networks based on the analysed results. Simulation results demonstrate the convergence and optimality of the proposed a BSS algorithm and the effectiveness of the proposed optimal derivation.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Generalizable Pareto-Optimal Offloading with Reinforcement Learning in Mobile Edge Computing

    eess.SY 2025-08 conditional novelty 6.0 of 10

    A single discrete soft actor-critic policy conditioned on preference and system context produces near-Pareto-optimal offloading decisions that generalize to unseen server counts and CPU frequencies.

Pith tools