Dynamic opportunistic routing protocol for ad-hoc Internet of Vehicles (IoV)

IF 3.3 3区计算机科学 Q2 COMPUTER SCIENCE, THEORY & METHODS Computing Pub Date : 2024-02-05 DOI:10.1007/s00607-023-01248-9

{"title":"Dynamic opportunistic routing protocol for ad-hoc Internet of Vehicles (IoV)","authors":"","doi":"10.1007/s00607-023-01248-9","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> <p>Internet of Vehicles (IoV) aka V2X is a growing area of research that aims at information exchange between vehicles and all other related objects to develop intelligent transportation systems. IoVs are characterized by high mobility, high-speed internet, varying node density, and dynamic topology and aim to minimize and communicate situations like traffic congestion, accidents, etc. Discovering a routing path in a highly unstable network environment to ensure the successful delivery of packets with minimal overheads. Finding reliable routing links as against shortest path routing is a necessity in IoV networks. In this paper, a routing protocol coined as the dynamic opportunistic routing protocol for IoV (DORP-IoV) is presented. DORP-IoV is an on-demand position-based protocol that seeks the advantage of wireless broadcast advantage to select a hop close to the virtual line of sight between source and destination for communicating the information to the destination. Vehicle movement direction and vehicle density around the ideal hop location are also considered while selecting the next hop for information forwarding. Communicating the information through an optimal number of intermediate nodes is the novelty of the work which ensures better packet delivery with minimized delay and routing overheads. The performance of DORP-IoV is evaluated and results are compared with the performance of Weighted- Greedy Perimeter Coordinator Routing (W-GPCR), Greedy Perimeter Coordinator Routing, and Greedy Perimeter Stateless Routing for varying node density and network connections for various metrics. DORP-IoV shows an improved performance in the range of 8–12% for packet delivery with similar performance for average end-to-end delay compared to W-GPCR. The optimal hop selection mechanism in DORP-IoV reduces the number of hops by 10–30% compared to W-GPCR. </p>","PeriodicalId":10718,"journal":{"name":"Computing","volume":"19 1","pages":""},"PeriodicalIF":3.3000,"publicationDate":"2024-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00607-023-01248-9","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

Abstract

Internet of Vehicles (IoV) aka V2X is a growing area of research that aims at information exchange between vehicles and all other related objects to develop intelligent transportation systems. IoVs are characterized by high mobility, high-speed internet, varying node density, and dynamic topology and aim to minimize and communicate situations like traffic congestion, accidents, etc. Discovering a routing path in a highly unstable network environment to ensure the successful delivery of packets with minimal overheads. Finding reliable routing links as against shortest path routing is a necessity in IoV networks. In this paper, a routing protocol coined as the dynamic opportunistic routing protocol for IoV (DORP-IoV) is presented. DORP-IoV is an on-demand position-based protocol that seeks the advantage of wireless broadcast advantage to select a hop close to the virtual line of sight between source and destination for communicating the information to the destination. Vehicle movement direction and vehicle density around the ideal hop location are also considered while selecting the next hop for information forwarding. Communicating the information through an optimal number of intermediate nodes is the novelty of the work which ensures better packet delivery with minimized delay and routing overheads. The performance of DORP-IoV is evaluated and results are compared with the performance of Weighted- Greedy Perimeter Coordinator Routing (W-GPCR), Greedy Perimeter Coordinator Routing, and Greedy Perimeter Stateless Routing for varying node density and network connections for various metrics. DORP-IoV shows an improved performance in the range of 8–12% for packet delivery with similar performance for average end-to-end delay compared to W-GPCR. The optimal hop selection mechanism in DORP-IoV reduces the number of hops by 10–30% compared to W-GPCR.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

用于特设车辆互联网（IoV）的动态机会主义路由协议

摘要车联网（IoV）又称 V2X，是一个不断发展的研究领域，旨在实现车辆与所有其他相关物体之间的信息交换，以开发智能交通系统。IoVs 的特点是高流动性、高速互联网、不同的节点密度和动态拓扑结构，旨在最大限度地减少交通拥堵、事故等情况的发生并进行通信。在高度不稳定的网络环境中发现路由路径，确保以最小的开销成功发送数据包。与最短路径路由相比，寻找可靠的路由链接是物联网网络的必要条件。本文介绍了一种被称为物联网动态机会主义路由协议（DORP-IoV）的路由协议。DORP-IoV 是一种基于位置的按需协议，它利用无线广播优势，选择靠近源和目的地之间虚拟视线的一跳，将信息传送到目的地。在选择下一跳进行信息转发时，还要考虑理想跳点位置周围的车辆移动方向和车辆密度。通过最优数量的中间节点传递信息是这项工作的新颖之处，它确保了更好的数据包传递，同时最大限度地减少了延迟和路由开销。对 DORP-IoV 的性能进行了评估，并将评估结果与加权-贪婪周边协调器路由（W-GPCR）、贪婪周边协调器路由和贪婪周边无状态路由的性能进行了比较，后者适用于不同节点密度和网络连接的各种指标。与 W-GPCR 相比，DORP-IoV 的数据包传输性能提高了 8-12%，平均端到端延迟性能与 W-GPCR 相似。与 W-GPCR 相比，DORP-IoV 中的最优跳数选择机制减少了 10-30% 的跳数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Computing 工程技术-计算机：理论方法

CiteScore

8.20

自引率

2.70%

发文量

107

审稿时长

3 months

期刊介绍： Computing publishes original papers, short communications and surveys on all fields of computing. The contributions should be written in English and may be of theoretical or applied nature, the essential criteria are computational relevance and systematic foundation of results.