LEAP: efficient security mechanisms for large-scale distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Countermeasures Against Traffic Analysis Attacks in Wireless Sensor Networks
SECURECOMM '05 Proceedings of the First International Conference on Security and Privacy for Emerging Areas in Communications Networks
Attack-resistant location estimation in sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Catching "Moles" in Sensor Networks
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
Attack distribution modeling and its applications in sensor network security
EURASIP Journal on Wireless Communications and Networking
On attack-resilient wireless sensor networks with novel recovery strategies
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
CAT: building couples to early detect node compromise attack in wireless sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Personal and Ubiquitous Computing
Review: Detecting node replication attacks in wireless sensor networks: A survey
Journal of Network and Computer Applications
An efficient anonymous communication protocol for wireless sensor networks
Wireless Communications & Mobile Computing
| Hi-index | 0.00 |
Node compromise is a serious security threat that hinders the successful deployment of large-scale wireless sensor networks. A node compromise often consists of three stages: physically obtaining and compromising the sensors, redeploying the compromised sensors, and compromised nodes launching attacks after their rejoining the network. By far, all the proposed compromise detection schemes address this problem at the third stage. In this paper, we make the first attempt to detect node compromise at the second stage. Our motivation is that for some applications an attacker may not be able to precisely deploy the compromised sensors back into their original positions. Thus, the detection of location change will become an indication of a potential node compromise. We name this node redeployment detection problem. We propose two approaches to detect node redeployment, based on the change of node neighborship and the change of measured distances between nodes, respectively. Our simulation study shows that both schemes can detect node redeployment effectively (with low false positive rate and high detection rate).