An Innovative Performance Assessment Method for Increasing the Efficiency of AODV Routing Protocol in VANETs Through Colored Timed Petri Nets

IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING
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,&nbsp;Mohammad Ali Jabraeil Jamali,&nbsp;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.

求助全文
约1分钟内获得全文 求助全文
来源期刊
Concurrency and Computation-Practice & Experience
Concurrency and Computation-Practice & Experience 工程技术-计算机:理论方法
CiteScore
5.00
自引率
10.00%
发文量
664
审稿时长
9.6 months
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信