Min-Max Congestion in Interference-Prone Wireless Mesh Networks
Bibliographic record
Abstract
Users' demand of seamless connectivity has pushed for the development of alternatives to traditional infrastructure networks. Potential solutions should be low-cost, easily deployable and adaptive to the environment. One approach that has gained tremendous attention over the past few years consists in deploying a backbone of access points wirelessly interconnected, offering users access to the wired infrastructure via multi-hop communication. However, the limited transfer capacities and the interference resulting from a shared transmission medium can prevent further deployment if the network performance does not meet users' expectations. In this work, we explore different ways to improve the nominal network capacity while accounting for the phenomena of intra-interference (interference on a single path) and inter-interference (interference among flows on different paths). In particular, under the assumptions of splitable traffic flows, we present an interference-aware linear- programming formulation of the min-max congestion problem with and without constraints on the path length. Finally, we evaluate via simulations the potential bandwidth capacity gain resulting from the implementation of these different approaches.
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.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 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 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".