Loading...
Please wait, while we are loading the content...
Similar Documents
Secure hop-count based localization in wireless sensor networks.
| Content Provider | CiteSeerX |
|---|---|
| Author | Zeng, Yingpei Zhang, Shigeng |
| Abstract | Many sensor network applications rely on sensors ’ location information. However, most of existing location algorithms assume a non-adversarial environment or assume beacons lying within 1-hop. In this paper, we focus on Hop-Count based localization (multihop) and develop a Secure HOp-Count based LOCalization scheme, called SHOLOC, to make localization attack-resistant. In SHOLOC, we assume both ordinary nodes and beacon nodes can be moving, and the whole network periodically restarts localization. SHOLOC proposes a protocol to authenticate beacon information and protect hop-count from being arbitrary changed. SHOLOC employs beacon nodes to detect wormhole attacks. Theoretical analysis and simulation results are presented. Our conclusion also includes two interest findings: 1)hop-count increment attacks are not effective to Hop-Count based algorithms, 2)filter mechanisms such as least median squares (LMS) are not resistant to wormhole attacks, and our method of detecting at beacon nodes side works well. 1. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Ordinary Node Non-adversarial Environment Hop-count Increment Attack Wormhole Attack Theoretical Analysis Median Square Beacon Node Side Many Sensor Network Application Wireless Sensor Network Whole Network Filter Mechanism Secure Hop-count Simulation Result Interest Finding Sensor Location Information Beacon Node Beacon Information Localization Scheme Location Algorithm |
| Content Type | Text |
