MétaCan
Menu
Back to cohort

HTM: Hierarchical Trust Management for Software-Defined WSNs

2019· article· en· W3011459442 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 institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer scienceDenial-of-service attackNetwork packetComputer networkNode (physics)Trust management (information system)Computer securityReputationPacket forwardingWireless sensor networkScheme (mathematics)The InternetOperating systemEngineering

Abstract

fetched live from OpenAlex

Software-Defined WSNs (SDWSNs) have attracted considerable attention as they can provide more flexible network management compared with traditional WSNs. However, they also bring a new security issue, i.e., a sensor node can be easily compromised and behave maliciously to perform arbitrary action, e.g., dropping received messages, that degrades the availability of SDWSNs without being detected. To address the security issue, we propose a Hierarchical Trust Management scheme, named HTM. In HTM, a reputation-based mechanism is designed and utilized for detecting sensor nodes' malicious behavior, such as black-hole attack (dropping all received packets), selective forwarding attack (dropping partially received packets and forwarding the rest), and Denial-of-Service (DoS) attack (sending abundant but useless packets continuously). At each level of the hierarchical system, the trustworthy of each node is evaluated and the malicious behavior is detected. Through extensive simulation, we demonstrate that the HTM scheme is capable to detect malicious nodes that perform the aforementioned attacks.

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 categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.837
Threshold uncertainty score0.685

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.011
GPT teacher head0.231
Teacher spread0.221 · 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
Published2019
Admission routes1
Has abstractyes

Explore more

Same topicSecurity in Wireless Sensor NetworksFrench-language works237,207