Priority based efficient data scheduling technique for VANETs

Dubey, Brij Bihari; Chauhan, Naveen; Chand, Narottam; Awasthi, Lalit Kumar

doi:10.1007/s11276-015-1051-8

Cited by 17 publications

(7 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [ 21 ], Javad et al provided a packet scheduling mechanism where priority is given based on the importance of the packets degrees by multi-level queuing. In [ 22 ], Dubey et al proposed a scheduling policy for those in the range of RSU, and its deadline is near to expire. Moreover, it gives preference to those requests whose priority is high, but its deadline is low, due to which these messages are dropped.…”

Section: Related Workmentioning

confidence: 99%

On the Design of Efficient Hierarchic Architecture for Software Defined Vehicular Networks

Adnan

Iqbal

Waheed

et al. 2021

Sensors

View full text Add to dashboard Cite

Modern vehicles are equipped with various sensors, onboard units, and devices such as Application Unit (AU) that support routing and communication. In VANETs, traffic management and Quality of Service (QoS) are the main research dimensions to be considered while designing VANETs architectures. To cope with the issues of QoS faced by the VANETs, we design an efficient SDN-based architecture where we focus on the QoS of VANETs. In this paper, QoS is achieved by a priority-based scheduling algorithm in which we prioritize traffic flow messages in the safety queue and non-safety queue. In the safety queue, the messages are prioritized based on deadline and size using the New Deadline and Size of data method (NDS) with constrained location and deadline. In contrast, the non-safety queue is prioritized based on First Come First Serve (FCFS) method. For the simulation of our proposed scheduling algorithm, we use a well-known cloud computing framework CloudSim toolkit. The simulation results of safety messages show better performance than non-safety messages in terms of execution time.

show abstract

Section: Related Workmentioning

confidence: 99%

On the Design of Efficient Hierarchic Architecture for Software Defined Vehicular Networks

Adnan

Iqbal

Waheed

et al. 2021

Sensors

View full text Add to dashboard Cite

show abstract

“…This algorithm schedules data for those vehicles which are in the coverage area. It also provides the priority to vehicles before completion of its deadline and performs over bandwidth utilization and fairness [46].…”

Section: E Priority Based Schedulingmentioning

confidence: 99%

Routing and Scheduling Issues in Vehicular Ad-hoc Networks

Kamble¹,

Kounte²

2019

IJRTE

View full text Add to dashboard Cite

VANETs have developed as one of the largest potential topics in the field of automotive industries with promising and challenging futures in various aspects. VANETs permit intelligent vehicles to generate their own organized network without the need of the stable network. In this paper we introduce VANETs and its comparison with MANETs, standard wireless access in VANETs like WAVE model partly based on OSI model. We present a comprehensive study on routing protocol in VANETs like position-based routing, Geo-Cast based routing, etc. and scheduling in VANETs like deadline-based scheduling, hybrid-based scheduling, etc. This paper presents open research issues in VANETs highlighting challenges like security and privacy issues, network congestion control issues, etc, numerous routing and scheduling issues in VANETs.

show abstract

“…A set of priority rules were defined for network access control and to resolve network access conflicts. In [8], scheduling is done to prioritise vehicles which are more probable to miss deadline. Deadline is measured by estimating the time of a vehicle leaving the transmission range of RSU.…”

Section: Related Workmentioning

confidence: 99%

“…Since there is a queue in which packets are arranged either according to first-in first-out or according to priorities of messages or using any other mechanism as researchers suggest [6][7][8][9]. The queue is mostly considered to be a linked list.…”

Section: Introductionmentioning

confidence: 99%