LDAC: A localized and decentralized algorithm for efficiently countering wormholes in mobile wireless networks

  • Authors:
  • Thanassis Giannetsos;Tassos Dimitriou

  • Affiliations:
  • KTH Royal Institute of Technology, Laboratory of Communication Networks, Osquldas v. 10, 100 44 Stockholm, Sweden;Computer Technology Institute, Athens, Greece and Computer Engineering Dept., Kuwait University, PO Box 5969, Safat 13060, Kuwait

  • Venue:
  • Journal of Computer and System Sciences
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.