• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

DMCA

in Wireless Ad Hoc Networks

Cached

  • Download as a PDF

Download Links

  • [www.ee.washington.edu]
  • [www2.engr.arizona.edu]
  • [www2.engr.arizona.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Radha Poovendran , Loukas Lazos
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Poovendran_inwireless,
    author = {Radha Poovendran and Loukas Lazos},
    title = {in Wireless Ad Hoc Networks},
    year = {}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Wireless ad hoc networks are envisioned to be randomly deployed in versatile and potentially hostile environments. Hence, providing secure and uninterrupted communication between the un-tethered network nodes becomes a critical problem. In this paper, we investigate the wormhole attack in wireless ad hoc networks, an attack that can disrupt vital network functions such as routing. In the wormhole attack, the adversary establishes a low-latency unidirectional or bi-directional link, such as a wired or long-range wireless link, between two points in the network that are not within communication range of each other. The attacker then records one or more messages at one end of the link, tunnels them via the link to the other end, and replays them into the network in a timely manner. The wormhole attack is easily implemented and particularly challenging to detect, since it does not require breach of the authenticity and confidentiality of communication, or the compromise of any host. We present a graph theoretic framework for modeling wormhole links and derive the necessary and sufficient conditions for detecting and defending against wormhole attacks. Based on our framework, we show that any candidate solution preventing wormholes should construct a communication graph that is a subgraph of the geometric graph defined by the radio range of the network nodes. Making use of our framework, we propose a cryptographic mechanism based on local broadcast keys in order to prevent wormholes. Our solution does not need time synchronization or time measurement, requires only a small fraction of the nodes to know their location, and is decentralized. Hence, it is suitable for networks with the most stringent constraints such as sensor networks. Finally, we believe our work is the first to provide an analytical evaluation in terms of probabilities of the extent to which a method prevents wormholes.

Keyphrases

wireless ad hoc network    wormhole attack    communication range    adversary establishes    critical problem    bi-directional link    small fraction    uninterrupted communication    analytical evaluation    local broadcast key    communication graph    un-tethered network node    candidate solution    sufficient condition    wormhole link    stringent constraint    geometric graph    long-range wireless link    time measurement    timely manner    cryptographic mechanism    network node    vital network function    hostile environment    graph theoretic framework    time synchronization    radio range    sensor network   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University