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}
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.