2018
DOI: 10.3390/s18020597
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Framework Model for Optimizing Routing Performance in VANETs

Abstract: Routing in Vehicular Ad hoc Networks (VANET) is a bit complicated because of the nature of the high dynamic mobility. The efficiency of routing protocol is influenced by a number of factors such as network density, bandwidth constraints, traffic load, and mobility patterns resulting in frequency changes in network topology. Therefore, Quality of Service (QoS) is strongly needed to enhance the capability of the routing protocol and improve the overall network performance. In this paper, we introduce a statistic… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 24 publications
(14 citation statements)
references
References 40 publications
0
14
0
Order By: Relevance
“…e original IDNCassisted algorithms without admission control are labeled as EDF, SIN, and PVDD, respectively. e algorithms with (1) If R i receives a newly arriving request r i then (2) Determine the priority of r i ; (3) if r i is high priority then (4) Admit r i and put r i into the high priority service queue; (5) else (6) Vectorize r i as rv ij , the mean vector of VE α as rv α , and the mean vector of VE β as rv β ; (7) Calculate rv α and rv β as described in Section 4.2.1; (8) Calculate the distance between rv ij and rv α , and the distance between rv ij and rv β , respectively; (9) Compare the distances (10) if dist(rv ij , rv α ) ≤ dist(rv ij , rv β ) then (11) Reject r i ; (12) Send a rejection message to the vehicle; (13) else (14) if dist(rv ij , rv α ) > dist(rv ij , rv β ) then (15) Admit r i and put r i into the low priority service queue; (16) end if (17) end if (18) end if (19) network coding-aware admission control are denoted as EDF_NCaAC, SIN_NCaAC, and PVDD_NCaAC. e results are obtained when the system is in a steady state and all data points are based on the average of over 5000 simulation runs.…”
Section: Performance Evaluationmentioning
confidence: 99%
See 1 more Smart Citation
“…e original IDNCassisted algorithms without admission control are labeled as EDF, SIN, and PVDD, respectively. e algorithms with (1) If R i receives a newly arriving request r i then (2) Determine the priority of r i ; (3) if r i is high priority then (4) Admit r i and put r i into the high priority service queue; (5) else (6) Vectorize r i as rv ij , the mean vector of VE α as rv α , and the mean vector of VE β as rv β ; (7) Calculate rv α and rv β as described in Section 4.2.1; (8) Calculate the distance between rv ij and rv α , and the distance between rv ij and rv β , respectively; (9) Compare the distances (10) if dist(rv ij , rv α ) ≤ dist(rv ij , rv β ) then (11) Reject r i ; (12) Send a rejection message to the vehicle; (13) else (14) if dist(rv ij , rv α ) > dist(rv ij , rv β ) then (15) Admit r i and put r i into the low priority service queue; (16) end if (17) end if (18) end if (19) network coding-aware admission control are denoted as EDF_NCaAC, SIN_NCaAC, and PVDD_NCaAC. e results are obtained when the system is in a steady state and all data points are based on the average of over 5000 simulation runs.…”
Section: Performance Evaluationmentioning
confidence: 99%
“…cannot guarantee that all requests can be served in time and network congestion will occur and make a great negative impact on the received QoS [3]. To provide user-satisfying QoS for wireless applications in VANETs, it is vital to avoid network congestion and prevent system overload through rational utilization of network resources.…”
mentioning
confidence: 99%
“…This communication is termed as Vehicle to Infrastructure (V2I) communication. Service providers giving out the obtaining work and updated information by the vehicles is granted by V2I [2] Yang et al [12] proposed a residual route function time to compute the overlapping time between the vehicles quantitatively with information route by means of novel cluster head metric selection is offered. Mechanism of future-cluster head is devised in addition, though which the message exchanges at intersections could be prevented and the overhead of cluster maintenance could be reduced.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The previous solutions were based on the single layers of a particular stack. Therefore, in this research a cross layered decision based routing was assisted which selected the best path for the delivery of the packets to meet the needs of QoS [8] [9]. The present protocol gathered the information about the channel rate specifically in the decision making procedure.…”
Section: Qos Related Surveymentioning
confidence: 99%