Downlink Resource Allocation for Autonomous Infrastructure-based Multihop Cellular Networks
Bibliographic record
Abstract
Considering a multihop cellular system with one relay per sector, an effective modeling for the joint base-station/relay assignment, rate allocation, and routing scheme is proposed and formulated under a single problem for the downlink. This problem is then formulated as a multidimensional multichoice knapsack problem (MMKP) to maximize the total achieved throughput in the network. The well-known MMKP algorithm based on Lagrange multipliers is modified, which results in a near-optimal solution with a linear complexity. The notion of the infeasibility factor is also introduced to adjust the transmit power of base stations and relays adaptively. To reduce the complexity, and in order to analyze the underlying key factors in the system, the framework is restricted to a two-base-station two-relay system. In fact, the output of the proposed algorithm is the joint optimization of the routing path, and base-station selection to achieve the maximum total throughput in the system, which in conjunction with the proposed adaptive scheme leads to the implementation of the cell breathing via allocating the proper transmit power to the base-stations and relays.
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 distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".