Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
LDAC: A Localized and Decentralized Algorithm for Efficiently Countering Wormholes in Mobile Wireless Networks
KTH, School of Electrical Engineering (EES), Communication Networks. (Network Systems Security)
Computer Technology Institute, Athens, Greece & Computer Engineering Dept., Kuwait University.
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
Abstract [en]

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.
Keyword [en]
Wireless sensor networks, Neighbor discovery, Wormhole attack, Connectivity graph, Path Existence, Decentralized wormhole detection, Localized algorithm
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-137744DOI: 10.1016/j.jcss.2013.06.015ISI: 000331158700010Scopus ID: 2-s2.0-84891935443OAI: oai:DiVA.org:kth-137744DiVA: diva2:679719
Note

QC 20150629

Available from: 2013-12-16 Created: 2013-12-16 Last updated: 2017-12-06Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Giannetsos, Thanassis
By organisation
Communication Networks
In the same journal
Journal of computer and system sciences (Print)
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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