MétaCan
Menu
Back to cohort
Record W2084192698 · doi:10.1109/icc.2012.6363763

Secure and efficient source location privacy-preserving scheme for wireless sensor networks

2012· article· en· W2084192698 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 scienceComputer networkNetwork packetWireless sensor networkCloud computingNode (physics)CryptographyScheme (mathematics)Sink (geography)AdversaryComputer security

Abstract

fetched live from OpenAlex

In this paper, we propose a novel scheme for efficiently and securely preserving source nodes' location privacy. Our scheme uses efficient cryptographic operations to change the packets' appearance at each hop to prevent packet correlation. It also creates a cloud with irregular shape of fake traffic to enable the real source node to send its data anonymously to a fake source node to send to the sink and to camouflage the real source node in the nodes creating the cloud. To reduce the energy cost, clouds are active only during data transmission and the intersection of clouds creates a larger merged cloud to reduce the number of fake packets and boost privacy preservation. Simulation and analytical results demonstrate that our scheme can provide stronger privacy preservation than routing-based schemes and requires much less energy cost than global-adversary-based schemes.

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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.663
Threshold uncertainty score0.891

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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.001
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.015
GPT teacher head0.241
Teacher spread0.226 · 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

Citations17
Published2012
Admission routes1
Has abstractyes

Explore more

Same topicSecurity in Wireless Sensor NetworksFrench-language works237,207