An algorithm for determining data forwarding strategy based on recommended trust value in MANET

Jianbo Xu, Shu Feng, W. Liang, Jian Ke, Xiangwei Meng, Ruili Zhang, Danping Shou
{"title":"An algorithm for determining data forwarding strategy based on recommended trust value in MANET","authors":"Jianbo Xu, Shu Feng, W. Liang, Jian Ke, Xiangwei Meng, Ruili Zhang, Danping Shou","doi":"10.1504/ijes.2020.10029260","DOIUrl":null,"url":null,"abstract":"In mobile ad hoc networks (MANET) with selfish nodes and malicious nodes, the network performance is seriously affected. We propose an algorithm based on the recommended trust value, i.e., collaborative computing trust model (CCTM) algorithm, to decide the data forwarding strategy. In the algorithm, the carrier node carrying the message collects recommended data of neighbour nodes adopts K-nearest neighbour (KNN) algorithm principle to filter the false recommended data and select K neighbour nodes as collaborative computing nodes to calculate the recommended trust value of neighbour nodes respectively, and then selects the neighbour node with the highest recommended trust value as the next hop node. The simulation experiments show that when the selfish and malicious nodes number is 10, CCTM is higher than Epidemic algorithm and MDT about 3% and 8% respectively in terms of transmission success rate; CCTM is higher than Epidemic about 14% and lower than MDT about 15% in terms of average transmission delay; CCTM is lower than MDT about 3% in terms of routing overhead. Overall, CCTM algorithm not only has better performance in terms of transmission success rate, delay and routing overhead, but also improves the security of data transmission.","PeriodicalId":412308,"journal":{"name":"Int. J. Embed. Syst.","volume":"23 23-24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Embed. Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/ijes.2020.10029260","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

In mobile ad hoc networks (MANET) with selfish nodes and malicious nodes, the network performance is seriously affected. We propose an algorithm based on the recommended trust value, i.e., collaborative computing trust model (CCTM) algorithm, to decide the data forwarding strategy. In the algorithm, the carrier node carrying the message collects recommended data of neighbour nodes adopts K-nearest neighbour (KNN) algorithm principle to filter the false recommended data and select K neighbour nodes as collaborative computing nodes to calculate the recommended trust value of neighbour nodes respectively, and then selects the neighbour node with the highest recommended trust value as the next hop node. The simulation experiments show that when the selfish and malicious nodes number is 10, CCTM is higher than Epidemic algorithm and MDT about 3% and 8% respectively in terms of transmission success rate; CCTM is higher than Epidemic about 14% and lower than MDT about 15% in terms of average transmission delay; CCTM is lower than MDT about 3% in terms of routing overhead. Overall, CCTM algorithm not only has better performance in terms of transmission success rate, delay and routing overhead, but also improves the security of data transmission.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于推荐信任值的MANET数据转发策略确定算法
在带有自私节点和恶意节点的移动自组网(MANET)中,网络性能受到严重影响。我们提出了一种基于推荐信任值的算法,即协同计算信任模型(CCTM)算法来确定数据转发策略。在该算法中,承载消息的载体节点收集邻居节点的推荐数据,采用K-最近邻(KNN)算法原理过滤虚假推荐数据,并选择K个邻居节点作为协同计算节点,分别计算邻居节点的推荐信任值,然后选择推荐信任值最高的邻居节点作为下一跳节点。仿真实验表明,当自私节点数和恶意节点数为10时,CCTM算法的传输成功率分别比Epidemic算法和MDT算法高3%和8%左右;在平均传播延迟方面,CCTM比Epidemic高约14%,比MDT低约15%;在路由开销方面,CCTM比MDT低约3%。总体而言,CCTM算法不仅在传输成功率、延迟和路由开销方面具有更好的性能,而且提高了数据传输的安全性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
NITIDS: a robust network intrusion dataset Solution to the conformable fractional differential systems with higher order Flexible heuristic-based prioritised latency-sensitive IoT application execution scheme in the 5G era Selection gate-based networks for semantic relation extraction A combination classification method based on Ripper and Adaboost
×
引用
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