MétaCan
Menu
Back to cohort
Record W2019996569 · doi:10.1109/ccece.2012.6335039

A secure mechanism for QoS routing in wireless sensor networks

2012· article· en· W2019996569 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicSecurity in Wireless Sensor Networks
Canadian institutionsConcordia University
Fundersnot available
KeywordsComputer networkComputer scienceWireless sensor networkKey distribution in wireless sensor networksEncryptionQuality of serviceNetwork packetDistributed computingGeographic routingRouting protocolWireless networkWirelessWireless Routing ProtocolTelecommunications

Abstract

fetched live from OpenAlex

With the increased application of wireless sensor networks (WSNs) to military and civilian environments, securing the data in the network has become a critical issue. The severe resource constraints of sensor nodes and the broadcast nature of the wireless links as well as the challenging deployment environments of wireless sensor networks pose challenges for the quality and security of data transmission for these networks. In order to ensure data security and quality of service required by an application in an energy efficient way, we propose a mechanism for QoS routing with coding and selective encryption scheme for WSNs. Our approach provides reliable and secure data transmission and can adapt to the resource constraints of WSNs. The original message is split into packets that are coded and selectively encrypted before being transmitted along different disjoint paths.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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.993
Threshold uncertainty score0.988

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.000
Research integrity0.0000.000
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.017
GPT teacher head0.246
Teacher spread0.229 · 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

Quick stats

Citations5
Published2012
Admission routes1
Has abstractyes

Explore more

Same topicSecurity in Wireless Sensor NetworksFrench-language works237,207