Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • 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
Neighborhood view consistency in wireless sensor networks
University of Warwick, UK.
RISE, Swedish ICT, SICS. Politecnico di Milano, Italy.ORCID iD: 0000-0003-4560-9541
2016 (English)In: ACM transactions on sensor networks, ISSN 1550-4867, E-ISSN 1550-4859, Vol. 12, no 3, article id 19Article in journal (Refereed) Published
Abstract [en]

Wireless sensor networks (WSNs) are characterized by localized interactions, that is, protocols are often based on message exchanges within a node's direct radio range. We recognize that for these protocols to work effectively, nodes must have consistent information about their shared neighborhoods. Different types of faults, however, can affect this information, severely impacting a protocol's performance. We factor this problem out of existing WSN protocols and argue that a notion of neighborhood view consistency (NVC) can be embedded within existing designs to improve their performance. To this end, we study the problem from both a theoretical and a system perspective. We prove that the problem cannot be solved in an asynchronous system using any of Chandra and Toueg's failure detectors. Because of this, we introduce a new software device called pseudocrash failure detector (PCD), study its properties, and identify necessary and sufficient conditions for solving NVC with PCDs. We prove that, in the presence of transient faults, NVC is impossible to solve with any PCDs, thus define two weaker specifications of the problem. We develop a global algorithm that satisfies both specifications in the presence of unidirectional links, and a localized algorithm that solves the weakest specification in networks of bidirectional links. We implement the latter atop two different WSN operating systems, integrate our implementations with four different WSN protocols, and run extensive micro-benchmarks and full-stack experiments on a real 90-node WSN testbed. Our results show that the performance significantly improves for NVC-equipped protocols; for example, the Collection Tree Protocol (CTP) halves energy consumption with higher data delivery.

Place, publisher, year, edition, pages
Association for Computing Machinery , 2016. Vol. 12, no 3, article id 19
Keywords [en]
Consistency, Faulttolerance, Localized interactions, Neighborhoods, Pseudocrashes, Transient faults, Views, Wireless sensor networks, Energy utilization, Fault tolerance, Sensor nodes, Specifications, Trees (mathematics), Localized interaction
National Category
Natural Sciences
Identifiers
URN: urn:nbn:se:ri:diva-41862DOI: 10.1145/2901296Scopus ID: 2-s2.0-84979935352OAI: oai:DiVA.org:ri-41862DiVA, id: diva2:1377771
Available from: 2019-12-12 Created: 2019-12-12 Last updated: 2019-12-12Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Mottola, Luca

Search in DiVA

By author/editor
Mottola, Luca
By organisation
SICS
In the same journal
ACM transactions on sensor networks
Natural Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • 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
v. 2.35.9