Logo: to the web site of Uppsala University

uu.sePublications from Uppsala University
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Lower trees with fixed degrees: a recipe for efficient secure hierarchical aggregation in WSNs
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems. (Communication Research)
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems. (Communication Research)
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. (Mobility)ORCID iD: 0000-0003-0174-9032
2011 (English)In: 2011 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), IEEE Computer Society, 2011, p. 659-664Conference paper, Published paper (Refereed)
Abstract [en]

We propose two strategies to reduce energy consumption for secure data aggregation in wireless sensor networks. While the purpose of data aggregation is to reduce energy consumption, secure data aggregation introduces an overhead making the total energy consumption comparable to naive secure non-aggregation. Another aspect is that the secure data aggregation has higher node congestion than non-aggregation schemes for networks of sizes up to about 100 nodes. Considering a secure data aggregation protocol, our strategies are to reduce the height of the aggregation tree and limit its node degree. The former results in fewer verification messages and a lower total communication load, and the latter reduces node congestion. The most heavily burdened node sends a third of the messages required in the original protocol, which for small networks is lower than with non-aggregation, and the total communication load is lowered compared to non-aggregation.

Place, publisher, year, edition, pages
IEEE Computer Society, 2011. p. 659-664
National Category
Computer Sciences Computer Engineering
Research subject
Computer Science with specialization in Computer Communication
Identifiers
URN: urn:nbn:se:uu:diva-140986DOI: 10.1109/WCNC.2011.5779211ISI: 000297160200112ISBN: 978-1-61284-254-7 (print)OAI: oai:DiVA.org:uu-140986DiVA, id: diva2:384698
Conference
IEEE Wireless Communications and Networking Conference, MAR 28-31 2011, Cancun Mexico
Projects
ProFunWISENETAvailable from: 2011-01-10 Created: 2011-01-10 Last updated: 2018-01-12Bibliographically approved
In thesis
1. Secure and Privacy-Aware Data Collection in Wireless Sensor Networks
Open this publication in new window or tab >>Secure and Privacy-Aware Data Collection in Wireless Sensor Networks
2012 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

A wireless sensor network is a collection of numerous sensors distributed on an area of interest to collect and process data from the environment. One particular threat in wireless sensor networks is node compromise attacks, that is, attacks where the adversary gets physical access to a node and to the programs and keying material stored on it.

Only authorized queries should be allowed in the network and the integrity and confidentiality of the data that is being collected should be protected. We propose a layered key distribution scheme together with two protocols for query authentication and confidential data aggregation. The layered key distribution is more robust to node and communication failures than a predefined tree structure. The protocols are secure under the assumption that less than n sensor nodes are compromised. n is a design parameter that allows us to trade off security for overhead. When more than n sensor nodes are compromised, our simulations show that the attacker can only introduce unauthorized queries into a limited part of the network and can only get access to a small part of the data that is aggregated in the network. Considering the data collection protocol we also contribute with strategies to reduce the energy consumption of an integrity preserving in-network aggregation scheme to a level below the energy consumption of a non-aggregation scheme. Our improvements reduce node congestion by a factor of three and the total communication load by 30%.

Location privacy of the users carrying mobile devices is another aspect considered in this thesis. Considering a mobile sink that collects data from the network, we propose a strategy for data collection that requires no information about the location and movement pattern of the sink. We show that it is possible to provide data collection services, while protecting the location privacy of the sink. When mobile phones with built-in sensors are used as sensor nodes, location information about where the data has been sensed can be used to trace users and infer other personal information about them, like state of health or personal preferences. Therefore, location privacy preserving mechanisms have been proposed to provide location privacy to the users. We investigate how a location privacy preserving mechanism influences the quality of the collected data and consider strategies to reconstruct the data distribution without compromising location privacy.

Place, publisher, year, edition, pages
Uppsala: Acta Universitatis Upsaliensis, 2012. p. 196
Series
Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology, ISSN 1651-6214 ; 968
Keywords
Secure Data Collection, Key Distribution, Location Privacy, Quality of Information, Wireless Sensor Networks
National Category
Computer Sciences Communication Systems
Research subject
Computer Science with specialization in Computer Communication
Identifiers
urn:nbn:se:uu:diva-180087 (URN)978-91-554-8463-7 (ISBN)
Public defence
2012-11-14, Polhemsalen, Ångströmlaboratoriet, Lägerhyddsvägen 1, Uppsala, 13:15 (English)
Opponent
Supervisors
Projects
WISENET
Funder
Vinnova, P26628-4
Available from: 2012-10-18 Created: 2012-08-29 Last updated: 2018-01-12Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records

Rodhe, IoanaRohner, ChristianVictor, Björn

Search in DiVA

By author/editor
Rodhe, IoanaRohner, ChristianVictor, Björn
By organisation
Computer SystemsComputing Science
Computer SciencesComputer Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 1367 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf