Name
Abstract | ||
|---|---|---|
In wireless sensor networks, sensors should have some mechanisms to learn their locations since sensed data without associated location information may be meaningless. While many sensor localization algorithms have been proposed, security issues in sensor localization are usually not addressed in their original design. Secure sensor localization is very challenging due to limited computation and energy resources in sensors. It is highly desirable that a localization scheme is robust and is able to detect malicious attacks without using complex cryptographic operations. In this paper, we present and analyze detection methods purely based on geometric constraints in sensor networks. Our detection methods can strengthen the localization algorithm to be resilient to malicious attacks by detecting and eliminating the negative impact of fake information. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1145/1577222.1577241 | QSHINE |
Keywords | Field | DocType |
associated location information,sensor network,localization algorithm,sensor localization algorithm,localization scheme,wireless sensor network,secure sensor localization,range-free localization,detection method,sensor localization,reliability,wireless sensor networks,malicious attack | Key distribution in wireless sensor networks,Soft sensor,Computer science,Cryptography,Visual sensor network,Brooks–Iyengar algorithm,Robustness (computer science),Mobile wireless sensor network,Wireless sensor network,Distributed computing | Conference |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kui Wu | 1 | 1024 | 82.25 |
| Dandan Huang | 2 | 4 | 0.96 |
| Jianping Pan | 3 | 1760 | 150.21 |
| Chong Liu | 4 | 468 | 21.25 |