MétaCan
Menu
Back to cohort
Record W2140327713 · doi:10.1145/1815396.1815666

Securing RDS broadcast messages for smart grid applications

2010· article· en· W2140327713 on OpenAlexaff
Monageng Kgwadi, Thomas Kunz

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicRFID technology advancements
Canadian institutionsCarleton University
Fundersnot available
KeywordsElliptic Curve Digital Signature AlgorithmComputer scienceDigital signatureComputer networkAuthentication (law)CryptographyOverhead (engineering)Bandwidth (computing)WirelessMessage authentication codeElliptic curve cryptographyPublic-key cryptographyComputer securityTelecommunicationsHash functionEncryption

Abstract

fetched live from OpenAlex

Efforts to reduce peak electrical demand has led to the introduction of demand response (DR) programs for residences. The RDS network is a strong candidate for delivering DR messages due to its low-cost nature and ubiquitous coverage. However, security concerns arise due to the wireless nature of the communication channel. We present evaluations of cryptographic methods that could be employed to offer source authentication over the RDS network. Simulations are used to determine the impact on the network performance by employing three digital signature protocols (BiBa, HORSE, and ECDSA). The simulation results show that, up to a distance of 90 km, all authentication schemes do not affect message reception by the receivers. ECDSA and HORSE outperform BiBa in terms of message reception beyond 90 km. ECDSA offers higher security than HORSE and BiBa but at the cost of increased computational complexity, in particular at the receivers. In addition, ECDSA has the highest bandwidth overhead.

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.001
metaresearch head score (Gemma)0.004
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: Empirical
Teacher disagreement score0.003
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

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

Citations14
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicRFID technology advancementsFrench-language works237,207