A Framework for Probabilistic, Authentic Aggregation in Wireless Sensor Networks
Identifieur interne : 000C01 ( Istex/Checkpoint ); précédent : 000C00; suivant : 000C02A Framework for Probabilistic, Authentic Aggregation in Wireless Sensor Networks
Auteurs : J. Wilke ; E.-O. Bla ; F. C. Freiling ; M. ZitterbartSource :
- PIK - Praxis der Informationsverarbeitung und Kommunikation [ 0930-5157 ] ; 2009-06.
Abstract
Wireless sensor networks suffer from limited resources, in particular finite energy supply. A common way to save energy is reducing radio transmissions by using in-network data aggregation, which is very sensitive to non-cooperative nodes, e.g., nodes that have been compromised by an attacker. Usually, security to such attacks can only be achieved by spending considerably more energy. In this paper, we present the ESAWN framework, a highly customizable protocol for secure in-network data aggregation. The main contribution of ESAWN is providing gracefully degrading security guarantees, in particular dataauthenticity. Instead of providing ‘full’ authenticity, we only assure an aggregate to be authentic with a given probability. This is done by propagating aggregates on redundant paths, allowing other nodes to check correctness. Hence, a user can trade-off security against energy in a very fine-grained manner. We present both analytical and MICA2-based simulation results, showing the practicality of our approach. For example, with 10% compromised nodes, ESAWN saves, up to 70% energy while degrading authenticity by 5%.
Url:
DOI: 10.1515/piko.2009.0021
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
ISTEX:7BE086ECFC41DDCB511CEBA6266E56C0F652094FLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A Framework for Probabilistic, Authentic Aggregation in Wireless Sensor Networks</title><author><name sortKey="Wilke, J" sort="Wilke, J" uniqKey="Wilke J" first="J." last="Wilke">J. Wilke</name></author><author><name sortKey="Bla, E O" sort="Bla, E O" uniqKey="Bla E" first="E.-O." last="Bla">E.-O. Bla</name></author><author><name sortKey="Freiling, F C" sort="Freiling, F C" uniqKey="Freiling F" first="F. C." last="Freiling">F. C. Freiling</name></author><author><name sortKey="Zitterbart, M" sort="Zitterbart, M" uniqKey="Zitterbart M" first="M." last="Zitterbart">M. Zitterbart</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:7BE086ECFC41DDCB511CEBA6266E56C0F652094F</idno><date when="2009" year="2009">2009</date><idno type="doi">10.1515/piko.2009.0021</idno><idno type="url">https://api.istex.fr/document/7BE086ECFC41DDCB511CEBA6266E56C0F652094F/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000062</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000062</idno><idno type="wicri:Area/Istex/Curation">000062</idno><idno type="wicri:Area/Istex/Checkpoint">000C01</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000C01</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A Framework for Probabilistic, Authentic Aggregation in Wireless Sensor Networks</title><author><name sortKey="Wilke, J" sort="Wilke, J" uniqKey="Wilke J" first="J." last="Wilke">J. Wilke</name></author><author><name sortKey="Bla, E O" sort="Bla, E O" uniqKey="Bla E" first="E.-O." last="Bla">E.-O. Bla</name></author><author><name sortKey="Freiling, F C" sort="Freiling, F C" uniqKey="Freiling F" first="F. C." last="Freiling">F. C. Freiling</name></author><author><name sortKey="Zitterbart, M" sort="Zitterbart, M" uniqKey="Zitterbart M" first="M." last="Zitterbart">M. Zitterbart</name></author></analytic><monogr></monogr><series><title level="j">PIK - Praxis der Informationsverarbeitung und Kommunikation</title><title level="j" type="abbrev">PIK - Praxis der Informationsverarbeitung und Kommunikation</title><idno type="ISSN">0930-5157</idno><idno type="eISSN">1865-8342</idno><imprint><publisher>Walter de Gruyter GmbH & Co. KG</publisher><date type="published" when="2009-06">2009-06</date><biblScope unit="volume">32</biblScope><biblScope unit="issue">2</biblScope><biblScope unit="page" from="116">116</biblScope><biblScope unit="page" to="126">126</biblScope></imprint><idno type="ISSN">0930-5157</idno></series><idno type="istex">7BE086ECFC41DDCB511CEBA6266E56C0F652094F</idno><idno type="DOI">10.1515/piko.2009.0021</idno><idno type="ArticleID">PIKO.32.2.116</idno><idno type="Related-article-Href">piko.2009.0021.pdf</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0930-5157</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Wireless sensor networks suffer from limited resources, in particular finite energy supply. A common way to save energy is reducing radio transmissions by using in-network data aggregation, which is very sensitive to non-cooperative nodes, e.g., nodes that have been compromised by an attacker. Usually, security to such attacks can only be achieved by spending considerably more energy. In this paper, we present the ESAWN framework, a highly customizable protocol for secure in-network data aggregation. The main contribution of ESAWN is providing gracefully degrading security guarantees, in particular dataauthenticity. Instead of providing ‘full’ authenticity, we only assure an aggregate to be authentic with a given probability. This is done by propagating aggregates on redundant paths, allowing other nodes to check correctness. Hence, a user can trade-off security against energy in a very fine-grained manner. We present both analytical and MICA2-based simulation results, showing the practicality of our approach. For example, with 10% compromised nodes, ESAWN saves, up to 70% energy while degrading authenticity by 5%.</div></front></TEI><affiliations><list></list><tree><noCountry><name sortKey="Bla, E O" sort="Bla, E O" uniqKey="Bla E" first="E.-O." last="Bla">E.-O. Bla</name><name sortKey="Freiling, F C" sort="Freiling, F C" uniqKey="Freiling F" first="F. C." last="Freiling">F. C. Freiling</name><name sortKey="Wilke, J" sort="Wilke, J" uniqKey="Wilke J" first="J." last="Wilke">J. Wilke</name><name sortKey="Zitterbart, M" sort="Zitterbart, M" uniqKey="Zitterbart M" first="M." last="Zitterbart">M. Zitterbart</name></noCountry></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/TelematiV1/Data/Istex/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000C01 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd -nk 000C01 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= TelematiV1
|flux= Istex
|étape= Checkpoint
|type= RBID
|clé= ISTEX:7BE086ECFC41DDCB511CEBA6266E56C0F652094F
|texte= A Framework for Probabilistic, Authentic Aggregation in Wireless Sensor Networks
}}
| This area was generated with Dilib version V0.6.31. |  |