2023
DOI: 10.1007/s11235-023-01040-2
|View full text |Cite
|
Sign up to set email alerts
|

Data dissemination protocol for VANETs to optimize the routing path using hybrid particle swarm optimization with sequential variable neighbourhood search

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 17 publications
(2 citation statements)
references
References 36 publications
0
1
0
Order By: Relevance
“…In this section, we delve into a comprehensive analysis that underscores the novelty of our work and clarifies the challenges in solving the delay problem for dissemination in VANETs through w-SMNO. Concurrently, we conduct a comparative study of the existing technologies, examining their impacts on transmission performance, including a consideration of the relay from the next hop without cluster formation [45], considering the challenge of a broadcast storm using a cluster-based forwarding mechanism [46], and route optimization for messages to their destination using particle swarm methods [47]. Our findings provide a notable reduction in delays, attributed to a substantial decrease in collisions and an enhanced success rate in message delivery facilitated via the implementation of the spider monkey technique.…”
Section: Discussionmentioning
confidence: 99%
“…In this section, we delve into a comprehensive analysis that underscores the novelty of our work and clarifies the challenges in solving the delay problem for dissemination in VANETs through w-SMNO. Concurrently, we conduct a comparative study of the existing technologies, examining their impacts on transmission performance, including a consideration of the relay from the next hop without cluster formation [45], considering the challenge of a broadcast storm using a cluster-based forwarding mechanism [46], and route optimization for messages to their destination using particle swarm methods [47]. Our findings provide a notable reduction in delays, attributed to a substantial decrease in collisions and an enhanced success rate in message delivery facilitated via the implementation of the spider monkey technique.…”
Section: Discussionmentioning
confidence: 99%
“…The traditional Henon map employs values of 𝛼 = 1.4 and 𝛽 = 0.3, which distort the outcomes. A change in both values changes the characteristics of the resulting graph, which may no longer be chaotic [28,29]. The Henon map model is frequently used in image encryption as a broadcast technique or as a keystream generator to change pixel values in an image.…”
Section: Henon Mapmentioning
confidence: 99%