基于 Komodo Mlipir 算法的优化路由确定机制,用于提高车载 Ad Hoc 网络的服务质量

IF 3.8 3区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Sustainable Computing-Informatics & Systems Pub Date : 2024-01-15 DOI:10.1016/j.suscom.2024.100956
R.K. Soundarayaa, C. Balasubramanian
{"title":"基于 Komodo Mlipir 算法的优化路由确定机制,用于提高车载 Ad Hoc 网络的服务质量","authors":"R.K. Soundarayaa,&nbsp;C. Balasubramanian","doi":"10.1016/j.suscom.2024.100956","DOIUrl":null,"url":null,"abstract":"<div><p><span><span><span><span>In Vehicular ad hoc network (VANETs), Quality of Service (QoS)- aware protocols helps in handling the necessitated demand of delay sensitive applications for facilitating intelligent transportation. The fundamental challenge of VANETs lies in the process of establishing vehicle to infrastructure and vehicle-to-vehicle communication that are prone to link failure. Bio-inspired algorithms are identified to provide reliable solutions for securing the links of VANETs. In this paper, Komodo Mlipir Algorithm-based Optimal Route Determination Mechanism (KMAORDM) is proposed for achieving best optimal route that guarantees enhanced QoS. This QoS aware routing protocol utilizes the exceptional potentiality of Komodo Mlipir Algorithm attributed in terms of exploration and exploitation for the objective of evaluating and memorizing the impactful factors that helps in exchanging the necessitated messages to its neighbours. It adopts Mlipir as a best mode of modelling the behaviours of vehicular nodes during the process of data routing in VANETs. It uses a cache strategy which discovered reliable traversed </span>routing paths such that the pre-cached route is used for data transmission. This cache strategy paves the way for preventing the route identification and maintenance process with minimized routing overhead. It also identifies the fittest vehicular node from its one hop distance as the successive forwarder in the absence of pre-cached route for addressing link failure during reliable </span>packet transmission. The simulation results of this proposed KMAORDM approach with different vehicular nodes confirmed minimized </span>communication overhead of 19.32 %, reduced </span>network latency of 18.64 %, maximized throughput of 18.54 % better than benchmarked approaches.</p></div>","PeriodicalId":48686,"journal":{"name":"Sustainable Computing-Informatics & Systems","volume":"42 ","pages":"Article 100956"},"PeriodicalIF":3.8000,"publicationDate":"2024-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Komodo Mlipir Algorithm-based optimal route determination mechanism for improving Quality of Service in Vehicular ad hoc network\",\"authors\":\"R.K. Soundarayaa,&nbsp;C. Balasubramanian\",\"doi\":\"10.1016/j.suscom.2024.100956\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p><span><span><span><span>In Vehicular ad hoc network (VANETs), Quality of Service (QoS)- aware protocols helps in handling the necessitated demand of delay sensitive applications for facilitating intelligent transportation. The fundamental challenge of VANETs lies in the process of establishing vehicle to infrastructure and vehicle-to-vehicle communication that are prone to link failure. Bio-inspired algorithms are identified to provide reliable solutions for securing the links of VANETs. In this paper, Komodo Mlipir Algorithm-based Optimal Route Determination Mechanism (KMAORDM) is proposed for achieving best optimal route that guarantees enhanced QoS. This QoS aware routing protocol utilizes the exceptional potentiality of Komodo Mlipir Algorithm attributed in terms of exploration and exploitation for the objective of evaluating and memorizing the impactful factors that helps in exchanging the necessitated messages to its neighbours. It adopts Mlipir as a best mode of modelling the behaviours of vehicular nodes during the process of data routing in VANETs. It uses a cache strategy which discovered reliable traversed </span>routing paths such that the pre-cached route is used for data transmission. This cache strategy paves the way for preventing the route identification and maintenance process with minimized routing overhead. It also identifies the fittest vehicular node from its one hop distance as the successive forwarder in the absence of pre-cached route for addressing link failure during reliable </span>packet transmission. The simulation results of this proposed KMAORDM approach with different vehicular nodes confirmed minimized </span>communication overhead of 19.32 %, reduced </span>network latency of 18.64 %, maximized throughput of 18.54 % better than benchmarked approaches.</p></div>\",\"PeriodicalId\":48686,\"journal\":{\"name\":\"Sustainable Computing-Informatics & Systems\",\"volume\":\"42 \",\"pages\":\"Article 100956\"},\"PeriodicalIF\":3.8000,\"publicationDate\":\"2024-01-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Sustainable Computing-Informatics & Systems\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2210537924000015\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sustainable Computing-Informatics & Systems","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2210537924000015","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

在车载网络(VANET)中,服务质量(QoS)感知协议有助于处理对延迟敏感的应用的必要需求,从而促进智能交通。VANETs 面临的基本挑战在于建立车辆与基础设施以及车辆与车辆之间的通信过程中容易出现链路故障。生物启发算法为确保 VANET 的链路安全提供了可靠的解决方案。本文提出了基于 Komodo Mlipir 算法的最佳路由确定机制(KMAORDM),以实现最佳路由,保证增强的 QoS。该 QoS 感知路由协议利用了 Komodo Mlipir 算法在探索和利用方面的特殊潜力,目的是评估和记忆有影响的因素,从而帮助与邻居交换必要的信息。它采用 Mlipir 作为在 VANET 数据路由过程中模拟车辆节点行为的最佳模式。它使用一种缓存策略来发现可靠的遍历路由路径,从而将预先缓存的路由用于数据传输。这种缓存策略为防止路由识别和维护过程中的路由开销最小化铺平了道路。在没有预缓存路由的情况下,它还能从一跳距离内找出最合适的车辆节点作为后续转发器,以便在可靠的数据包传输过程中处理链路故障。该 KMAORDM 方法与不同车辆节点的仿真结果表明,与基准方法相比,通信开销最小化了 19.32%,网络延迟减少了 18.64%,吞吐量最大化了 18.54%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Komodo Mlipir Algorithm-based optimal route determination mechanism for improving Quality of Service in Vehicular ad hoc network

In Vehicular ad hoc network (VANETs), Quality of Service (QoS)- aware protocols helps in handling the necessitated demand of delay sensitive applications for facilitating intelligent transportation. The fundamental challenge of VANETs lies in the process of establishing vehicle to infrastructure and vehicle-to-vehicle communication that are prone to link failure. Bio-inspired algorithms are identified to provide reliable solutions for securing the links of VANETs. In this paper, Komodo Mlipir Algorithm-based Optimal Route Determination Mechanism (KMAORDM) is proposed for achieving best optimal route that guarantees enhanced QoS. This QoS aware routing protocol utilizes the exceptional potentiality of Komodo Mlipir Algorithm attributed in terms of exploration and exploitation for the objective of evaluating and memorizing the impactful factors that helps in exchanging the necessitated messages to its neighbours. It adopts Mlipir as a best mode of modelling the behaviours of vehicular nodes during the process of data routing in VANETs. It uses a cache strategy which discovered reliable traversed routing paths such that the pre-cached route is used for data transmission. This cache strategy paves the way for preventing the route identification and maintenance process with minimized routing overhead. It also identifies the fittest vehicular node from its one hop distance as the successive forwarder in the absence of pre-cached route for addressing link failure during reliable packet transmission. The simulation results of this proposed KMAORDM approach with different vehicular nodes confirmed minimized communication overhead of 19.32 %, reduced network latency of 18.64 %, maximized throughput of 18.54 % better than benchmarked approaches.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Sustainable Computing-Informatics & Systems
Sustainable Computing-Informatics & Systems COMPUTER SCIENCE, HARDWARE & ARCHITECTUREC-COMPUTER SCIENCE, INFORMATION SYSTEMS
CiteScore
10.70
自引率
4.40%
发文量
142
期刊介绍: Sustainable computing is a rapidly expanding research area spanning the fields of computer science and engineering, electrical engineering as well as other engineering disciplines. The aim of Sustainable Computing: Informatics and Systems (SUSCOM) is to publish the myriad research findings related to energy-aware and thermal-aware management of computing resource. Equally important is a spectrum of related research issues such as applications of computing that can have ecological and societal impacts. SUSCOM publishes original and timely research papers and survey articles in current areas of power, energy, temperature, and environment related research areas of current importance to readers. SUSCOM has an editorial board comprising prominent researchers from around the world and selects competitively evaluated peer-reviewed papers.
期刊最新文献
Novel sustainable green transportation: A neutrosophic multi-objective model considering various factors in logistics Federated learning at the edge in Industrial Internet of Things: A review Enhancing economic and environmental performance of energy communities: A multi-objective optimization approach with mountain gazelle optimizer Energy consumption and workload prediction for edge nodes in the Computing Continuum Secured Energy Efficient Chaotic Gazelle based Optimized Routing Protocol in mobile ad-hoc network
×
引用
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