Al-Mayouf, Y.R.B. and Ismail, M. and Abdullah, N.F. and Wahab, A.W.A. and Mahdi, O.A. and Khan, S. and Choo, R.K.K. (2016) Efficient and stable routing algorithm based on user mobility and node density in urban vehicular network. PLoS ONE, 11 (11). e0165966. ISSN 1932-6203, DOI https://doi.org/10.1371/journal.pone.0165966.
Full text not available from this repository.Abstract
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.
| Item Type: | Article |
|---|---|
| Funders: | Universiti Kebangsaan Malaysia (UKM): Research grant gup-2016-005 |
| Uncontrolled Keywords: | Urban area; Validity; Algorithm; Theoretical model; Traffic and transport |
| Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
| Divisions: | Faculty of Computer Science & Information Technology |
| Depositing User: | Ms. Juhaida Abd Rahim |
| Date Deposited: | 14 Nov 2017 03:39 |
| Last Modified: | 14 Nov 2017 03:39 |
| URI: | http://eprints.um.edu.my/id/eprint/18251 |
Actions (login required)
 |
View Item |
