A graph theoretic framework for preventing the wormhole attack in wireless ad hoc networks

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