Pith. sign in

REVIEW 4 major objections 6 minor 41 references

Joint Optimization of User Association and Resource Allocation for Load Balancing With Multi-Level Fairness

T0 review · 4 major / 6 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper claims that letting each user carry its own alpha-fairness parameter allows a distributed pricing algorithm to jointly solve user association and resource allocation while converging to a near-optimal solution.

desk verdict A genuinely useful HAF formulation and a distributed algorithm that works in simulation, but the advertised ε-optimality proof has a real gap: the subgradient update doesn't match Algorithm 2, and Theorem 2 never closes the primal gap. read the letter →

arxiv 2505.08573 v1 pith:WR2ZUZRW submitted 2025-05-13 eess.SP

Jonggyu Jang , Hyeonsu Lyu , David J. Love , Hyun Jong Yang This is my paper · ORCID
classification eess.SP
keywords userassociationresourceallocationheterogeneousalpha-fairnessloadbalancingpricing-basedoptimizationLagrangiandualitydistributedalgorithmconvergenceanalysis
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper introduces heterogeneous $\alpha$-fairness (HAF), a generalization of $\alpha$-fairness in which each user has its own parameter $\alpha_i$ instead of sharing one network-wide $\alpha$, and argues that this is the right objective for dense networks with mixed traffic. For that objective, it proposes a distributed, pricing-based algorithm that jointly decides which base station serves each user and how each base station splits its bandwidth, and proves that the algorithm converges to a solution whose optimality gap shrinks as $O(1/\sqrt{T})$ in the number of iterations. If these claims hold, network operators can steer throughput, latency, and fairness user-by-user without a central optimizer, using only broadcast prices and local decisions, which matters because emerging low-latency applications need fast, simple, distributed control.

What carries the argument

The load-bearing object is the HAF objective $\sum_i (\gamma_i y_i)^{1-\alpha_i}/(1-\alpha_i)$, with a distinct $\alpha_i$ per user, paired with a Lagrangian dual over base-station prices $\mu_j$. The machinery that makes the problem tractable is the price structure: for fixed prices, the per-user association rule collapses to $\arg\max_j \gamma_{ij}/\mu_j$, and the per-base-station resource allocation is found by locating the unique $\lambda_j$ satisfying $\sum_i \lambda_j^{-1/\alpha_i} \gamma_{ij}^{1/\alpha_i - 1} x_{ij} = 1$. The same $\lambda_j$ is then identified with the price $\mu_j$, turning the combinatorial association problem into a convex nondifferentiable dual minimization that subgradient descent can handle.

What would settle it

Run Algorithm 2 exactly as written for a fixed channel and record $\min_{t \le T} g(\mu^{(t)}) - g(\mu^*)$ for growing $T$; if the observed duality gap does not shrink at the predicted $O(1/\sqrt{T})$ rate, or lies above $G\|\mu^{(1)} - \mu^*\|^2/\sqrt{T}$ at large $T$, the match between theorem and implementation fails. A second check is to compare Algorithm 2's final association against the $\arg\max$ rule evaluated at the final prices: if they disagree, the subgradient updates are not the ones the proof requires.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central discovery is that heterogeneous $\alpha$-fairness remains tractable under distributed pricing. The authors formulate the joint user-association and resource-allocation problem as a mixed-integer program, relax it through Lagrangian duality with base-station prices $\mu_j$, and show that the optimal user decision reduces to associating with the base station maximizing $\gamma_{ij}/\mu_j$, while each base station updates its price by a subgradient step. They prove that the dual function converges to within $\epsilon$ of its minimum in $O(1/\sqrt{T})$ iterations, and they prove an optimality-gap bound relating the algorithm's HAF value to the global optimum through the slack price variables. Numerically, they report that the distributed scheme matches centralized local-search and genetic baselines while beating homogeneous-$\alpha$ pricing baselines on the HAF objective and on group-wise throughput, fairness, latency, and min-rate metrics.

Load-bearing premise

