Dynamic configuration of single frequency networks in mobile streaming systems
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
Although the capacity of cellular networks has increased with recent generations, the growth in demand of wireless bandwidth has outpaced this increase in capacity. Not only more users are relying on wireless networks, but also the demand from each user has substantially increased. For example, it has become common for mobile users to stream full TV episodes, sports events, and movies while on the go. Further, as the capabilities of mobile devices improve, the demand for higher quality and even 3D videos will escalate, which will strain cellular networks. Therefore, efficient utilization of the expensive and limited wireless spectrum remains an important problem, especially in the context of multimedia streaming services that consume a large portion of the wireless capacity. In this paper, we introduce the idea of dynamically configuring cells in wireless networks to form single frequency networks based on the multimedia traffic demands from users in each cell. We formulate the resource allocation problem in such complex networks with the goal of maximizing the number of served multimedia streams. We prove that this problem is NP-Complete, and we propose a heuristic algorithm to solve it. Through detailed packet-level simulations, we show that the proposed algorithm can achieve substantial improvements in the number of streams served as well the energy saving of mobile devices. For example, our algorithm can serve up to 40 times more users compared to the common unicast streaming approach, and it achieves at least 80% and up to 400% improvement compared to multicast approaches that do not use single frequency networks.
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