Trust modeling for secure route discovery in mobile ad-hoc networks

G. Wadhwani, S. Khatri, S. K. Muttoo
{"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}
引用次数: 1

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
移动ad-hoc网络中安全路由发现的信任建模
移动自组织网络可以在没有任何预定义的基础设施的情况下建立,其中的节点可以任意地相互通信。期望所有节点都具有路由功能,以促进网络中的通信。节点的任意移动和被破坏节点的存在使得需要一种能够建议可信路由的路由发现方法。本文提出了一种基于信任和跳数的路由发现技术,以寻找一对通信节点之间最可信和最优的路径。在提出的方法中,信任是基于直接观察和其他可信节点的建议来计算的。推荐对聚合信任的影响取决于推荐人与被推荐节点之间的交互次数。以较小的延迟转发较多数据包的节点被认为是可信的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fractal antenna for wireless applications Analysis of various techniques of feature extraction on skin lesion images Modeling and simulation of CEERI's water distribution network to detect leakage using HLR approach Design and analysis of symmetrical notch S shape patch antenna for wideband applications Experiences in the business process modelling at public organizations of La Pampa
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1