The proof of the $O(1/\sqrt{T})$ convergence bound assumes that the association matrix used in each price update is the exact optimal response to the current prices, but Algorithm 2 as written recomputes associations after updating prices, so the theorem may not apply to the implemented update order.

Editorial extensions

If this is right

  • Operators can tune each user's $\alpha_i$ to its service class, and the same distributed loop will steer the network toward the corresponding operating point between throughput, fairness, and latency.
  • The per-user decision rule is simple: each user needs only the broadcast prices and its own spectral efficiencies, so no inter-base-station coordination is required.
  • Under the paper's bounds, more iterations shrink the optimality gap at rate $O(1/\sqrt{T})$, giving a concrete accuracy-versus-latency tradeoff for online use.
  • In the reported simulations, the method outperforms homogeneous-alpha pricing baselines on the HAF objective and on group-wise min-rate and latency metrics, suggesting that differentiated $\alpha$ values buy real gains in mixed-priority networks.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The paper treats $\alpha_i$ as a fixed input, but the same pricing loop could be wrapped in an outer controller that raises $\alpha_i$ for users missing latency targets and lowers it for throughput-dominated users, making the fairness parameter itself a tunable network-control variable.
  • If the mismatch between the proof's update order and Algorithm 2's Stage-1-before-Stage-2 order is repaired, for instance by a two-timescale analysis or by reordering the updates, the $O(1/\sqrt{T})$ bound would cover the implementation as written; this is a technical fix rather than a conceptual obstacle.
  • The reported behavior that the proposed method's HAF keeps rising with user count in the low-fairness scenario while baselines fall suggests that heterogeneous $\alpha$ values become more valuable as contention grows, a scaling prediction that could be tested directly by sweeping the number of users at fixed channel statistics.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 6 minor

Summary. The paper proposes a heterogeneous alpha-fairness (HAF) objective in which each user has its own alpha_i, formulates the joint user association and resource allocation (UARA) problem as a mixed-integer problem, and solves it with a distributed pricing-based algorithm. For a fixed user association, the RA subproblem is solved by a one-dimensional search for the per-BS Lagrange multiplier lambda_j (Lemma 1, Algorithm 1). User association is then updated by the per-user argmax rule (17), and prices are updated by the subgradient step (19). The authors claim O(1/sqrt(T)) convergence to an epsilon-optimal solution of the dual problem and, via Theorem 2, near-optimality of the original HAF problem. The simulations, implemented with NVIDIA Sionna, compare the proposed method with pricing-based baselines and with the centralized 2RS and GA schemes in static and time-varying channels.

Significance. HAF is a natural extension of alpha-fairness, and the per-user argmax rule (17) is a clean and useful result: under the proposed pricing, the association decision depends on gamma_ij/mu_j. The RA KKT analysis in Lemma 1 and Algorithm 1 is essentially correct, and the experimental comparison is reasonably thorough, including centralized baselines and time-varying channels. The derivation is self-contained and does not rely on fitted parameters. If the advertised optimality guarantee can be established, the contribution would be significant for distributed load balancing. However, the current proof chain does not establish the claimed epsilon-optimality for the original problem P1, which materially tempers the significance.

