移动ad-hoc网络中安全路由发现的信任建模

G. Wadhwani, S. Khatri, S. K. Muttoo
{"title":"移动ad-hoc网络中安全路由发现的信任建模","authors":"G. Wadhwani, S. Khatri, S. K. Muttoo","doi":"10.1109/ICRITO.2017.8342457","DOIUrl":null,"url":null,"abstract":"Mobile ad-hoc network can be established without any predefined infrastructure and nodes in it communicate with each other in an arbitrary way. All the nodes are expected to have routing capabilities to facilitate communication in the network. The arbitrary movement of nodes and presence of compromised nodes renders the requirement of a route discovery method which can suggest a trustworthy route. In this paper a route discovery technique is suggested based on trust and hop count to find the most trustworthy and optimal path between a pair of communicating nodes. In the proposed method trust is calculated on the basis of direct observation and recommendations from other trustworthy nodes. The impact of recommendations on aggregated trust depends upon the number of interactions between recommender and recommended node. The nodes which are forwarding more number of packets with lesser delay are said to be trustworthy.","PeriodicalId":357118,"journal":{"name":"2017 6th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Trust modeling for secure route discovery in mobile ad-hoc networks\",\"authors\":\"G. Wadhwani, S. Khatri, S. K. Muttoo\",\"doi\":\"10.1109/ICRITO.2017.8342457\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Mobile ad-hoc network can be established without any predefined infrastructure and nodes in it communicate with each other in an arbitrary way. All the nodes are expected to have routing capabilities to facilitate communication in the network. The arbitrary movement of nodes and presence of compromised nodes renders the requirement of a route discovery method which can suggest a trustworthy route. In this paper a route discovery technique is suggested based on trust and hop count to find the most trustworthy and optimal path between a pair of communicating nodes. In the proposed method trust is calculated on the basis of direct observation and recommendations from other trustworthy nodes. The impact of recommendations on aggregated trust depends upon the number of interactions between recommender and recommended node. The nodes which are forwarding more number of packets with lesser delay are said to be trustworthy.\",\"PeriodicalId\":357118,\"journal\":{\"name\":\"2017 6th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 6th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICRITO.2017.8342457\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 6th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRITO.2017.8342457","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

移动自组织网络可以在没有任何预定义的基础设施的情况下建立,其中的节点可以任意地相互通信。期望所有节点都具有路由功能,以促进网络中的通信。节点的任意移动和被破坏节点的存在使得需要一种能够建议可信路由的路由发现方法。本文提出了一种基于信任和跳数的路由发现技术,以寻找一对通信节点之间最可信和最优的路径。在提出的方法中,信任是基于直接观察和其他可信节点的建议来计算的。推荐对聚合信任的影响取决于推荐人与被推荐节点之间的交互次数。以较小的延迟转发较多数据包的节点被认为是可信的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Trust modeling for secure route discovery in mobile ad-hoc networks
Mobile ad-hoc network can be established without any predefined infrastructure and nodes in it communicate with each other in an arbitrary way. All the nodes are expected to have routing capabilities to facilitate communication in the network. The arbitrary movement of nodes and presence of compromised nodes renders the requirement of a route discovery method which can suggest a trustworthy route. In this paper a route discovery technique is suggested based on trust and hop count to find the most trustworthy and optimal path between a pair of communicating nodes. In the proposed method trust is calculated on the basis of direct observation and recommendations from other trustworthy nodes. The impact of recommendations on aggregated trust depends upon the number of interactions between recommender and recommended node. The nodes which are forwarding more number of packets with lesser delay are said to be trustworthy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信