The full text of this article

 

PSCAR: a proactive-optimal-path selection with coordinator agents assisted routing for vehicular ad hoc networks
by Souaad Boussoufa-Lahlah; Fouzi Semchedine; Louiza Bouallouche-Medjkoune; Nadir Farhi
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 11, No. 2, 2018

 

Abstract: In this paper, we propose the proactive-optimal-path selection with coordinator agents assisted routing (PSCAR) protocol for VANETs. The main idea of PSCAR is to contribute static nodes as coordinator agents placed at each intersection. Since the coordinator agents are static nodes, each one knows all the paths to any other coordinator agent in the network. Thus, instead of searching an optimal path toward the destination, PSCAR will determine an optimal path to the nearest coordinator agent to the destination so as to better anticipate any change of the destination's position. The optimal path is selected according to two criteria: the total physical distance and the vehicle density on the path. To evaluate the performance of PSCAR, we used the Network Simulator 2 (ns-2) and the mobility simulator SUMO. We compare our scheme with some existing solutions at the aim of showing its effectiveness, in terms of packet delivery ratio, end-to-end delay, and network overhead.

Online publication date: Thu, 08-Feb-2018

 

is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

 
Pay per view:
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 High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:

 

    Username:        Password:         

Forgotten your 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 subs@inderscience.com