major comments (4)
  1. [Section III-B, Eq. (19) and Algorithm 2] The price update in Eq. (19) and Algorithm 2 line 8 is not a subgradient of g(mu) as written. From Eq. (18), a subgradient coordinate with respect to mu_j is 1 minus the sum over all users i in the active set I_j(mu) of hat{gamma}_ij mu_j^{-1/alpha_i}, where I_j(mu) is the set of users attaining the argmax at the current mu. The implemented update uses a single hat{gamma}_ij with an unspecified index i and omits the sum over associated users, so the update direction is not in the subdifferential at mu(t). Since inequality (32) is the standard subgradient inequality requiring g_t in partial g(mu(t)), Theorem 1 does not apply to the stated algorithm. Restoring the sum over i in I_j and defining the active set explicitly may be a local fix, but without it the O(1/sqrt(T)) claim is unsupported.
  2. [Algorithm 2, Stage 1 before Stage 2] Even if the sum over i is corrected, Algorithm 2 updates mu(t+1) in Stage 1 using the user association X produced in Stage 2 of iteration t-1. The proof of Theorem 1 in Appendix B assumes that the update direction is a subgradient at mu(t), which requires X to be the argmax in Eq. (17) evaluated at the current mu(t), not at mu(t-1). The paper provides no analysis of this stale-gradient scheme, so the descent inequality (31) cannot be invoked for the algorithm as written. The authors should either reorder the stages so that the association is recomputed after the price update, or prove a modified convergence result for stale subgradients with an explicit error term.
  3. [Theorem 2 and Appendix C] The claimed optimality for the primal problem is not proven. The theorem statement contains undefined quantities (Lambda* and hat{Lambda}), and the sentence 'where bLambda and Lambda* are' is incomplete. Appendix C actually derives a bound on g* - f*, which by weak duality gives an upper bound on f_opt - f*, but the right-hand side of Eq. (22)/(36) is not shown to converge to zero: hat{Lambda} is the output of the line search in Algorithm 1, and no dependence of hat{Lambda} - Lambda* on T or eta is established. Therefore the abstract's claim of convergence to an epsilon-optimal solution with epsilon decreasing in the number of iterations is not supported for the original problem P1. This requires either a quantitative bound on hat{Lambda} - Lambda* or a revised, weaker statement of the optimality guarantee.
  4. [Appendix B, Eq. (29), and Algorithm 2] The proof of Theorem 1 uses the projected update mu(t+1) = [mu(t) - eta g_t]^+ in Eq. (29), but Algorithm 2 line 8 does not include the projection onto mu_j >= 0. Without this projection, the iterates may leave the feasible set of P5, and the comparison with mu* in inequality (30) is not justified. The algorithm pseudocode should include the projection, or the proof should be modified to handle unprojected iterates.
minor comments (6)
  1. [Section II-B] The subproblem P2 is introduced with the words 'we have the following UA problem', but P2 is the resource allocation problem for fixed user association; the wording should be corrected.
  2. [Section III-B, Eqs. (13)-(16) and P4] The multiplier notation is inconsistent: P4a and Eq. (13) use lambda_i where the multiplier should be indexed by the BS j, and the sentence 'we continue the optimization of lambda_i' should read lambda_j. This index confusion makes the derivation harder to follow.
  3. [Section V, Simulation setup] In the high fairness scenario, the mixing ratio is given as 'A1 : A2 : A3 : A4 = 0.25 : 0.125 : 0.19 : 0.375 : 0.31', which lists five numbers, sums to more than one, and cannot correspond to the four listed groups; the intended distribution should be corrected.
  4. [Theorem 2 statement] The sentence 'where bLambda and Lambda* are' is grammatically incomplete and should be finished.
  5. [Eq. (19) and Table I] In Eq. (19) and Algorithm 2 line 8, the index i on the right-hand side is not defined, whereas Table I correctly writes f2 as a sum over i in I_j; the pseudocode should define the active set I_j explicitly.
  6. [Figure 3] Figure 3 would be clearer with labeled axes and a legend entry for the dual function, since the caption refers to both HAF and g(mu).

Circularity Check

0 steps flagged · score 0.0 of 10

No circular reduction: the HAF derivation is self-contained; the proof gaps in Theorems 1-2 are correctness concerns, not definitional circularity.

full rationale

