Cluster Based Lion Optimization Routing Protocol for Internet of Vehicles (CLORP)

IF 2.5 4区 计算机科学 Q3 TELECOMMUNICATIONS
Farhana Ajaz, Mohd Naseem, Janjhyam Venkata Naga Ramesh, Mohammad Shabaz, Gulfam Ahamad
{"title":"Cluster Based Lion Optimization Routing Protocol for Internet of Vehicles (CLORP)","authors":"Farhana Ajaz,&nbsp;Mohd Naseem,&nbsp;Janjhyam Venkata Naga Ramesh,&nbsp;Mohammad Shabaz,&nbsp;Gulfam Ahamad","doi":"10.1002/ett.70089","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>In view of the vast range of applications and advantages the Internet of Vehicles (IoV) offers, such as better passenger safety, entertainment, and traffic efficiency, the IoV has been the subject of substantial research. Information is sent directly or indirectly between nodes in the IoV. In the IoV, information interchange between people, vehicles, and roadside equipment is prioritized, and routing is a crucial stage in this process. Data transfer from the starting node to the destination node offers a routing challenge due to the network's dynamic nature. Routing issues arise from the need to consider a number of factors, like the throughput latency, packet delivery ratio, and routing overhead. A topology-based routing protocol that is most popular is called Ad-hoc On-Demand Distance Vector (AODV), although during route discovery, it produces a lot of unnecessary paths between source and destination nodes. In this article, a novel protocol named Cluster-based Lion Optimization Routing Protocol (CLORP) is proposed to lower the network load which is the main reason behind the problem of inefficient network performance. CLORP is centered around cluster formation and choosing the CH using the lion algorithm. It strengthens AODV protocol with the use of gateway nodes and cluster heads for routing while forming stable clusters. The main goal of CLORP is to decrease the amount of control messages sent by employing the clustering idea and choosing the best cluster head using the Lion optimization algorithm that enhances network performance. To examine the protocol's efficiency, its output is compared with that of AODV, Improved AODV, CACOIOV, AODV-DATRLD, ACO-DATRLD, DMCNF, and EHCP.</p>\n </div>","PeriodicalId":23282,"journal":{"name":"Transactions on Emerging Telecommunications Technologies","volume":"36 3","pages":""},"PeriodicalIF":2.5000,"publicationDate":"2025-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transactions on Emerging Telecommunications Technologies","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/ett.70089","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

In view of the vast range of applications and advantages the Internet of Vehicles (IoV) offers, such as better passenger safety, entertainment, and traffic efficiency, the IoV has been the subject of substantial research. Information is sent directly or indirectly between nodes in the IoV. In the IoV, information interchange between people, vehicles, and roadside equipment is prioritized, and routing is a crucial stage in this process. Data transfer from the starting node to the destination node offers a routing challenge due to the network's dynamic nature. Routing issues arise from the need to consider a number of factors, like the throughput latency, packet delivery ratio, and routing overhead. A topology-based routing protocol that is most popular is called Ad-hoc On-Demand Distance Vector (AODV), although during route discovery, it produces a lot of unnecessary paths between source and destination nodes. In this article, a novel protocol named Cluster-based Lion Optimization Routing Protocol (CLORP) is proposed to lower the network load which is the main reason behind the problem of inefficient network performance. CLORP is centered around cluster formation and choosing the CH using the lion algorithm. It strengthens AODV protocol with the use of gateway nodes and cluster heads for routing while forming stable clusters. The main goal of CLORP is to decrease the amount of control messages sent by employing the clustering idea and choosing the best cluster head using the Lion optimization algorithm that enhances network performance. To examine the protocol's efficiency, its output is compared with that of AODV, Improved AODV, CACOIOV, AODV-DATRLD, ACO-DATRLD, DMCNF, and EHCP.

Abstract Image

基于集群的车联网狮子优化路由协议(CLORP)
鉴于车联网(IoV)提供的广泛应用和优势,例如更好的乘客安全,娱乐和交通效率,车联网一直是大量研究的主题。信息在IoV的节点之间直接或间接传递。在车联网中,人、车和路边设备之间的信息交换是优先考虑的,路由是这一过程中的关键阶段。由于网络的动态性,从起始节点到目标节点的数据传输提供了路由挑战。路由问题产生于需要考虑许多因素,如吞吐量延迟、数据包传递比率和路由开销。基于拓扑的路由协议AODV (Ad-hoc On-Demand Distance Vector)是目前最流行的一种路由协议,但在路由发现过程中,它会在源节点和目的节点之间产生大量不必要的路径。本文提出了一种新的基于集群的狮子优化路由协议(CLORP),以降低网络负载,这是导致网络性能低下的主要原因。CLORP以簇的形成和使用狮子算法选择CH为中心。它通过使用网关节点和簇头进行路由来加强AODV协议,同时形成稳定的簇。CLORP的主要目标是通过采用集群思想和使用Lion优化算法选择最佳簇头来减少发送的控制消息的数量,从而提高网络性能。为了检验该协议的效率,将其输出与AODV、Improved AODV、CACOIOV、AODV- datrld、ACO-DATRLD、DMCNF和EHCP进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
8.90
自引率
13.90%
发文量
249
期刊介绍: ransactions on Emerging Telecommunications Technologies (ETT), formerly known as European Transactions on Telecommunications (ETT), has the following aims: - to attract cutting-edge publications from leading researchers and research groups around the world - to become a highly cited source of timely research findings in emerging fields of telecommunications - to limit revision and publication cycles to a few months and thus significantly increase attractiveness to publish - to become the leading journal for publishing the latest developments in telecommunications
×
引用
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学术官方微信