Deterministic secure positioning in wireless sensor networks

DOI10.1016/J.TCS.2011.04.010MaRDI QIDQ638507zbMATH OpenOpenAlexFDO

Authors S. Delaët, P. S. Mandal, Mariusz A. Rokicki, Sébastien Tixeuil

Publication date 12 September 2011

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0710.3824

zbMATH Keywords

wireless sensor networkdistributed protocolsecure positioning

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Distributed systems (68M14) Network protocols (68M12)

Abstract: Properly locating sensor nodes is an important building block for a large subset of wireless sensor networks (WSN) applications. As a result, the performance of the WSN degrades significantly when misbehaving nodes report false location and distance information in order to fake their actual location. In this paper we propose a general distributed deterministic protocol for accurate identification of faking sensors in a WSN. Our scheme does emph{not} rely on a subset of emph{trusted} nodes that are not allowed to misbehave and are known to every node in the network. Thus, any subset of nodes is allowed to try faking its position. As in previous approaches, our protocol is based on distance evaluation techniques developed for WSN. On the positive side, we show that when the received signal strength (RSS) technique is used, our protocol handles at most $lfloorfracn2floor-2$ faking sensors. Also, when the time of flight (ToF) technique is used, our protocol manages at most $lfloorfracn2floor-3$ misbehaving sensors. On the negative side, we prove that no deterministic protocol can identify faking sensors if their number is $lceilfracn2ceil-1$. Thus our scheme is almost optimal with respect to the number of faking sensors. We discuss application of our technique in the trusted sensor model. More precisely our results can be used to minimize the number of trusted sensors that are needed to defeat faking ones.

Recommendations

• On the interaction between localization and location verification for wireless sensor networks
• A localization game in wireless sensor networks
• Principles of Distributed Systems
• Location verification and trust management for resilient geographic routing
• A statistical approach towards secure location verification in noisy wireless channels

Cites work

• scientific article; zbMATH DE number 1373656 (Why is no real title available?)
• scientific article; zbMATH DE number 1931811 (Why is no real title available?)
• scientific article; zbMATH DE number 1394315 (Why is no real title available?)
• An analysis of variance test for normality (complete samples)
• Discovering Network Topology in the Presence of Byzantine Faults
• The Byzantine Generals Problem

Cited in

(6)

• A statistical approach towards secure location verification in noisy wireless channels
• Principles of Distributed Systems
• RKP based secure tracking in wireless sensor networks
• A localization game in wireless sensor networks
• On the Usability of Secure Association of Wireless Devices Based on Distance Bounding
• On the interaction between localization and location verification for wireless sensor networks

This page was built for publication: Deterministic secure positioning in wireless sensor networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q638507)