I walked the derivation chain from P1 through the KKT-based RA solution (Lemma 1), the surrogate problem P4, the Lagrangian dual, the identification lambda_j = mu_j in Eq. (15), the user-association argmax in Eq. (17), and the subgradient update in Eq. (19). Each step is derived from the previous equations rather than assumed from the conclusion. The heterogeneous alpha-fairness objective is a genuine generalization of standard alpha-fairness, and the pricing functions f1 = gamma_ij/mu_j and f2 are obtained from the dual subgradient, not fitted to a target output. The paper does cite the authors' own earlier works [15], [17], [19], but only as baselines and prior pricing formulations; none of the cited results is used to justify the new convergence or optimality claims, and no uniqueness theorem is imported from those works. The main weaknesses are rigor gaps rather than circularity: Theorem 1 requires the update to be a subgradient of g(mu(t)), while Algorithm 2 uses an association from the previous iteration and Eq. (19) omits the sum over associated users that the true subgradient requires; Theorem 2's statement is incomplete ('where bLambda and Lambda* are The proof...'), and Appendix C actually bounds g* - f* rather than f_opt - f*. These are important correctness issues, but they do not make the paper's claims equivalent to its inputs by construction. There are no fitted parameters renamed as predictions, no ansatz smuggled in via self-citation, and no re-labeling of a known result. The derivation is self-contained, so no significant circularity is present.

Assumptions & free parameters 2 free parameters · 5 assumptions · 0 invented entities

The central derivation relies on standard concave optimization (KKT, weak duality) and on the assumption that α_i>0. No invented entities are introduced. The main free choices are the algorithmic step sizes, which are not fully specified.

free parameters (2)
  • subgradient step size η = not specified
    Theorem 1 gives a step-size schedule depending on unknown quantities (∥μ(1)-μ*∥ and G), but Algorithm 2 and the experiments do not state the value used. The convergence rate and any practical tuning depend on this hand-chosen parameter.
  • RA line-search parameters (step=1000, iters=12) = step=1000, iters=12
    Algorithm 1 fixes the initial step and the number of iterations by hand; the accuracy of the λ solution, and hence the optimality gap in Theorem 2, depends on these choices.
assumptions (5)
  • domain assumption α_i > 0 for all users
    Used for uniqueness of λ in Lemma 1, for the sign of the derivative in (15), and to exclude the undefined α_i=1 case. Stated in Section III-A.
  • domain assumption Unique user association: each user is served by exactly one BS
    Enforced by constraints (P1d)-(P1e); makes the problem combinatorial and matches the practical signaling assumption. Stated in Section II.
  • ad hoc to paper Bounded subgradients: ∥g_t∥ ≤ G for all t
    Theorem 1 assumes a global bound G on the subgradient norm without deriving one from problem data; the step-size formula uses G. Not established for the HAF dual function.
  • standard math KKT conditions are necessary and sufficient for the concave RA subproblem P3
    Used in Lemma 1 and Appendix A to characterize the global optimum; valid for the concave maximization over a simplex.
  • standard math Weak duality for the Lagrangian relaxation of P4
    Used in Theorem 2 (Appendix C) to bound the primal objective by the dual optimum d*; standard for the Lagrangian formed in (13).

how reviews work

0 comments
Cite this review

Pith. "Pith review of Joint Optimization of User Association and Resource Allocation for Load Balancing With Multi-Level Fairness." pith.science (2026). https://pith.science/paper/WR2ZUZRW

@misc{pith2026250508573,
  author       = {Pith},
  title        = {Pith review of: Joint Optimization of User Association and Resource Allocation for Load Balancing With Multi-Level Fairness},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/WR2ZUZRW}},
  note         = {Machine review of arXiv:2505.08573}
}
abstract

