{"title":"基于学习自动机的车辆自组织网络(VANET)自利节点检测","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":"{\"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}","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}
DSVL: Detecting Selfish Node in Vehicular Ad-hoc Networks (VANET) by Learning Automata
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.
期刊介绍:
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.