Energy and Traffic Aware Full-Duplex Communications for 5G Systems
Bibliographic record
Abstract
In this paper, we consider the problem of resource allocation in a dense small-cell network. Each small-cell base station is powered by a renewable energy source and operates in the full-duplex mode. We account for the rate-dependent energy term for data decoding into the total energy consumption at the small-cell base station. Owing to this new energy term, the transmitter and receiver operations now draw the energy from a common source. For a new energy consumption model and high interference scenario, which arises due to full-duplex communications, we formulate an energy and load aware resource management optimization problem under the energy causality and total transmit power constraints of the small-cell base station and uplink user equipments. In particular, the problem minimizes the data queue length of each network user equipment by jointly designing the beamformers, power, and sub-carrier allocation and their scheduling. Owing to the non-convexity of the problem, a global solution is inefficient; thus, we opt for the successive parametric convex approximation method to obtain a sub-optimal solution. This method solves for the convex approximate of the non-convex problem in each iteration and leads to faster convergence. For practical implementation, we further develop a distributed algorithm by using the dual decomposition framework, which relies on limited exchange of information between the involved base stations. Numerical simulations compare the network scenario which accounts for uplink channel rate-dependent energy consumption with that which ignores it. Results advocate the need for redesigning of the resource allocation scheme. In addition, numerical simulations also validate the usefulness of full-duplex communications over the half-duplex communications in terms of minimizing the sum data queue length of the users.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".