Al-Mayouf Yusor Rafid Bahar, Ismail Mahamod, Abdullah Nor Fadzilah, Wahab Ainuddin Wahid Abdul, Mahdi Omar Adil, Khan Suleman, Choo Kim-Kwang Raymond
Department of Electrical, Electronic and Systems Engineering, Faculty of Engineering and Built Environment, Universiti Kebangsaan Malaysia, Bangi, Selangor, Malaysia.
Department of Computer System & Technology, Faculty of Computer Science & Information Technology Building, University of Malaya, Kuala Lumpur, Malaysia.
PLoS One. 2016 Nov 17;11(11):e0165966. doi: 10.1371/journal.pone.0165966. eCollection 2016.
Vehicular ad hoc networks (VANETs) are considered an emerging technology in the industrial and educational fields. This technology is essential in the deployment of the intelligent transportation system, which is targeted to improve safety and efficiency of traffic. The implementation of VANETs can be effectively executed by transmitting data among vehicles with the use of multiple hops. However, the intrinsic characteristics of VANETs, such as its dynamic network topology and intermittent connectivity, limit data delivery. One particular challenge of this network is the possibility that the contributing node may only remain in the network for a limited time. Hence, to prevent data loss from that node, the information must reach the destination node via multi-hop routing techniques. An appropriate, efficient, and stable routing algorithm must be developed for various VANET applications to address the issues of dynamic topology and intermittent connectivity. Therefore, this paper proposes a novel routing algorithm called efficient and stable routing algorithm based on user mobility and node density (ESRA-MD). The proposed algorithm can adapt to significant changes that may occur in the urban vehicular environment. This algorithm works by selecting an optimal route on the basis of hop count and link duration for delivering data from source to destination, thereby satisfying various quality of service considerations. The validity of the proposed algorithm is investigated by its comparison with ARP-QD protocol, which works on the mechanism of optimal route finding in VANETs in urban environments. Simulation results reveal that the proposed ESRA-MD algorithm shows remarkable improvement in terms of delivery ratio, delivery delay, and communication overhead.
车载自组织网络（VANETs）被认为是工业和教育领域中的一项新兴技术。这项技术在智能交通系统的部署中至关重要，该系统旨在提高交通的安全性和效率。VANETs的实现可以通过多跳方式在车辆之间传输数据来有效执行。然而，VANETs的固有特性，如动态网络拓扑和间歇性连接，限制了数据传输。这个网络的一个特殊挑战是贡献节点可能只在网络中停留有限的时间。因此，为了防止该节点的数据丢失，信息必须通过多跳路由技术到达目的节点。必须为各种VANET应用开发一种合适、高效且稳定的路由算法，以解决动态拓扑和间歇性连接的问题。因此，本文提出了一种新颖的路由算法，称为基于用户移动性和节点密度的高效稳定路由算法（ESRA-MD）。所提出的算法能够适应城市车辆环境中可能发生的重大变化。该算法通过根据跳数和链路持续时间选择最优路由来将数据从源节点传输到目的节点，从而满足各种服务质量考量。通过将其与ARP-QD协议进行比较来研究所提出算法的有效性，ARP-QD协议基于城市环境中VANETs的最优路由查找机制工作。仿真结果表明，所提出的ESRA-MD算法在传输率、传输延迟和通信开销方面表现出显著的改进。