User association, the problem of assigning each user device to a suitable base station, is increasingly crucial as wireless networks become denser and serve more users with diverse service demands. The joint optimization of user association and resource allocation (UARA) is a fundamental issue for future wireless networks, as it plays a pivotal role in enhancing overall network performance, user fairness, and resource efficiency. Given the latency-sensitive nature of emerging network applications, network management favors algorithms that are simple and computationally efficient rather than complex centralized approaches. Thus, distributed pricing-based strategies have gained prominence in the UARA literature, demonstrating practicality and effectiveness across various objective functions, e.g., sum-rate, proportional fairness, max-min fairness, and alpha-fairness. While the alpha-fairness frameworks allow for flexible adjustments between efficiency and fairness via a single parameter $\alpha$, existing works predominantly assume a homogeneous fairness context, assigning an identical $\alpha$ value to all users. Real-world networks, however, frequently require differentiated user prioritization due to varying application requirements and latency. To bridge this gap, we propose a novel heterogeneous alpha-fairness (HAF) objective function, assigning distinct {\alpha} values to different users, thereby providing enhanced control over the balance between throughput, fairness, and latency across the network. We present a distributed, pricing-based optimization approach utilizing an auxiliary variable framework and provide analytical proof of its convergence to an $\epsilon$-optimal solution, where the optimality gap $\epsilon$ decreases with the number of iterations.

Figures

Figures reproduced from arXiv: 2505.08573 by the authors.

