Protecting Neighbor Discovery Against Node Compromises in Sensor Networks

Authors:
Donggang Liu
Affiliations:
-
Venue:
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Year:
2009

Citing 0
Cited 5

Neighbor discovery in mobile ad hoc networks using an abstract MAC layer

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Reliable neighbor discovery for mobile ad hoc networks

Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Secure neighbor discovery and wormhole localization in mobile ad hoc networks

Ad Hoc Networks
Reliable neighbor discovery for mobile ad hoc networks

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

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

The neighborhood information has been frequently used by protocols such as routing in sensor networks. Many methods have been proposed to protect such information in hostile environments. However, these methods can only protect neighbor relations between benign nodes. A compromised node can easily circumvent them and setup false neighbor relations with sensor nodes in many places, impacting the network at a large scale. This paper presents a theoretic model for neighbor discovery in sensor networks and describes a fundamental security limitation and a generic attack against this model. The paper then proposes an efficient and localized solution based on a security property achievable during sensor deployment. This technique provides a threshold security guarantee in dealing with compromised sensor nodes. The analytical and simulation studies show that the technique is practical and effective for sensor networks.