MétaCan
Menu
Back to cohort
Record W2052838984 · doi:10.5555/1554126.1554162

EAP-Sens: a security architecture for wireless sensor networks

2008· article· en· W2052838984 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueInternational Wireless Internet Conference · 2008
Typearticle
Languageen
FieldComputer Science
TopicSecurity in Wireless Sensor Networks
Canadian institutionsUniversité de Montréal
Fundersnot available
KeywordsComputer networkComputer scienceAuthentication (law)Wireless sensor networkKey (lock)Authentication protocolProtocol (science)WirelessRelayComputer securityTelecommunications

Abstract

fetched live from OpenAlex

We present the design, implementation and simulation of a security protocol based on Extensible Authentication Protocol nick-named EAP-Sens for wireless sensor networks. We use the generalized pre-shared key authentication method for authentication and key establishment. Standard EAP model is used for authenticating sensor nodes within the radio range of the authenticator. For distant nodes, we use Relay Authenticators to tunnel EAP messages to the authenticator. We have defined EAP message encapsulations for IEEE 802.15.4 standard and a key hierarchy for EAP-Sens. To analyze EAP-Sens performance on larger configurations a simulation model has been developed. We have implemented an EAP-Sens prototype for Tmote sensors and showed that EAP based security protocol is feasible in wireless sensor networks.

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 imitation

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

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
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.950
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0040.001
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.025
GPT teacher head0.255
Teacher spread0.231 · 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