MétaCan
Menu
Back to cohort
Record W2069133175 · doi:10.1109/35.925687

Spontaneous networking: an application oriented approach to ad hoc networking

2001· article· en· W2069133175 on OpenAlexfundno aff
Laura Marie Feeney, Bengt Ahlgren, Assar Westerlund

Bibliographic record

VenueIEEE Communications Magazine · 2001
Typearticle
Languageen
FieldComputer Science
TopicOpportunistic and Delay-Tolerant Networks
Canadian institutionsnot available
FundersCanadian Institute for Theoretical Astrophysics
KeywordsComputer scienceWireless ad hoc networkComputer networkLeverage (statistics)Computer securityAuthentication (law)Access controlVehicular ad hoc networkNetwork managementService (business)Delay-tolerant networkingTelecommunicationsWireless

Abstract

fetched live from OpenAlex

An ad hoc network must operate independent of a preestablished or centralized network management infrastructure, while still providing administrative services needed to support applications. Address allocation, name resolution, service location, authentication, and access control policies represent just some of the functionality that must be supported-without preconfiguration or centralized services. In order to solve these problems, it is necessary to leverage some aspect of the environment in which the network operates. We introduce the notion of a spontaneous network, created when a group of people come together for some collaborative activity. In this case, we can use the human interactions associated with the activity in order to establish a basic service and security infrastructure. We structure our discussion around a practical real-world scenario illustrating the use of such a network, identifying the key challenges involved and some of the techniques that can be used to address them.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.006
Threshold uncertainty score0.015

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.003
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0020.005
Scholarly communication0.0060.008
Open science0.0040.004
Research integrity0.0030.004
Insufficient payload (model declined to judge)0.0030.001

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.

Opus teacher head0.047
GPT teacher head0.281
Teacher spread0.234 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations153
Published2001
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Communications MagazineSame topicOpportunistic and Delay-Tolerant NetworksFrench-language works237,207