为AODV-UU添加声誉扩展

Laurent Guillaume, Julien van de Sype, L. Schumacher, Giovanni Di Stasi, R. Canonico
{"title":"为AODV-UU添加声誉扩展","authors":"Laurent Guillaume, Julien van de Sype, L. Schumacher, Giovanni Di Stasi, R. Canonico","doi":"10.1109/SCVT.2010.5720459","DOIUrl":null,"url":null,"abstract":"To tackle an inherent security weakness of wireless environments, we propose the implementation of a reputation procedure onto the routing protocol Ad-hoc On Demand Vector routing (AODV). This procedure relies on the overal cooperation of nodes taking part to the Wireless Mesh Network. Each node associates a reputation value to its neighbours, which reflects the trust it puts in them. Based on that reputation value, the hop count is increased or decreased, depending whether the intermediate node is trusted or not. This mechanism enables to select the most trustworthy paths in the mesh. We present preliminary experimental results obtained with our implementation.","PeriodicalId":344975,"journal":{"name":"2010 17th IEEE Symposium on Communications and Vehicular Technology in the Benelux (SCVT2010)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Adding reputation extensions to AODV-UU\",\"authors\":\"Laurent Guillaume, Julien van de Sype, L. Schumacher, Giovanni Di Stasi, R. Canonico\",\"doi\":\"10.1109/SCVT.2010.5720459\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To tackle an inherent security weakness of wireless environments, we propose the implementation of a reputation procedure onto the routing protocol Ad-hoc On Demand Vector routing (AODV). This procedure relies on the overal cooperation of nodes taking part to the Wireless Mesh Network. Each node associates a reputation value to its neighbours, which reflects the trust it puts in them. Based on that reputation value, the hop count is increased or decreased, depending whether the intermediate node is trusted or not. This mechanism enables to select the most trustworthy paths in the mesh. We present preliminary experimental results obtained with our implementation.\",\"PeriodicalId\":344975,\"journal\":{\"name\":\"2010 17th IEEE Symposium on Communications and Vehicular Technology in the Benelux (SCVT2010)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 17th IEEE Symposium on Communications and Vehicular Technology in the Benelux (SCVT2010)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SCVT.2010.5720459\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 17th IEEE Symposium on Communications and Vehicular Technology in the Benelux (SCVT2010)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCVT.2010.5720459","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

为了解决无线环境固有的安全弱点,我们提出在路由协议Ad-hoc随需应变向量路由(AODV)上实现信誉程序。该过程依赖于参与无线Mesh网络的节点的整体合作。每个节点与其邻居关联一个声誉值,这反映了它对邻居的信任。根据信誉值,跳数增加或减少,这取决于中间节点是否可信。这种机制可以在网格中选择最可信的路径。给出了初步的实验结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Adding reputation extensions to AODV-UU
To tackle an inherent security weakness of wireless environments, we propose the implementation of a reputation procedure onto the routing protocol Ad-hoc On Demand Vector routing (AODV). This procedure relies on the overal cooperation of nodes taking part to the Wireless Mesh Network. Each node associates a reputation value to its neighbours, which reflects the trust it puts in them. Based on that reputation value, the hop count is increased or decreased, depending whether the intermediate node is trusted or not. This mechanism enables to select the most trustworthy paths in the mesh. We present preliminary experimental results obtained with our implementation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信