基于激励和信任的自组织MANET多路径距离矢量路由最优路径识别

A. Alkhamisi, S. Buhari, Georgios Tsaramirsis, Mohammed Basheri
{"title":"基于激励和信任的自组织MANET多路径距离矢量路由最优路径识别","authors":"A. Alkhamisi, S. Buhari, Georgios Tsaramirsis, Mohammed Basheri","doi":"10.1504/ijguc.2020.10026547","DOIUrl":null,"url":null,"abstract":"A Mobile Ad hoc Network (MANET) can work well only when the mobile nodes behave cooperatively in packet routing. To reduce the hazards from malicious nodes and enhance the security of the network, this paper extends an Ad hoc On-Demand Multipath Distance Vector (AOMDV) routing protocol, named as an Integrated Incentive and Trust-based optimal path identification in AOMDV (IIT-AOMDV) for MANET. The proposed IIT-AOMDV routing protocol integrates an Intrusion Detection System (IDS) with the Bayesian Network (BN) based trust and payment model. The IDS utilises the empirical first-and second-hand trust information of BN, and it underpins the cuckoo search algorithm to map the QoS and trust value into a single fitness metric, tuned according to the presence of malicious nodes. The simulation results show that the IIT-AOMDV improves the detection accuracy and throughput by 20% and 16.6%, respectively, more than that of existing AOMDV integrated with the IDS (AID).","PeriodicalId":375871,"journal":{"name":"Int. J. Grid Util. Comput.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"An integrated incentive and trust-based optimal path identification in ad hoc on-demand multipath distance vector routing for MANET\",\"authors\":\"A. Alkhamisi, S. Buhari, Georgios Tsaramirsis, Mohammed Basheri\",\"doi\":\"10.1504/ijguc.2020.10026547\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A Mobile Ad hoc Network (MANET) can work well only when the mobile nodes behave cooperatively in packet routing. To reduce the hazards from malicious nodes and enhance the security of the network, this paper extends an Ad hoc On-Demand Multipath Distance Vector (AOMDV) routing protocol, named as an Integrated Incentive and Trust-based optimal path identification in AOMDV (IIT-AOMDV) for MANET. The proposed IIT-AOMDV routing protocol integrates an Intrusion Detection System (IDS) with the Bayesian Network (BN) based trust and payment model. The IDS utilises the empirical first-and second-hand trust information of BN, and it underpins the cuckoo search algorithm to map the QoS and trust value into a single fitness metric, tuned according to the presence of malicious nodes. The simulation results show that the IIT-AOMDV improves the detection accuracy and throughput by 20% and 16.6%, respectively, more than that of existing AOMDV integrated with the IDS (AID).\",\"PeriodicalId\":375871,\"journal\":{\"name\":\"Int. J. Grid Util. Comput.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-02-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Grid Util. Comput.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/ijguc.2020.10026547\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Grid Util. Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/ijguc.2020.10026547","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

一个移动自组网(MANET)只有在各移动节点在分组路由中表现出良好的协作才能正常工作。为了减少恶意节点的危害,增强网络的安全性,本文扩展了一种自组织的按需多路径距离矢量(AOMDV)路由协议,并将其命名为基于综合激励和信任的AOMDV最优路径识别(IIT-AOMDV)。提出的IIT-AOMDV路由协议将入侵检测系统(IDS)与基于贝叶斯网络(BN)的信任和支付模型集成在一起。IDS利用BN的经验第一手和二手信任信息,并支持布谷鸟搜索算法,将QoS和信任值映射到单个适应度度量,并根据恶意节点的存在进行调整。仿真结果表明,与集成IDS (AID)的现有AOMDV相比,IIT-AOMDV的检测精度和吞吐量分别提高了20%和16.6%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An integrated incentive and trust-based optimal path identification in ad hoc on-demand multipath distance vector routing for MANET
A Mobile Ad hoc Network (MANET) can work well only when the mobile nodes behave cooperatively in packet routing. To reduce the hazards from malicious nodes and enhance the security of the network, this paper extends an Ad hoc On-Demand Multipath Distance Vector (AOMDV) routing protocol, named as an Integrated Incentive and Trust-based optimal path identification in AOMDV (IIT-AOMDV) for MANET. The proposed IIT-AOMDV routing protocol integrates an Intrusion Detection System (IDS) with the Bayesian Network (BN) based trust and payment model. The IDS utilises the empirical first-and second-hand trust information of BN, and it underpins the cuckoo search algorithm to map the QoS and trust value into a single fitness metric, tuned according to the presence of malicious nodes. The simulation results show that the IIT-AOMDV improves the detection accuracy and throughput by 20% and 16.6%, respectively, more than that of existing AOMDV integrated with the IDS (AID).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Resource consumption trade-off for reducing hotspot migration in modern data centres Method for determining cloth simulation filtering threshold value based on curvature value of fitting curve An agent-based mechanism to form cloud federations and manage their requirements changes K-means clustering algorithm for data distribution in cloud computing environment FastGarble: an optimised garbled circuit construction framework
×
引用
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