GMR: Geographic Multicast Routing for Wireless Sensor 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
We present geographic multicast routing (GMR), a new multicast routing protocol for wireless sensor networks. GMR manages to preserve the good properties of previous geographic unicast routing schemes while being able to efficiently deliver multicast data messages to multiple destinations. It is a fully-localized algorithm (only needs information provided by neighbors) and it does not require any type of flooding throughout the network. Each node propagating a multicast data message needs to select a subset of its neighbors as relay nodes towards destinations. GMR optimizes cost over progress ratio. The cost is equal to the number of selected neighbors, while progress is the overall reduction of the remaining distances to destinations. That is, the difference between distance from current node to destinations and distance from selected nodes to destinations. Such neighbor selection achieves a good trade-off between the cost of the multicast tree and the effectiveness of the data distribution. Our cost-aware neighbor selection is based on a greedy set merging scheme achieving a O(Dn min(D, n) <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">3</sup> ) computation time, where n is the number of neighbors of current node and D is the number of destinations. This is superior to the exponential computational complexity of an existing solution (PBM) which tests all possible subsets of neighbours, and to an alternative solution that we considered, tests all the set partitions of destinations. Delivery to all destinations is guaranteed by applying face routing when no neighbor provides advance toward certain destinations. Our simulation results show that GMR outperforms previous multicast routing schemes in terms of cost of the trees and computation time over a variety of networking scenarios. In addition, GMR does not depend on the use of any parameter, while the closest competing protocol has one parameter and remains inferior for all values of that parameter
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.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 it