Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Looking up data in P2P systems
Communications of the ACM
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
LEAP: efficient security mechanisms for large-scale distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Key Infection: Smart Trust for Smart Dust
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Distributed Detection of Node Replication Attacks in Sensor Networks
SP '05 Proceedings of the 2005 IEEE Symposium on Security and Privacy
Secure Localization and Time Synchronization for Wireless Sensor and Ad Hoc Networks (Advances in Information Security)
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
An overview of the OMNeT++ simulation environment
Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops
On the Detection of Clones in Sensor Networks Using Random Key Predistribution
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
IEEE Communications Magazine
Location-based compromise-tolerant security mechanisms for wireless sensor networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Wireless sensor networks are vulnerable to the node clone, and several distributed protocols have been proposed to detect this attack. However, they require too strong assumptions to be practical for large-scale, randomly deployed sensor networks. In this paper, we propose two novel node clone detection protocols with different tradeoffs on network conditions and performance. The first one is based on a distributed hash table (DHT), by which a fully decentralized, key-based caching and checking system is constructed to catch cloned nodes effectively. The protocol performance on efficient storage consumption and high security level is theoretically deducted through a probability model, and the resulting equations, with necessary adjustments for real application, are supported by the simulations. Although the DHT-based protocol incurs similar communication cost as previous approaches, it may be considered a little high for some scenarios. To address this concern, our second distributed detection protocol, named randomly directed exploration, presents good communication performance for dense sensor networks, by a probabilistic directed forwarding technique along with random initial direction and border determination. The simulation results uphold the protocol design and show its efficiency on communication overhead and satisfactory detection probability.