TY - GEN
T1 - Sensor node compromise detection
T2 - IWCMC 2007: 2007 International Wireless Communications and Mobile Computing Conference
AU - Song, Hui
AU - Xie, Liang
AU - Zhu, Sencun
AU - Cao, Guohong
PY - 2007
Y1 - 2007
N2 - 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).
AB - 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).
UR - http://www.scopus.com/inward/record.url?scp=36849024896&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=36849024896&partnerID=8YFLogxK
U2 - 10.1145/1280940.1280993
DO - 10.1145/1280940.1280993
M3 - Conference contribution
AN - SCOPUS:36849024896
SN - 1595936955
SN - 9781595936950
T3 - IWCMC 2007: Proceedings of the 2007 International Wireless Communications and Mobile Computing Conference
SP - 242
EP - 247
BT - IWCMC 2007
Y2 - 12 August 2007 through 16 August 2007
ER -