2018
DOI: 10.1109/tla.2018.8447368
|View full text |Cite
|
Sign up to set email alerts
|

A Greedy Routing Strategy Based on Euclidean Geometry for Vehicular Delay Tolerant Network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 16 publications
0
2
0
Order By: Relevance
“…Services and applications are separated from messaging. Routing protocol has become an important part of VANET research [16]. The nature of the network leads to frequent changes in the network structure and frequent interruption of communication links.…”
Section: Dtn Routing Protocol Of Vehicle Self-organizingmentioning
confidence: 99%
“…Services and applications are separated from messaging. Routing protocol has become an important part of VANET research [16]. The nature of the network leads to frequent changes in the network structure and frequent interruption of communication links.…”
Section: Dtn Routing Protocol Of Vehicle Self-organizingmentioning
confidence: 99%
“…This algorithm also improves the performance of forwarding messages. Andrade et al 25 proposed a greedy DTN routing strategy based on Euclidean Geometry (GREG) in VDTNs. Based on the predicted node position through a mathematical model, GREG computes the Euclidean geometrical distance between the node currently holding the message and the destination node.…”
Section: Related Workmentioning
confidence: 99%