一种预防传感器网络中节点泄露的主动安全路由算法

Xiangqian Chen, K. Makki, K. Yen, N. Pissinou, Zhihua Liu
{"title":"一种预防传感器网络中节点泄露的主动安全路由算法","authors":"Xiangqian Chen, K. Makki, K. Yen, N. Pissinou, Zhihua Liu","doi":"10.1109/LCN.2008.4664235","DOIUrl":null,"url":null,"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.","PeriodicalId":218005,"journal":{"name":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A proactive secure routing algorithm defense against node compromise in sensor networks\",\"authors\":\"Xiangqian Chen, K. Makki, K. Yen, N. Pissinou, Zhihua Liu\",\"doi\":\"10.1109/LCN.2008.4664235\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":218005,\"journal\":{\"name\":\"2008 33rd IEEE Conference on Local Computer Networks (LCN)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 33rd IEEE Conference on Local Computer Networks (LCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.2008.4664235\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 33rd IEEE Conference on Local Computer Networks (LCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2008.4664235","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

在传感器网络中,提供一种安全的路由算法来防止节点泄露是一项具有挑战性的任务。在本文中,我们提出了一种主动安全路由算法(PSR)来征服未被检测到的妥协节点-系统尚未检测到的妥协节点。与其他安全路由算法或思想相比,PSR中的路由路径不仅可以绕过检测到的被入侵节点,还可以绕过被入侵概率较大的节点。为了估计节点妥协的概率,我们引入了节点妥协分布模型。仿真结果表明,无论路由路径是否被检测到,PSR都能有效地防止路由路径通过被破坏的节点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A proactive secure routing algorithm defense against node compromise in sensor networks
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信