DocumentCode
3253947
Title
A proactive secure routing algorithm defense against node compromise in sensor networks
Author
Chen, Xiangqian ; Makki, Kia ; Yen, Kang ; Pissinou, Niki ; Liu, Zhihua
Author_Institution
Telecommun. & Inf. Technol. Inst., Florida Int. Univ., Miami, FL
fYear
2008
fDate
14-17 Oct. 2008
Firstpage
557
Lastpage
559
Abstract
Providing a secure routing algorithm that defend against node compromise is a challenging task in sensor networks. In this paper, we propose a proactive secure routing algorithm (PSR) to conquer the undetected compromised nodes-the compromised nodes that the system has not detected them yet. Compared with other secure routing algorithms or ideas, routing paths in PSR not only bypass the detected compromised nodes but also bypass the nodes with larger probabilities of being compromised. To estimate the probability of node compromise, we introduce a node compromise distribution model. Simulations show that PSR is effective to prevent routing path from passing compromised nodes whether detected or not.
Keywords
probability; telecommunication network routing; wireless sensor networks; node compromise distribution model; proactive secure routing algorithm; probability estimation; undetected compromised nodes; undetected compromised nodes-the compromised nodes; wireless sensor networks; Authentication; Communication system security; Data security; Event detection; Information technology; Military computing; Proposals; Routing protocols; Transportation; Wireless sensor networks; Sensor networks; attack; node compromise; secure routing; security; undetected compromised node;
fLanguage
English
Publisher
ieee
Conference_Titel
Local Computer Networks, 2008. LCN 2008. 33rd IEEE Conference on
Conference_Location
Montreal, Que
Print_ISBN
978-1-4244-2412-2
Electronic_ISBN
978-1-4244-2413-9
Type
conf
DOI
10.1109/LCN.2008.4664235
Filename
4664235
Link To Document