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

Dissimilarity Metric Based on Local Neighboring Information and Genetic Programming for Data Dissemination in Vehicular Ad Hoc Networks (VANETs)

Abstract: This paper presents a novel dissimilarity metric based on local neighboring information and a genetic programming approach for efficient data dissemination in Vehicular Ad Hoc Networks (VANETs). The primary aim of the dissimilarity metric is to replace the Euclidean distance in probabilistic data dissemination schemes, which use the relative Euclidean distance among vehicles to determine the retransmission probability. The novel dissimilarity metric is obtained by applying a metaheuristic genetic programming a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 16 publications
(10 citation statements)
references
References 31 publications
(89 reference statements)
0
9
0
Order By: Relevance
“…If a vehicle V i is lying within the transmission range (T R ) of another vehicle V j , i.e., (distance between V i and V j ≤ T R ), then they are presumed to be connected by a unidirectional link l i E. Whenever V i transmits a packet, it is directly received by V j via an edge l i . An edge E = ( V i , V j ) exists between two vehicles if the Euclidean distance [50] between them is less than or equal to their T R , as given in Equation ( 3).…”
Section: Connectivity Phasementioning
confidence: 99%
“…If a vehicle V i is lying within the transmission range (T R ) of another vehicle V j , i.e., (distance between V i and V j ≤ T R ), then they are presumed to be connected by a unidirectional link l i E. Whenever V i transmits a packet, it is directly received by V j via an edge l i . An edge E = ( V i , V j ) exists between two vehicles if the Euclidean distance [50] between them is less than or equal to their T R , as given in Equation ( 3).…”
Section: Connectivity Phasementioning
confidence: 99%
“…Chaqfeh et al [27] proposed another approach to solve the congestion problem in heavy traffic during data transmission among vehicles, based on the concept of relay node selection but they have still not considered some other parameters which can solve the problem of broadcast storm more efficiently. Further the technique based on probability during flooding was proposed by Gutiérrez-Reina et al [28] for data dissemination in VANET, but the problem of delay in coverage was still persists and overall throughput was not up to the mark as proposed in dense network due to less rate of coverage. Qureshi et al [29] proposed cluster based approach for vehicular data dissemination.…”
Section: Related Workmentioning
confidence: 99%
“…Genetic algorithms (GAs) are meta-heuristic algorithms that have been widely used for solving complex engineering problems [58,59]. GAs are based on the Darwinian theory of biological evolution.…”
Section: Evolutionary Computational Approachmentioning
confidence: 99%