Figure 1
Figure 1. Illustration of the system model. The small cell BSs and macro [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Illustration of the distributed optimization algorithm. [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. Illustration of the convergence of the proposed method. [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figures from the paper (6 more)
Figure 4
Figure 4. Figure 4: HAF performances of the proposed method and baseline schemes for [PITH_FULL_IMAGE:figures/full_fig_p008_4.png]
Figure 5
Figure 5. Figure 5: Per-group metrics of the proposed method and baseline schemes: (a) [PITH_FULL_IMAGE:figures/full_fig_p008_5.png]
Figure 7
Figure 7. Figure 7: Per-group metrics of the proposed method and baseline schemes: (a) [PITH_FULL_IMAGE:figures/full_fig_p009_7.png]
Figure 6
Figure 6. Figure 6: HAF performances of the proposed method and baseline schemes for [PITH_FULL_IMAGE:figures/full_fig_p009_6.png]
Figure 8
Figure 8. Figure 8: HAF in time-varying channels, where the correlation of the adjacent channel is (a) 0.97 and (b) 0.9. At the start of the time slot, the price of each [PITH_FULL_IMAGE:figures/full_fig_p010_8.png]
Figure 9
Figure 9. Figure 9: Per-group metrics of the proposed method and baseline schemes ((a),(e): Sum-rate, (b),(f): Proportional fairness, (c), (g): Average latency, and (d), [PITH_FULL_IMAGE:figures/full_fig_p010_9.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

41 extracted references · 39 canonical work pages

  1. [19]

    α-fairness-maximizing user association in energy-constrained small cell networks,

    J. Jang and H. J. Yang, “ α-fairness-maximizing user association in energy-constrained small cell networks,” IEEE Trans. Wireless Com- mun., vol. 21, no. 9, pp. 7443–7459, 2022

    work page 2022

  2. [1]

    Key focus areas and enabling technologies for 6g,

    C. G. Brinton, M. Chiang, K. T. Kim, D. J. Love, M. Beesley, M. Repeta, J. Roese, P. Beming, E. Ekudden, C. Li et al. , “Key focus areas and enabling technologies for 6g,” IEEE Commun. Mag. , vol. 63, no. 3, pp. 84–91, 2025

    work page 2025

  3. [2]

    6 g takes shape,

    J. G. Andrews, T. E. Humphreys, and T. Ji, “6 g takes shape,” IEEE BITS the Information Theory Magazine , 2024

    work page 2024

  4. [3]

    A survey on resource allocation for 5G heterogeneous networks: Current research, future trends, and challenges,

    Y . Xu, G. Gui, H. Gacanin, and F. Adachi, “A survey on resource allocation for 5G heterogeneous networks: Current research, future trends, and challenges,” IEEE Commun. Surv. Tutor. , vol. 23, no. 2, pp. 668–695, 2021. 13

    work page 2021

  5. [4]

    User association in 5G networks: A survey and an outlook,

    D. Liu, L. Wang, Y . Chen, M. Elkashlan, K.-K. Wong, R. Schober, and L. Hanzo, “User association in 5G networks: A survey and an outlook,” IEEE Commun. Surv. Tutor., vol. 18, no. 2, pp. 1018–1044, 2016

    work page 2016

  6. [5]

    Rate control for commu- nication networks: shadow prices, proportional fairness and stability,

    F. P. Kelly, A. K. Maulloo, and D. K. H. Tan, “Rate control for commu- nication networks: shadow prices, proportional fairness and stability,” J. Oper. Res. Soc., vol. 49, no. 3, pp. 237–252, 1998

    work page 1998

  7. [6]

    Bottleneck flow control,

    J. Jaffe, “Bottleneck flow control,” IEEE Trans. on Commun. , vol. 29, no. 7, pp. 954–962, 1981

    work page 1981

  8. [7]

    Fair end-to-end window-based congestion control,

    J. Mo and J. Walrand, “Fair end-to-end window-based congestion control,” IEEE/ACM Trans. Netw., vol. 8, no. 5, pp. 556–567, 2000

    work page 2000

Show all 41 references
  1. [8]

    An axiomatic theory of fairness in network resource allocation,

    T. Lan, D. Kao, M. Chiang, and A. Sabharwal, “An axiomatic theory of fairness in network resource allocation,” in Proc. IEEE INFOCOM , 2010, pp. 1–9

    2010

  2. [9]

    Fair resource allocation in multi-task learning,

    H. Ban and K. Ji, “Fair resource allocation in multi-task learning,” arXiv preprint arXiv:2402.15638, 2024

    2024 arXiv

  3. [10]

    Generalized α-fair resource allocation in wireless networks,

    E. Altman, K. Avrachenkov, and A. Garnaev, “Generalized α-fair resource allocation in wireless networks,” in Proc. IEEE Conf. Decis. Control (CDC). IEEE, 2008, pp. 2414–2419

    2008

  4. [11]

    Alpha-fair resource allocation under incomplete information and presence of a jammer,

    ——, “Alpha-fair resource allocation under incomplete information and presence of a jammer,” in International Conference on Network Control and Optimization. Springer, 2009, pp. 219–233

    2009

  5. [12]

    A survey of pricing schemes in wireless networks,

    C. A. Gizelis and D. D. Vergados, “A survey of pricing schemes in wireless networks,” IEEE Commun. Surv. Tutor., vol. 13, no. 1, pp. 126– 145, 2010

    2010

  6. [13]

    User association for load balancing in heterogeneous cellular networks,

    Q. Ye, B. Rong, Y . Chen, M. Al-Shalash, C. Caramanis, and J. G. Andrews, “User association for load balancing in heterogeneous cellular networks,” IEEE Trans. Wireless Commun. , vol. 12, no. 6, pp. 2706– 2716, Jun. 2013

    2013

  7. [14]

    Distributed pricing-based user association for downlink heterogeneous cellular networks,

    K. Shen and W. Yu, “Distributed pricing-based user association for downlink heterogeneous cellular networks,” IEEE J. Select. Areas Com- mun., vol. 32, no. 6, pp. 1100–1113, Jun. 2014

    2014

  8. [15]

    Distributed resource allocation and user association for max-min fairness in hetnets,

    Y . Kim, J. Jang, and H. J. Yang, “Distributed resource allocation and user association for max-min fairness in hetnets,” IEEE Trans. Veh. Technol., vol. 73, no. 2, pp. 2983–2988, 2024

    2024

  9. [16]

    Joint downlink base station as- sociation and power control for max-min fairness: Computation and complexity,

    R. Sun, M. Hong, and Z.-Q. Luo, “Joint downlink base station as- sociation and power control for max-min fairness: Computation and complexity,” IEEE J. Sel. Areas Commun. , vol. 33, no. 6, pp. 1040– 1054, 2015

    2015

  10. [17]

    Distributed task offloading and resource allocation for latency minimization in mobile edge com- puting networks,

    M. Kim, J. Jang, Y . Choi, and H. J. Yang, “Distributed task offloading and resource allocation for latency minimization in mobile edge com- puting networks,” IEEE Transactions on Mobile Computing , vol. 23, no. 12, pp. 15 149–15 166, 2024

    2024

  11. [18]

    Delay minimization for rate-splitting multiple access-based multi-server mec offloading,

    M. Diamanti, C. Pelekis, E. E. Tsiropoulou, and S. Papavassiliou, “Delay minimization for rate-splitting multiple access-based multi-server mec offloading,” IEEE/ACM Trans. Netw. , vol. 32, no. 2, pp. 1035–1047, 2024

    2024

  12. [20]

    Multi-path alpha-fair resource allocation at scale in distributed software-defined networks,

    Z. Allybokus, K. Avrachenkov, J. Leguay, and L. Maggi, “Multi-path alpha-fair resource allocation at scale in distributed software-defined networks,” IEEE J. Sel. Areas Commun., vol. 36, no. 12, pp. 2655–2666, 2018

    2018

  13. [21]

    Resource allocation and power control in cooperative small cell networks with backhaul constraint,

    J. Jang, H. J. Yang, and H. Jwa, “Resource allocation and power control in cooperative small cell networks with backhaul constraint,” IEEE Trans. Veh. Technol., vol. 68, no. 11, pp. 10 926–10 942, Nov. 2019

    2019

  14. [22]

    Deep reinforcement learning-based resource allocation and power control in small cells with limited information exchange,

    J. Jang and H. J. Yang, “Deep reinforcement learning-based resource allocation and power control in small cells with limited information exchange,” IEEE Trans. Veh. Technol. , vol. 69, no. 11, pp. 13 768– 13 783, 2020

    2020

  15. [23]

    Deep learning-aided user association and power control with renewable energy sources,

    J. Jang and H. J. Yang, “Deep learning-aided user association and power control with renewable energy sources,” IEEE Trans. Commun., vol. 70, no. 4, pp. 2387–2403, 2022

    2022

  16. [24]

    Non-iterative optimization of trajectory and radio resource for aerial network,

    H. Lyu, J. Jang, H. Lee, and H. J. Yang, “Non-iterative optimization of trajectory and radio resource for aerial network,” IEEE Trans. Wireless Commun., pp. 1–1, 2024

    2024

  17. [25]

    Recurrent neural network-based user association and power control in dynamic hetnets,

    J. Jang and H. J. Yang, “Recurrent neural network-based user association and power control in dynamic hetnets,” IEEE Trans. Veh. Technol. , vol. 71, no. 9, pp. 9674–9689, 2022

    2022

  18. [26]

    Joint resource allocation and user association for heterogeneous wireless cellular networks,

    D. Fooladivanda and C. Rosenberg, “Joint resource allocation and user association for heterogeneous wireless cellular networks,” IEEE Trans. Wireless Commun., vol. 12, no. 1, pp. 248–257, Jan. 2013

    2013

  19. [27]

    Distributed load balancing via message passing for heterogeneous cellular networks,

    I. Sohn and S. H. Lee, “Distributed load balancing via message passing for heterogeneous cellular networks,” IEEE Trans. Veh. Technol., vol. 65, no. 11, pp. 9287–9298, 2016

    2016

  20. [28]

    Toward symbiotic stin through inter-operator resource and service sharing: Joint orchestration of user association and radio resources,

    S. He, J. Ge, Y .-C. Liang, and D. Niyato, “Toward symbiotic stin through inter-operator resource and service sharing: Joint orchestration of user association and radio resources,” IEEE J. Sel. Areas Commun. , vol. 42, no. 12, pp. 3674–3689, 2024

    2024

  21. [29]

    Energy efficient user association and power allocation in millimeter-wave-based ultra dense networks with energy harvesting base stations,

    H. Zhang, C. Jiang, K. Long, V . C. Leung, and H. V . Poor, “Energy efficient user association and power allocation in millimeter-wave-based ultra dense networks with energy harvesting base stations,” IEEE J. Sel. Areas Commun., vol. 35, no. 9, pp. 1936–1947, 2017

    1936

  22. [30]

    Fogprime: Dynamic pricing-based strategic resource management in fog networks,

    S. C. Misra and A. Mondal, “Fogprime: Dynamic pricing-based strategic resource management in fog networks,” IEEE Trans. Veh. Technol. , vol. 70, no. 8, pp. 8227–8236, 2021

    2021

  23. [31]

    Pricing-based deep reinforcement learning for live video streaming with joint user association and resource management in mobile edge computing,

    P.-Y . Chou, W.-Y . Chen, C.-Y . Wang, R.-H. Hwang, and W.-T. Chen, “Pricing-based deep reinforcement learning for live video streaming with joint user association and resource management in mobile edge computing,” IEEE Trans. Wireless Commun. , vol. 21, no. 6, pp. 4310– 4324, 2021

    2021

  24. [32]

    Network utility maxi- mization and pricing-based distributed algorithms for rate-reliability tradeoff,

    J.-W. Lee, M. Chiang, and R. Calderbank, “Network utility maxi- mization and pricing-based distributed algorithms for rate-reliability tradeoff,” in Proc. IEEE int. Conf. Comput. Commun. (INFOCOM) , 2006, pp. 1–13

    2006

  25. [33]

    Joint multi-task offloading and resource allocation for mobile edge computing systems in satellite iot,

    F. Chai, Q. Zhang, H. Yao, X. Xin, R. Gao, and M. Guizani, “Joint multi-task offloading and resource allocation for mobile edge computing systems in satellite iot,” IEEE Trans. Veh. Technol., vol. 72, no. 6, pp. 7783–7795, 2023

    2023

  26. [34]

    Small cell enhancements for E-UTRA and E-UTRAN - physical layer aspects,

    3GPP, “Small cell enhancements for E-UTRA and E-UTRAN - physical layer aspects,” 3rd Generation Partnership Project (3GPP), TR 36.872, Dec. 2013

    2013

  27. [35]

    Scenarios and requirements for small cell enhancements for E- UTRA and E-UTRAN,

    ——, “Scenarios and requirements for small cell enhancements for E- UTRA and E-UTRAN,” 3rd Generation Partnership Project (3GPP), TR 36.932, Jun. 2018

    2018

  28. [36]

    Backhaul- aware user association and resource allocation for energy-constrained HetNets,

    Q. Han, B. Yang, G. Miao, C. Chen, X. Wang, and X. Guan, “Backhaul- aware user association and resource allocation for energy-constrained HetNets,” IEEE Trans. Veh. Technol., vol. PP, no. 99, Mar. 2016

    2016

  29. [37]

    Downlink baseline results for small cell scenarios 1 and 2a,

    3GPP; Nokia, “Downlink baseline results for small cell scenarios 1 and 2a,” in 3GPP TSG RAN WG1 #72 meeting, R1 -131635, Apr. 2013

    2013

  30. [38]

    5G; study on channel model for frequencies from 0.5 to 100 GHz,

    3GPP, “5G; study on channel model for frequencies from 0.5 to 100 GHz,” 3rd Generation Partnership Project (3GPP), TR 38.901, Apr. 2024

    2024

  31. [39]

    Hoydis, S

    J. Hoydis, S. Cammerer, F. Ait Aoudia, M. Nimier-David, L. Maggi, G. Marcus, A. Vem, and A. Keller, “Sionna,” 2022, https://nvlabs.github.io/sionna/

    2022

  32. [40]

    New optimality conditions for quadratic optimization problems with binary constraints,

    Y . Xia, “New optimality conditions for quadratic optimization problems with binary constraints,” Optim. Lett., vol. 3, pp. 253–263, Mar. 2009

    2009

  33. [41]

    Weise, Global Optimization Algorithms–Theory and Application

    T. Weise, Global Optimization Algorithms–Theory and Application. 2nd ed. Germany: it-weise.de (self-published), 2009. [Online]. Available: http://www.it-weise.de

    2009

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.