Two-step joint scheduling scheme for road side units (Rsus)-based vehicular ad hoc networks (vanets)

7Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Recently, the use of Road Side Units (RSUs) has been proposed as a mechanism to handle the connectivity issues in VANETs for data dissemination. In this paper, we provide a model where an RSU deals with both download and upload queues. In VANETs, since vehicles are highly mobile, if as RSU fails to receive the updated information from a vehicle, all the subsequent vehicles receive the stale data from that RSU which substantially decreases the main objective of data dissemination. To find an efficient data dissemination procedure in this circumstances, we propose a second-step scheduling algorithm to form a two-step joint scheduling algorithm in where as the first-step scheduler we use existing on-demand real-time algorithm. We study the performance of a number of different joint scheduling algorithms by varying different on-demand scheduling algorithms as first-step scheduler using simulation experiments with various parameter settings and high workload. Finally, we recommend which two-step joint scheduling algorithm is suitable in this RSU-based VANETs environment.

Cite

CITATION STYLE

APA

Nawaz Ali, G. G. M., Chan, E., & Li, W. (2011). Two-step joint scheduling scheme for road side units (Rsus)-based vehicular ad hoc networks (vanets). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6637 LNCS, pp. 453–464). Springer Verlag. https://doi.org/10.1007/978-3-642-20244-5_43

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free