A low-cost secure neighbor verification protocol for wireless sensor networks
2008 (English)Report (Other academic)
Wireless networking relies on a fundamental building block,neighbor discovery(ND). However, the nature of wirelesscommunications makes attacks against ND easy: an adver-sary can simply replay or relay (wormhole) packets acrossthe network and misleaddisconnectednodes they commu-nicate directly. Such attacks can compromise the overly-ing protocols and applications. Proposals in the literatureseek tosecureND, allowing nodes toverifythey are neigh-bors. However, they either rely on specialized hardware orinfrastructure, or oer limited security, often only againstan attack mounted by at most two adversarial nodes (a2-end wormhole). In this paper, we address these prob-lems, designing a secureneighbor vericationprotocol forlow-costandconstrainedWireless Sensor networks (WSN).Our scheme relies on nodes' distance estimation and simplegeometric tests, and it is fullydistributed. We prove ourprotocol secure against the classical 2-end wormhole attack,and we show it makes it hard to mount ak-end wormholeattack (k >2): For non-negligible yet limited chance of suc-cess, the adversary must know the locations of all victimnodes and deploy a relay (wormhole) node close toeachvic-tim. We provided a proof-of-concept implementation witho-the-shelfWSN equipment, Cricket Motes. The protocolis the rst applicable method that achieves a high level ofsecurity for WSN against sophisticated wormhole attacks.
Place, publisher, year, edition, pages
2008. , 12 p.
, LCA-REPORT, 2008-020
Engineering and Technology
IdentifiersURN: urn:nbn:se:kth:diva-116117OAI: oai:DiVA.org:kth-116117DiVA: diva2:590154
QC 201306192013-01-212013-01-152013-06-19Bibliographically approved