Lee Seung-Won, Heo Kyung-Soo, Kim Min-A, Kim Do-Kyoung, Choi Hoon
Department of C4I Research, LIG Nex1, Seongnam 13488, Republic of Korea.
Department of Computer Science and Engineering, Chungnam National University, Daejeon 34134, Republic of Korea.
Sensors (Basel). 2024 May 2;24(9):2913. doi: 10.3390/s24092913.
The burgeoning interest in intelligent transportation systems (ITS) and the widespread adoption of in-vehicle amenities like infotainment have spurred a heightened fascination with vehicular ad-hoc networks (VANETs). Multi-hop routing protocols are pivotal in actualizing these in-vehicle services, such as infotainment, wirelessly. This study presents a novel protocol called multiple junction-based traffic-aware routing (MJTAR) for VANET vehicles operating in urban environments. MJTAR represents an advancement over the improved greedy traffic-aware routing (GyTAR) protocol. MJTAR introduces a distributed mechanism capable of recognizing vehicle traffic and computing curve metric distances based on two-hop junctions. Additionally, it employs a technique to dynamically select the most optimal multiple junctions between source and destination using the ant colony optimization (ACO) algorithm. We implemented the proposed protocol using the network simulator 3 (NS-3) and simulation of urban mobility (SUMO) simulators and conducted performance evaluations by comparing it with GSR and GyTAR. Our evaluation demonstrates that the proposed protocol surpasses GSR and GyTAR by over 20% in terms of packet delivery ratio, with the end-to-end delay reduced to less than 1.3 s on average.
对智能交通系统（ITS）的兴趣日益浓厚，以及诸如信息娱乐等车载设施的广泛应用，激发了人们对车载自组网（VANET）的更高兴趣。多跳路由协议对于无线实现这些车载服务（如信息娱乐）至关重要。本研究提出了一种名为基于多路口的流量感知路由（MJTAR）的新型协议，用于在城市环境中运行的VANET车辆。MJTAR是对改进的贪婪流量感知路由（GyTAR）协议的一种改进。MJTAR引入了一种分布式机制，能够识别车辆流量并基于两跳路口计算曲线度量距离。此外，它采用一种技术，利用蚁群优化（ACO）算法动态选择源节点和目的地之间的最优多个路口。我们使用网络模拟器3（NS-3）和城市交通仿真（SUMO）模拟器实现了所提出的协议，并通过与GSR和GyTAR进行比较来进行性能评估。我们的评估表明，所提出的协议在数据包交付率方面比GSR和GyTAR高出20%以上，平均端到端延迟降低到不到1.3秒。
