使用区块链的基于声誉的MANET路由

M. Careem, A. Dutta
{"title":"使用区块链的基于声誉的MANET路由","authors":"M. Careem, A. Dutta","doi":"10.1109/COMSNETS48256.2020.9027450","DOIUrl":null,"url":null,"abstract":"One of the core issues in routing packets within Mobile Ad hoc Networks (MANETs) is the lack of trust and reputation of the participating nodes, which often leads to unreliable packet delivery. We use a fraction of nodes to validate routing actions taken by other nodes and leverage the distributed consensus mechanism in Blockchain networks to accrue the reputation of each node. Specifically, we employ heterogeneous difficulty for Proof of Work to represent the credibility of validation and design a scoring system to isolate malicious nodes via distributed consensus. The reputation of a node is then based on the combination of the difficulty level and the score. This reputation is incorporated in a novel routing metric to calculate the shortest, most reputed path between a source and destination node. The goal is to discourage malicious nodes by excluding those from participating in routing packets. A joint simulation of the Blockchain and routing algorithm reveal ≈12% improvement in overall packet delivery in the presence of routing attacks, compared to conventional routing algorithms in MANETs.","PeriodicalId":265871,"journal":{"name":"2020 International Conference on COMmunication Systems & NETworkS (COMSNETS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"Reputation based Routing in MANET using Blockchain\",\"authors\":\"M. Careem, A. Dutta\",\"doi\":\"10.1109/COMSNETS48256.2020.9027450\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One of the core issues in routing packets within Mobile Ad hoc Networks (MANETs) is the lack of trust and reputation of the participating nodes, which often leads to unreliable packet delivery. We use a fraction of nodes to validate routing actions taken by other nodes and leverage the distributed consensus mechanism in Blockchain networks to accrue the reputation of each node. Specifically, we employ heterogeneous difficulty for Proof of Work to represent the credibility of validation and design a scoring system to isolate malicious nodes via distributed consensus. The reputation of a node is then based on the combination of the difficulty level and the score. This reputation is incorporated in a novel routing metric to calculate the shortest, most reputed path between a source and destination node. The goal is to discourage malicious nodes by excluding those from participating in routing packets. A joint simulation of the Blockchain and routing algorithm reveal ≈12% improvement in overall packet delivery in the presence of routing attacks, compared to conventional routing algorithms in MANETs.\",\"PeriodicalId\":265871,\"journal\":{\"name\":\"2020 International Conference on COMmunication Systems & NETworkS (COMSNETS)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Conference on COMmunication Systems & NETworkS (COMSNETS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/COMSNETS48256.2020.9027450\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on COMmunication Systems & NETworkS (COMSNETS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS48256.2020.9027450","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

摘要

移动自组织网络(manet)中分组路由的核心问题之一是参与节点缺乏信任和信誉,这经常导致分组传输不可靠。我们使用一小部分节点来验证其他节点所采取的路由操作,并利用区块链网络中的分布式共识机制来积累每个节点的声誉。具体来说,我们采用异构难度的工作量证明来表示验证的可信度,并设计了一个评分系统,通过分布式共识来隔离恶意节点。然后,一个节点的声誉是基于难度等级和分数的组合。这种信誉被合并到一个新的路由度量中,以计算源节点和目标节点之间最短、最可靠的路径。目标是通过排除那些参与路由数据包的恶意节点来阻止它们。区块链和路由算法的联合模拟显示,与manet中的传统路由算法相比,在存在路由攻击的情况下,总体数据包传输速度提高了约12%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Reputation based Routing in MANET using Blockchain
One of the core issues in routing packets within Mobile Ad hoc Networks (MANETs) is the lack of trust and reputation of the participating nodes, which often leads to unreliable packet delivery. We use a fraction of nodes to validate routing actions taken by other nodes and leverage the distributed consensus mechanism in Blockchain networks to accrue the reputation of each node. Specifically, we employ heterogeneous difficulty for Proof of Work to represent the credibility of validation and design a scoring system to isolate malicious nodes via distributed consensus. The reputation of a node is then based on the combination of the difficulty level and the score. This reputation is incorporated in a novel routing metric to calculate the shortest, most reputed path between a source and destination node. The goal is to discourage malicious nodes by excluding those from participating in routing packets. A joint simulation of the Blockchain and routing algorithm reveal ≈12% improvement in overall packet delivery in the presence of routing attacks, compared to conventional routing algorithms in MANETs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信