Joint Optimal Channel Assignment and Congestion Control for Multi-channel Wireless Mesh 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
The aggregate capacity of wireless mesh networks can be increased by the use of multiple channels. Stationary wireless routers are equipped with multiple network interface cards (NICs). Each NIC is assigned with a distinct frequency channel. In this paper, we formulate the Joint Optimal Channel Assignment and Congestion Control (JOCAC) as a decentralized utility maximization problem with constraints that arise from the interference of the neighboring transmissions. Unlike other previous work, the JOCAC algorithm is able to assign not only the non-overlapping (orthogonal) channels, but also the partially-overlapping channels within the IEEE 802.11 frequency bands. Using 802.11b with 3 non-overlapping channels, simulation results show that our algorithm provides a higher aggregated goodput than the recently proposed load-aware algorithm by 20%. The goodput is further increased by 40% when all the 11 partially-overlapping channels are being used.
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.002 | 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