On-demand distance vector refinement-based car networking stable routing Online publication date: Mon, 04-May-2020
by Shutao Zhou; Chengxing Li; Hui Yu
International Journal of Innovative Computing and Applications (IJICA), Vol. 11, No. 2/3, 2020
Abstract: Due to the high-speed movement of vehicles and obstacles in urban scenes, the communication paths between vehicles become extremely fragile. Specific to the routing problem of VANETs, a path criterion-based on-demand distance vector PA-AODV routing algorithm is proposed. The PA-AODV routing algorithm makes full use of the characteristics of AODV routing, and improves its routing decision. By calculating the path criterion weight and preferentially selecting the path with small weight for data transmission, the path stability is thus improved. The experimental data show that the proposed PA-AODV routing reduces the data packets loss rate and also shortens the end-to-end transmission delay.
Online publication date: Mon, 04-May-2020
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Innovative Computing and Applications (IJICA):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org