Abstract—Facilitation of data dissemination in Vehicular Ad Hoc Networks (VANETs) demands for a robust scheduler in this regard. High mobility of vehicles exhibits less connectivity problem establishing the idea of Road Side Units (RSUs) as a buffer point in VANETs. In this paper, firstly we formulate a RSU-based dynamic VANETs environment by specifying the constraints and secondly apply different on-demand scheduling algorithms in this environment. We have executed a series of simulations and analyzed the performance of different on-demand scheduling algorithms against different performance metrics having high workload and tight time constraints. Finally, we suggest which on-demand scheduling algorithm is most adaptable in this highly mobile and sparsely connected network environment based on our experimental result.
Index Terms—On-demand scheduling algorithms, road side units (RSUs), vehicular ad hoc networks (VANETs) etc.
Syeda Khairunnesa Samantha is with the Department of Computer Science and Engineering, Khulna University of Engineering & Technology, Khulna, Bangladesh (e-mail: syeda. samantha@ yahoo.com).
Nusrat Nur Afrose is with the Department of Computer Science and Engineering, Khulna University of Engineering & Technology, Khulna, Bangladesh (e-mail: nusratnurafroseshoma @ yahoo.com).
Cite: Syeda Khairunnesa Samantha and Nusrat Nur Afrose, "Simulation Study of On-Demand Scheduling Algorithms in Road Side Units (RSUs)-Based Vehicular Ad Hoc Networks (VANETs)," International Journal of Modeling and Optimization vol. 2, no. 5, pp. 597-602, 2012.
Copyright © 2008-2024. International Journal of Modeling and Optimization. All rights reserved.
E-mail: ijmo@iacsitp.com