An Algorithm for Incremental Joint Routing and Scheduling in Wireless Mesh Networks
Bibliographic record
Abstract
In this paper we explore a fundamental joint routing and scheduling problem in wireless mesh networks (WMNs) that employ time division multiple access (TDMA). The problem, referred to as the minimum cost single flow routing and scheduling (MC-SFRS) problem, deals with incremental update of transmission schedules necessitated by dynamic arrival of new flows and termination of existing flows during the operation of the network. In the problem, we are given a multi-hop WMN, a set of ongoing flows, a transmission schedule for the ongoing flows, a set of costs associated with links, and a new flow demand. All flows contend for using one of the available wireless channels. The problem asks for finding a non-bifurcated route with minimum cost along which the new flow can be scheduled without perturbing slot assignments in the given schedule, if such route exists. Our main contribution is an efficient algorithm for solving the MC-SFRS problem for arbitrary interference relations among pairs of transmission links in networks with arbitrary topologies. Among other classes of routes, our algorithm is exact over the class of shortest routes. The obtained simulation results demonstrate the effectiveness of our proposed algorithm over the competing method of exact scheduling for a fixed routing tree. In addition, the results show improvement obtained by using our algorithm to augment the schedules obtained by fixed tree routing.
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.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| 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 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".