Evidence map›Paper›PMID 30795612›Full record

ArticleSensors (Basel, Switzerland)2019

Evaluating Dynamic Approaches to Key (Re-)Establishment in Wireless Sensor Networks.

Lukas Nemec, Vashek Matyas, Radim Ostadal, Petr Svenda, Pierre-Louis Palant

Abstract read
In one paragraph

Article in Sensors (Basel, Switzerland), 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Lukas NemecCentre for Research on Cryptography and Security, Faculty of Informatics, Masaryk University, Brno 60200, Czech Republic. lukas.nemec@mail.muni.cz.ORCID 0000-0003-0981-5700
Vashek MatyasCentre for Research on Cryptography and Security, Faculty of Informatics, Masaryk University, Brno 60200, Czech Republic. matyas@fi.muni.cz.
Radim OstadalCentre for Research on Cryptography and Security, Faculty of Informatics, Masaryk University, Brno 60200, Czech Republic. ostadal@mail.muni.cz.
Petr SvendaCentre for Research on Cryptography and Security, Faculty of Informatics, Masaryk University, Brno 60200, Czech Republic. svenda@fi.muni.cz.ORCID 0000-0002-9784-7624
Pierre-Louis PalantInstitut National des Sciences Appliquées Centre Val de Loire, 18000 Bourges, France. pierre-louis.palant@insa-cvl.fr.

Funding

Grantová Agentura České Republiky GBP202/12/G061
6 · The paper itself

Abstract

Wireless sensor networks with a large number of cheap low-power interconnected devices bring up challenging tasks when considering the security of their communications. In our previous work, we presented two approaches for the design of dynamic protocols for link key (re-)establishment in ad hoc networks, using two elements studied earlier-secrecy amplification and key extraction from radio channel fading. The goal of this article is to provide a unified approach to the design of these protocols, together with their experimental verification, in a real network with various settings. The overall results of our experiments show that our dynamic combination of secrecy amplification and key extraction from radio channel fading saves a significant portion of messages with corresponding energy expenditure and can adapt to a much wider scale of environments when compared to previous solutions based on the exploitation of the individual elements of secrecy amplification and key extraction from radio channel fading.

Indexed as

adaptiveautonomouscryptographydistributedprotocolsecuritywireless radio communication

Identifiers

PMID30795612
PMCPMC6412454

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.