在 VANET 中使用混合模糊灰狼优化法优化选择具有最大链路可靠性的中继总线的新型模型

IF 2.1 4区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS
F. Sangeetha Francelin Vinnarasi, S. P. Karuppiah, J. T. Anita Rose, C. A. Subasini
{"title":"在 VANET 中使用混合模糊灰狼优化法优化选择具有最大链路可靠性的中继总线的新型模型","authors":"F. Sangeetha Francelin Vinnarasi, S. P. Karuppiah, J. T. Anita Rose, C. A. Subasini","doi":"10.1007/s11276-024-03752-y","DOIUrl":null,"url":null,"abstract":"<p>Nowadays, the routing problem has received major concern in Vehicular Ad-hoc Networks (VANETs) because of the utilization of resource-constrained devices in wireless networking environments. The traditional store-carry-forward approach produced highly reliable packet delivery performance using buses on ordinary routes. However, its performance is induced when dealing with inconsistent and dynamic routes. In addition, there is large bandwidth consumption if the forwarded packets are transmitted through improper relay nodes. Therefore, this paper proposes a novel street-centric routing algorithm with the consideration of optimal multiple routes and optimal relay node selection procedures. Initially, the street maps with ten streets and four bus routes are taken as input data. These bus trajectory data are transformed into routing graphs to determine the probability of buses moving through the streets. Subsequently, the optimal multiple shortest routes for forwarding packets to the destination are selected with the consideration of metrics such as Probability of Path Consistency (PPC) and Probability of Street Consistency (PSC). Finally, the optimal relay bus is chosen by employing the proposed Hybrid Fuzzy Niching Grey Wolf (HFNGW) algorithm. The experimental result inherits that the HFNGW algorithm achieves a greater packet delivery ratio of about 98.9% with less relay bus selection time of 32 ms than other compared methods.</p>","PeriodicalId":23750,"journal":{"name":"Wireless Networks","volume":"41 1","pages":""},"PeriodicalIF":2.1000,"publicationDate":"2024-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A novel model for optimal selection of relay bus with maximum link reliability in VANET using hybrid fuzzy niching grey wolf optimization\",\"authors\":\"F. Sangeetha Francelin Vinnarasi, S. P. Karuppiah, J. T. Anita Rose, C. A. Subasini\",\"doi\":\"10.1007/s11276-024-03752-y\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Nowadays, the routing problem has received major concern in Vehicular Ad-hoc Networks (VANETs) because of the utilization of resource-constrained devices in wireless networking environments. The traditional store-carry-forward approach produced highly reliable packet delivery performance using buses on ordinary routes. However, its performance is induced when dealing with inconsistent and dynamic routes. In addition, there is large bandwidth consumption if the forwarded packets are transmitted through improper relay nodes. Therefore, this paper proposes a novel street-centric routing algorithm with the consideration of optimal multiple routes and optimal relay node selection procedures. Initially, the street maps with ten streets and four bus routes are taken as input data. These bus trajectory data are transformed into routing graphs to determine the probability of buses moving through the streets. Subsequently, the optimal multiple shortest routes for forwarding packets to the destination are selected with the consideration of metrics such as Probability of Path Consistency (PPC) and Probability of Street Consistency (PSC). Finally, the optimal relay bus is chosen by employing the proposed Hybrid Fuzzy Niching Grey Wolf (HFNGW) algorithm. The experimental result inherits that the HFNGW algorithm achieves a greater packet delivery ratio of about 98.9% with less relay bus selection time of 32 ms than other compared methods.</p>\",\"PeriodicalId\":23750,\"journal\":{\"name\":\"Wireless Networks\",\"volume\":\"41 1\",\"pages\":\"\"},\"PeriodicalIF\":2.1000,\"publicationDate\":\"2024-05-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Wireless Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s11276-024-03752-y\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Wireless Networks","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s11276-024-03752-y","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

如今,由于在无线网络环境中使用资源受限的设备,路由问题已成为车载 Ad-hoc 网络(VANET)的主要关注点。传统的 "存储-携带-前向 "方法在普通路由上使用总线可产生高度可靠的数据包传送性能。但是,在处理不一致的动态路由时,其性能会受到影响。此外,如果转发的数据包通过不适当的中继节点传输,会消耗大量带宽。因此,本文提出了一种新颖的以街道为中心的路由算法,该算法考虑了最优多路由和最优中继节点选择程序。首先,将包含十条街道和四条公交线路的街道地图作为输入数据。这些公交车轨迹数据被转换成路由图,以确定公交车通过街道的概率。随后,根据路径一致性概率(PPC)和街道一致性概率(PSC)等指标,选择将数据包转发到目的地的最优多条最短路线。最后,采用所提出的混合模糊灰狼算法(HFNGW)选择最佳中继总线。实验结果表明,与其他方法相比,HFNGW 算法的数据包传送率高达 98.9%,而中继总线选择时间仅为 32 ms。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

A novel model for optimal selection of relay bus with maximum link reliability in VANET using hybrid fuzzy niching grey wolf optimization

A novel model for optimal selection of relay bus with maximum link reliability in VANET using hybrid fuzzy niching grey wolf optimization

Nowadays, the routing problem has received major concern in Vehicular Ad-hoc Networks (VANETs) because of the utilization of resource-constrained devices in wireless networking environments. The traditional store-carry-forward approach produced highly reliable packet delivery performance using buses on ordinary routes. However, its performance is induced when dealing with inconsistent and dynamic routes. In addition, there is large bandwidth consumption if the forwarded packets are transmitted through improper relay nodes. Therefore, this paper proposes a novel street-centric routing algorithm with the consideration of optimal multiple routes and optimal relay node selection procedures. Initially, the street maps with ten streets and four bus routes are taken as input data. These bus trajectory data are transformed into routing graphs to determine the probability of buses moving through the streets. Subsequently, the optimal multiple shortest routes for forwarding packets to the destination are selected with the consideration of metrics such as Probability of Path Consistency (PPC) and Probability of Street Consistency (PSC). Finally, the optimal relay bus is chosen by employing the proposed Hybrid Fuzzy Niching Grey Wolf (HFNGW) algorithm. The experimental result inherits that the HFNGW algorithm achieves a greater packet delivery ratio of about 98.9% with less relay bus selection time of 32 ms than other compared methods.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Wireless Networks
Wireless Networks 工程技术-电信学
CiteScore
7.70
自引率
3.30%
发文量
314
审稿时长
5.5 months
期刊介绍: The wireless communication revolution is bringing fundamental changes to data networking, telecommunication, and is making integrated networks a reality. By freeing the user from the cord, personal communications networks, wireless LAN''s, mobile radio networks and cellular systems, harbor the promise of fully distributed mobile computing and communications, any time, anywhere. Focusing on the networking and user aspects of the field, Wireless Networks provides a global forum for archival value contributions documenting these fast growing areas of interest. The journal publishes refereed articles dealing with research, experience and management issues of wireless networks. Its aim is to allow the reader to benefit from experience, problems and solutions described.
×
引用
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学术官方微信