Joint routing, scheduling and power allocation in OFDMA wireless ad hoc networks
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.
Bibliographic record
Abstract
In this paper an OFDMA-based wireless ad hoc network is considered. In addition to the potential of being a source and/or a destination, each node is assumed to be capable of decoding and forwarding its received packets to other nodes in the network. The goal is to determine the optimal data routes, subchannel schedules, and power allocations that maximize a weighted sum rate of the data communicated over the network. Two instances of this problem are considered. In the first instance, each subchannel is exclusively used on one of the links, whereas in the second instance subchannels are allowed to be time shared by multiple links. The first problem gives rise to an NP-hard mixed integer optimization problem that is difficult to solve. In contrast, using a change of variables, the second problem is cast in a convex form, which is amenable to highly efficient interior point solvers. Simulation results suggest that the gain in the weighted sum rate achieved by the relaxation in the second problem over that achieved by the original mixed integer problem is negligible for small networks, and increases with the size of the network.
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 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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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 it