LDAC: A Localized and Decentralized Algorithm for Efficiently Countering Wormholes in Mobile Wireless Networks
2013 (English)In: Journal of computer and system sciences (Print), ISSN 0022-0000, E-ISSN 1090-2724, Vol. 80, no 3, 618-643 p.Article in journal (Refereed) Published
Several protocols have been proposed to date to defend against wormhole attacks in wireless networks by adopting synchronized clocks, positioning devices, or directional antennas. These requirements and assumptions limit their applicability especially in the case of mobile networks where the degree of association and de-association between the nodes is relatively high. In this work, we present a novel lightweight countermeasure for the wormhole attack, called LDAC (Localized-Decentralized Algorithm for Countering wormholes). It is completely localized and works by looking for simple evidence that no attack is taking place, using only connectivity information, as implied by the underlying communication graph. LDAC is not confined to static networks but extends naturally to dynamic and even mobile ones. Rigorous arguments that prove the correctness of the algorithm are coupled with detailed performance evaluation along with an implementation on real sensor devices that demonstrates its efficiency in terms of memory requirements and processing overhead.
Place, publisher, year, edition, pages
2013. Vol. 80, no 3, 618-643 p.
Wireless sensor networks, Neighbor discovery, Wormhole attack, Connectivity graph, Path Existence, Decentralized wormhole detection, Localized algorithm
IdentifiersURN: urn:nbn:se:kth:diva-137744DOI: 10.1016/j.jcss.2013.06.015ISI: 000331158700010ScopusID: 2-s2.0-84891935443OAI: oai:DiVA.org:kth-137744DiVA: diva2:679719
QC 201506292013-12-162013-12-162015-06-29Bibliographically approved