MétaCan
Menu
Back to cohort
Record W2981080014 · doi:10.1109/tmc.2019.2948014

Optimal ADMM-Based Spectrum and Power Allocation for Heterogeneous Small-Cell Networks with Hybrid Energy Supplies

2019· article· en· W2981080014 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIEEE Transactions on Mobile Computing · 2019
Typearticle
Languageen
FieldEngineering
TopicAdvanced MIMO Systems Optimization
Canadian institutionsUniversity of Waterloo
FundersNational Mobile Communications Research Laboratory, Southeast UniversityNatural Sciences and Engineering Research Council of CanadaNational Natural Science Foundation of ChinaNational Science Foundation
KeywordsMathematical optimizationComputer scienceMaximizationUtility maximization problemConvexityOptimization problemGridConvex optimizationMinificationEnergy consumptionLagrangian relaxationRegular polygonMathematicsUtility maximization

Abstract

fetched live from OpenAlex

Powering cellular networks with hybrid energy supplies is not only environment-friendly but can also reduce the on-grid energy consumption, thus being emerging as a promising solution for green networking. Intelligent management of spectrum and power can increase the network utility in cellular networks with hybrid energy supplies, usually at the cost of higher energy consumption. Unlike prior studies on either the network utility maximization or on-grid energy cost minimization, this paper studies the joint spectrum and power allocation problem that maximizes the system revenue in a heterogeneous small-cell network with hybrid energy supplies. Specifically, the system revenue is considered as the difference between the network utility and on-grid energy cost. By developing the convexity of the optimization problem through transformation and reparameterization, we propose a joint spectrum and power allocation algorithm based on the primal-dual arguments to obtain the optimal solution by iteratively solving the primal and dual sub-problems of the convex optimization problem. To solve the primal sub-problem, we further propose the Lagrangian maximization based on the alternating direction method of multipliers (ADMM), and derive the optimal solution in the closed-form expression at each iteration. It is shown that the proposed joint spectrum and power allocation algorithm approaches the global optimality at the rate of 1=n with n being the number of iterations. Also, the proposed ADMM-based Lagrangian maximization algorithm approaches the primal optimal solution with the time complexity of O(1=ε <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r</sub> ) iterations with ε <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">r</sub> being the termination parameter. Simulation results show that in comparison with the power control with equal frequency allocation algorithm and frequency allocation with equal power allocation algorithms the proposed algorithm increases the system revenue by over 20 and 60 percent without consuming more on-grid energy when the proportional fairness utility and the weighted sum rate utility are considered with the approximate system parameter settings, respectively. Meanwhile, in comparison with the full frequency reuse case, the proposed algorithm increases the system revenue by 20 percent at least in terms of the weighted sum rate utility, although it achieves the similar system revenue when considering the proportional fairness utility. Simulation results also show that our proposed algorithm can perform well under the realistic fast fading channel conditions.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.813
Threshold uncertainty score0.975

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.004
GPT teacher head0.182
Teacher spread0.178 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it