GDL

An Approach for Alleviating the Starvation Problem in Road Side Units (RSUs)-based Vehicular Ad Hoc Networks (VANETs)

ISSN 2223-4985
Journal from gdlhub / 2017-08-14 11:52:31
Oleh : Syeda Khairunnesa Samantha , Nusrat Nur Afrose Shoma , K. M. Azharul Hasan , International Journal of Information and Communication Technology Research
Dibuat : 2012-06-23, dengan 1 file

Keyword : On-demand scheduling algorithms, Vehicular Ad Hoc Networks (VANETs ), Road Side Units (RSUs)
Subjek : An Approach for Alleviating the Starvation Problem in Road Side Units (RSUs)-based Vehicular Ad Hoc Networks (VANETs)
Url : http://esjournals.org/journaloftechnology/archive/vol2no2/vol2no2_10.pdf
Sumber pengambilan dokumen : Internet

Scheduling for data exchange in Vehicular Ad Hoc Networks (VANETs) is being considered as a vital issue by the


researchers. Road Side Units (RSUs) being the standalone buffer point is to compensate the less connectivity problem due


to mobility of vehicles. Here we formulate an RSU-based VANETs model. Due to vehicle mobility and RSU range


constraint scheduling is an important issue to meet a vehicle’s issued demand in hard real-time. We investigate existing


scheduling algorithm serve a data item only based on vehicles’ submitted requests’ characteristics and avoiding the


relationship between a vehicle and its submitted requests which leads a vehicle level starvation problem. In this paper, we


address this starvation problem and propose a solution to minimize the problem. Simulation result also supports our


proposed approach and offers expected result.

Deskripsi Alternatif :

Scheduling for data exchange in Vehicular Ad Hoc Networks (VANETs) is being considered as a vital issue by the


researchers. Road Side Units (RSUs) being the standalone buffer point is to compensate the less connectivity problem due


to mobility of vehicles. Here we formulate an RSU-based VANETs model. Due to vehicle mobility and RSU range


constraint scheduling is an important issue to meet a vehicle’s issued demand in hard real-time. We investigate existing


scheduling algorithm serve a data item only based on vehicles’ submitted requests’ characteristics and avoiding the


relationship between a vehicle and its submitted requests which leads a vehicle level starvation problem. In this paper, we


address this starvation problem and propose a solution to minimize the problem. Simulation result also supports our


proposed approach and offers expected result.

Beri Komentar ?#(0) | Bookmark

Properti	Nilai Properti
ID Publisher	gdlhub
Organisasi	International Journal of Information and Communication Technology Research
Nama Kontak	Herti Yani, S.Kom
Alamat	Jln. Jenderal Sudirman
Kota	Jambi
Daerah	Jambi
Negara	Indonesia
Telepon	0741-35095
Fax	0741-35093
E-mail Administrator	elibrarystikom@gmail.com
E-mail CKO	elibrarystikom@gmail.com