DSVL: Detecting Selfish Node in Vehicular Ad-hoc Networks (VANET) by Learning Automata

IF 0.6 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Ad Hoc & Sensor Wireless Networks Pub Date : 2021-08-02 DOI:10.32908/ahswn.v53.7989
Ainaz Nobahari, S. J. Mirabedini
{"title":"DSVL: Detecting Selfish Node in Vehicular Ad-hoc Networks (VANET) by Learning Automata","authors":"Ainaz Nobahari, S. J. Mirabedini","doi":"10.32908/ahswn.v53.7989","DOIUrl":null,"url":null,"abstract":"Vehicular Ad-hoc Networks (VANETs) are a set of mobile nodes that move on the road and connect via wireless. Due to the limited radio range, they send data to each other by collaborating. Some nodes drop the other nodes’ packets to save the network supplements; therefore, the network’s performance will reduce. So it is necessary to identify selfish nodes to prevent other nodes from cooperating with them. In the proposed scheme, a punishmentbased algorithm is presented to identify the selfish nodes used in Adaptive Resonance Theory (ART) clustering to monitor and control them. The cluster head determines if selfish behaviors occur in the cluster or not. If the cluster head discovers that there is a selfish behavior in the cluster, it begins to check the packets that were sent and received by all nodes. In the proposed method, each node in the network is equipped with learning automata, the probability of selecting each neighbor node to send the packet, which is rewarded or punished according to the performance. Simulation results have shown that the rate of detection of selfish nodes is more than other methods, and the false alarm rate (FAR) is less than other similar methods.","PeriodicalId":55557,"journal":{"name":"Ad Hoc & Sensor Wireless Networks","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2021-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ad Hoc & Sensor Wireless Networks","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.32908/ahswn.v53.7989","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 1

Abstract

Vehicular Ad-hoc Networks (VANETs) are a set of mobile nodes that move on the road and connect via wireless. Due to the limited radio range, they send data to each other by collaborating. Some nodes drop the other nodes’ packets to save the network supplements; therefore, the network’s performance will reduce. So it is necessary to identify selfish nodes to prevent other nodes from cooperating with them. In the proposed scheme, a punishmentbased algorithm is presented to identify the selfish nodes used in Adaptive Resonance Theory (ART) clustering to monitor and control them. The cluster head determines if selfish behaviors occur in the cluster or not. If the cluster head discovers that there is a selfish behavior in the cluster, it begins to check the packets that were sent and received by all nodes. In the proposed method, each node in the network is equipped with learning automata, the probability of selecting each neighbor node to send the packet, which is rewarded or punished according to the performance. Simulation results have shown that the rate of detection of selfish nodes is more than other methods, and the false alarm rate (FAR) is less than other similar methods.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于学习自动机的车辆自组织网络(VANET)自利节点检测
车辆自组织网络(vanet)是一组在道路上移动并通过无线连接的移动节点。由于无线电范围有限,它们通过协作相互发送数据。一些节点丢弃其他节点的数据包以节省网络补充;因此,网络的性能会降低。因此,有必要识别出自私节点,以防止其他节点与其合作。在该方案中,提出了一种基于惩罚的算法来识别自适应共振理论(ART)聚类中的自私节点,并对其进行监视和控制。簇头决定簇中是否存在自私行为。如果集群头发现集群中存在自私行为,则开始检查所有节点发送和接收的数据包。在提出的方法中,网络中的每个节点都配备了学习自动机,选择每个邻居节点发送数据包的概率,根据性能对其进行奖励或惩罚。仿真结果表明,自利节点的检出率高于其他方法,虚警率(FAR)低于其他类似方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Ad Hoc & Sensor Wireless Networks
Ad Hoc & Sensor Wireless Networks 工程技术-电信学
CiteScore
2.00
自引率
44.40%
发文量
0
审稿时长
8 months
期刊介绍: Ad Hoc & Sensor Wireless Networks seeks to provide an opportunity for researchers from computer science, engineering and mathematical backgrounds to disseminate and exchange knowledge in the rapidly emerging field of ad hoc and sensor wireless networks. It will comprehensively cover physical, data-link, network and transport layers, as well as application, security, simulation and power management issues in sensor, local area, satellite, vehicular, personal, and mobile ad hoc networks.
期刊最新文献
Enumeration of the Number of Spanning Trees of the Globe Network and its Subdivision A HYBRID OPTIMIZATION ALGORITHMS FOR SOLVING METRIC DIMENSION PROBLEM Detecting Malicious Use of DoH Tunnels Using Statistical Traffic Analysis RPL+: An Improved Parent Selection Strategy for RPL in Wireless Smart Grid Networks Prototype of deployment of Federated Learning with IoT devices
×
引用
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