pith. sign in

arxiv: 1907.03862 · v1 · pith:GIUA73FQnew · submitted 2019-07-08 · 📡 eess.SP

Task and Bandwidth Allocation for UAV-Assisted Mobile Edge Computing with Trajectory Design

Xiaoyan Hu , Kai-Kit Wong , Kun Yang , Zhongbin Zheng This is my paper

Pith reviewed 2026-05-25 00:37 UTC · model grok-4.3

classification 📡 eess.SP
keywords UAVmobile edge computingtrajectory optimizationenergy minimizationtask allocationbandwidth allocationalternating optimization
0
0 comments X

The pith

Joint optimization of task allocation, bandwidth allocation and UAV trajectory minimizes total energy of UAV and user equipments.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper studies a UAV-assisted mobile edge computing setup in which the UAV both computes tasks locally and relays tasks onward to an access point. It formulates an optimization that minimizes the sum of UAV and UE energy by deciding how much of each task to compute where, how to divide bandwidth, and what flight path the UAV should follow. The problem is subject to task latency limits, information-causality constraints, bandwidth limits and UAV flight constraints. Because the joint problem is non-convex, the authors develop an alternating algorithm that iteratively updates the three variable sets until convergence. Simulations indicate that the resulting solutions consume substantially less energy than several practical baselines, with the largest gains appearing on computation-heavy, delay-sensitive workloads.

Core claim

The total energy consumption of the UAV and UEs is minimized by jointly optimizing the task allocation, the bandwidth allocation and the UAV's trajectory, subject to the task constraints, the information-causality constraints, the bandwidth allocation constraints, and the UAV's trajectory constraints. The formulated optimization problem is nonconvex, and an alternating algorithm is proposed to optimize the parameters iteratively, yielding substantial energy reductions relative to practical baselines especially on computation-intensive and latency-critical tasks.

What carries the argument

Alternating optimization algorithm that iteratively solves the non-convex joint problem over task allocation, bandwidth allocation and UAV trajectory.

If this is right

  • Joint design of task split, bandwidth split and flight path yields lower total energy than separate optimization of each variable.
  • The alternating procedure converges to feasible points that respect all latency, causality, bandwidth and trajectory limits.
  • Energy savings are largest when tasks are both computation-heavy and delay-sensitive.
  • The same formulation applies to any single-UAV MEC relay scenario obeying the stated information-causality and flight constraints.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same alternating structure could be reused for multi-UAV or time-varying channel versions of the problem.
  • Reported energy reductions imply longer feasible UAV endurance or higher task throughput under a fixed battery budget.
  • The information-causality constraint may become the dominant bottleneck when the UAV must forward many tasks onward to the access point.

Load-bearing premise

The alternating algorithm produces solutions sufficiently close to optimal and the modeled constraints including perfect channel knowledge and exact task sizes accurately represent real deployments.

What would settle it

Compare the energy value returned by the alternating algorithm on a small instance against a globally optimal value obtained by exhaustive search or a tight convex relaxation lower bound.

Figures

Figures reproduced from arXiv: 1907.03862 by Kai-Kit Wong, Kun Yang, Xiaoyan Hu, Zhongbin Zheng.

