A new approach to service discovery in wireless mobile ad hoc 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
Service discovery is essential for many wireless applications, yet it is more difficult to achieve in Mobile Ad Hoc Networks (MANETS) than in both wired and traditional wireless networks due to the lack of central control. In addition, the heterogeneity, mobility and limited energy of the mobile devices precludes the use of traditional service discovery protocols. This paper presents HESED, a fundamentally different service discovery protocol based on multicast query and multicast reply. Clients multicast service queries and matching servers multicast their response to all nodes. The service information is cached by all and may be used in place of future queries. HESED also eliminates the effect of asymmetric links, providing reliability for its forwarding algorithms. The packet complexity of HESED is shown to be O(N) for N-node MANETs, as opposed to O(N) for traditional service discovery schemes. Simulation results show that HESED significantly outperforms a Traditional On-demand Service Discovery (TOSD) algorithm.
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.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.001 |
| Open science | 0.003 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| 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