Arash Heidari, Mohammad Ali Jabraeil Jamali, Nima Jafari Navimipour
{"title":"An Innovative Performance Assessment Method for Increasing the Efficiency of AODV Routing Protocol in VANETs Through Colored Timed Petri Nets","authors":"Arash Heidari, Mohammad Ali Jabraeil Jamali, Nima Jafari Navimipour","doi":"10.1002/cpe.8349","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Routing protocols are pivotal in Vehicular Ad hoc Networks (VANETs), serving as the backbone for efficient routing discovery, particularly within the realm of Intelligent Transportation Systems (ITS). However, ensuring their seamless functionality within VANET environments necessitates rigorous verification and formal modeling. Colored Timed Petri Nets (CTPNs) stand out as a valuable mathematical and formal method for this purpose. This study shows a new way to describe the Ad hoc On-Demand Distance Vector (AODV) routing system in VANETs using CTPNs. There are nine pages of detailed analysis using this new modeling method, which allows you to examine success across many levels of a hierarchy. This study provides a strong foundation for building and testing the AODV routing system in VANETs, showing how well it functions in real-life situations. It is interesting to see how the results of the CTPN–based model and simulations compare. Notably, the model finds routes in an average of 32 s, while tests show that it takes 56 s. Additionally, the model's overall number of sent and received packets closely matches the results from the exercise. Furthermore, the suggested plan shows a yield of 41%. Strict T-tests indicate that the modeling results are highly reliable.</p>\n </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 3","pages":""},"PeriodicalIF":1.5000,"publicationDate":"2025-01-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Concurrency and Computation-Practice & Experience","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/cpe.8349","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0
Abstract
Routing protocols are pivotal in Vehicular Ad hoc Networks (VANETs), serving as the backbone for efficient routing discovery, particularly within the realm of Intelligent Transportation Systems (ITS). However, ensuring their seamless functionality within VANET environments necessitates rigorous verification and formal modeling. Colored Timed Petri Nets (CTPNs) stand out as a valuable mathematical and formal method for this purpose. This study shows a new way to describe the Ad hoc On-Demand Distance Vector (AODV) routing system in VANETs using CTPNs. There are nine pages of detailed analysis using this new modeling method, which allows you to examine success across many levels of a hierarchy. This study provides a strong foundation for building and testing the AODV routing system in VANETs, showing how well it functions in real-life situations. It is interesting to see how the results of the CTPN–based model and simulations compare. Notably, the model finds routes in an average of 32 s, while tests show that it takes 56 s. Additionally, the model's overall number of sent and received packets closely matches the results from the exercise. Furthermore, the suggested plan shows a yield of 41%. Strict T-tests indicate that the modeling results are highly reliable.
期刊介绍:
Concurrency and Computation: Practice and Experience (CCPE) publishes high-quality, original research papers, and authoritative research review papers, in the overlapping fields of:
Parallel and distributed computing;
High-performance computing;
Computational and data science;
Artificial intelligence and machine learning;
Big data applications, algorithms, and systems;
Network science;
Ontologies and semantics;
Security and privacy;
Cloud/edge/fog computing;
Green computing; and
Quantum computing.