Figure 2
Figure 2. Figure 2: The TEC of the UAV and UEs versus the uniform task size: [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: The TEC of the UAV and UEs versus the total task complet [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
read the original abstract

In this paper, we investigate a mobile edge computing (MEC) architecture with the assistance of an unmanned aerial vehicle (UAV). The UAV acts as a computing server to help the user equipment (UEs) compute their tasks as well as a relay to further offload the UEs' tasks to the access point (AP) for computing. The total energy consumption of the UAV and UEs is minimized by jointly optimizing the task allocation, the bandwidth allocation and the UAV's trajectory, subject to the task constraints, the information-causality constraints, the bandwidth allocation constraints, and the UAV's trajectory constraints. The formulated optimization problem is nonconvex, and we propose an alternating algorithm to optimize the parameters iteratively. The effectiveness of the algorithm is verified by the simulation results, where great performance gain is achieved in comparison with some practical baselines, especially in handling the computation-intensive and latency-critical tasks.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The paper investigates a UAV-assisted mobile edge computing architecture in which the UAV serves as both a computing server for user equipment (UEs) and a relay to an access point. The central claim is that the total energy consumption of the UAV and UEs can be minimized by jointly optimizing task allocation, bandwidth allocation, and the UAV trajectory, subject to task constraints, information-causality constraints, bandwidth constraints, and trajectory constraints. The resulting non-convex problem is solved via an alternating optimization algorithm, with effectiveness demonstrated through simulations that report performance gains relative to practical baselines, particularly for computation-intensive and latency-critical tasks.

Significance. If the simulation results and algorithm performance hold under the stated modeling assumptions, the work contributes a joint optimization framework that integrates communication, computation offloading, and mobility in UAV-MEC systems. This is relevant to energy-efficient designs for latency-sensitive applications in wireless networks. The alternating-optimization approach is conventional for this problem class, and the emphasis on information-causality and trajectory constraints aligns with standard modeling practices in the field.

minor comments (2)
  1. [Abstract] Abstract: the claim of 'great performance gain' is stated without any quantitative metrics, specific baseline definitions, or reference to figures/tables; adding these would improve clarity of the central empirical claim.
  2. [Algorithm description] The manuscript does not appear to include a convergence analysis or stationarity guarantee for the alternating algorithm applied to the non-convex joint problem; while not required for all simulation papers, a brief discussion or reference to standard results would strengthen the algorithmic contribution.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive review, accurate summary of the manuscript, and recommendation of minor revision. No major comments were raised in the report.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper formulates a joint non-convex optimization problem directly from energy consumption expressions and explicit system constraints (task deadlines, information causality, bandwidth limits, trajectory limits). It then applies a standard alternating iterative algorithm to solve the problem and validates performance via simulation against baselines. No load-bearing step reduces a claimed result to a fitted parameter renamed as prediction, a self-definition, or a self-citation chain; the central claim remains an engineering optimization procedure whose correctness is assessed externally by simulation outcomes rather than by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Only the abstract is available; no explicit free parameters, axioms, or invented entities are identifiable.

pith-pipeline@v0.9.0 · 5688 in / 1258 out tokens · 26379 ms · 2026-05-25T00:37:50.955698+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

21 extracted references · 21 canonical work pages · 2 internal anchors

  1. [1]

    Mobile edge computing: A survey on architec- ture and computation offloading,

    P . Mach and Z. Becvar, “Mobile edge computing: A survey on architec- ture and computation offloading,” IEEE Commun. Surveys Tuts. , vol. 19, no. 3, pp. 1628–1656, thirdquarter 2017

    work page 2017

  2. [2]

    A sur vey on mobile edge computing: The communication perspective,

    Y . Mao, C. Y ou, J. Zhang, K. Huang, and K. B. Letaief, “A sur vey on mobile edge computing: The communication perspective,” IEEE Commun. Surveys Tuts. , vol. 19, no. 4, pp. 2322–2358, Fourthquarter 2017

    work page 2017

  3. [3]

    Joint op timization of radio and computational resources for multicell mobile-edge com puting,

    S. Sardellitti, G. Scutari, and S. Barbarossa, “Joint op timization of radio and computational resources for multicell mobile-edge com puting,” IEEE Signal Inf. Process. Netwo. , vol. 1, no. 2, pp. 89–103, Jun. 2015

    work page 2015

  4. [4]

    Energy-efficient resource allocation for mobile-edge computation offloading,

    C. Y ou, K. Huang, H. Chae, and B. H. Kim, “Energy-efficient resource allocation for mobile-edge computation offloading,” IEEE Trans. Wire- less Commun. , vol. 16, no. 3, pp. 1397–1411, Mar. 2017

    work page 2017

  5. [5]

    Offloading i n mobile edge computing: Task allocation and computational frequen cy scaling,

    T. Q. Dinh, J. Tang, Q. D. La, and T. Q. S. Quek, “Offloading i n mobile edge computing: Task allocation and computational frequen cy scaling,” IEEE Trans. Commun. , vol. 65, no. 8, pp. 3571–3584, Aug. 2017

    work page 2017

  6. [6]

    Edge and central cloud computing: A perfect pairing for high ener gy efficiency and low-latency,

    X. Hu, L. Wang, K.-K. Wong, Y . Zhang, Z. Zheng, and M. Tao, “ Edge and central cloud computing: A perfect pairing for high ener gy efficiency and low-latency,” 2018

    work page 2018

  7. [7]

    Joint offloading and computa tion energy efficiency maximization in a mobile edge computing sy stem,

    H. Sun, F. Zhou, and R. Q. Hu, “Joint offloading and computa tion energy efficiency maximization in a mobile edge computing sy stem,” IEEE Trans. V eh. Technol., vol. 68, no. 3, pp. 3052–3056, Mar. 2019

    work page 2019

  8. [8]

    Wireless powered cooperatio n-assisted mobile edge computing,

    X. Hu, K. Wong, and K. Y ang, “Wireless powered cooperatio n-assisted mobile edge computing,” IEEE Trans. Wireless Commun., vol. 17, no. 4, pp. 2375–2388, Apr. 2018

    work page 2018

  9. [9]

    Wireless communication s with unmanned aerial vehicles: opportunities and challenges,

    Y . Zeng, R. Zhang, and T. J. Lim, “Wireless communication s with unmanned aerial vehicles: opportunities and challenges,” IEEE Commun. Mag., vol. 54, no. 5, pp. 36–42, May 2016

    work page 2016

  10. [10]

    Ultra reli able uav communication using altitude and cooperation diversity,

    M. M. Azari, F. Rosas, K. Chen, and S. Pollin, “Ultra reli able uav communication using altitude and cooperation diversity,” IEEE Trans. Commun., vol. 66, no. 1, pp. 330–344, Jan. 2018

    work page 2018

  11. [11]

    Uav-enabled wireless powe r transfer: Trajectory design and energy optimization,

    J. Xu, Y . Zeng, and R. Zhang, “Uav-enabled wireless powe r transfer: Trajectory design and energy optimization,” IEEE Trans. Wireless Com- mun., vol. 17, no. 8, pp. 5092–5106, Aug. 2018

    work page 2018

  12. [12]

    Mobile edge computin g via a uav- mounted cloudlet: Optimization of bit allocation and path p lanning,

    S. Jeong, O. Simeone, and J. Kang, “Mobile edge computin g via a uav- mounted cloudlet: Optimization of bit allocation and path p lanning,” IEEE Trans. V eh. Technol., vol. 67, no. 3, pp. 2049–2063, Mar. 2018

    work page 2049

  13. [13]

    Computation rate ma ximiza- tion in uav-enabled wireless-powered mobile-edge computi ng systems,

    F. Zhou, Y . Wu, R. Q. Hu, and Y . Qian, “Computation rate ma ximiza- tion in uav-enabled wireless-powered mobile-edge computi ng systems,” IEEE J. Sel. Areas Commun. , vol. 36, no. 9, pp. 1927–1941, Sep. 2018

    work page 1927

  14. [14]

    UAV-Assisted Relaying and Edge Computing: Scheduling and Trajectory Optimization

    X. Hu, K.-K. Wong, K. Y ang, and Z. Zheng, “Uav-assisted r elaying and edge computing: Scheduling and trajectory optimization,” arXiv preprint arXiv:1812.02658, 2018

    work page internal anchor Pith review Pith/arXiv arXiv 2018

  15. [15]

    Energy-efficient uav communicati on with trajectory optimization,

    Y . Zeng and R. Zhang, “Energy-efficient uav communicati on with trajectory optimization,” IEEE Trans. Wireless Commun , vol. 16, no. 6, pp. 3747–3760, Jun. 2017

    work page 2017

  16. [16]

    Energy- optimal mobile cloud computing under stochastic wireless c hannel,

    W. Zhang, Y . Wen, K. Guan, D. Kilper, H. Luo, and D. O. Wu, “ Energy- optimal mobile cloud computing under stochastic wireless c hannel,” IEEE Trans. Wireless Commun. , vol. 12, no. 9, pp. 4569–4581, Sep. 2013

    work page 2013

  17. [17]

    Accessing From The Sky: A Tutorial on UAV Communications for 5G and Beyond

    Y . Zeng, Q. Wu, and R. Zhang, “Accessing from the sky: A tu - torial on uav communications for 5g and beyond,” arXiv preprint arXiv:1903.05289, 2019

    work page internal anchor Pith review Pith/arXiv arXiv 1903

  18. [18]

    Boyd and L

    S. Boyd and L. V andenberghe, Convex optimization . Cambridge university press, 2004

    work page 2004

  19. [19]

    D. P . Bertsekas and J. N. Tsitsiklis, Parallel and distributed computation: numerical methods. Prentice hall Englewood Cliffs, NJ, 1989, vol. 23

    work page 1989

  20. [20]

    On the lambertw function,

    R. M. Corless, G. H. Gonnet, D. E. Hare, D. J. Jeffrey, and D. E. Knuth, “On the lambertw function,” Advances in Computational mathematics , vol. 5, no. 1, pp. 329–359, 1996

    work page 1996

  21. [21]

    Cvx: Matlab software for di sciplined convex programming,

    M. Grant, S. Boyd, and Y . Y e, “Cvx: Matlab software for di sciplined convex programming,” 2008

    work page 2008