Proceedings of the 7th Asian Internet Engineering Conference 2011
DOI: 10.1145/2089016.2089022
|View full text |Cite
|
Sign up to set email alerts
|

Directed information dissemination in VANET

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2013
2013
2013
2013

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…Suppose at time instance t + δ, the same node j of (i) becomes a 2-hop neighbor of k through MPR i, or the same node j of (ii) becomes a neighbor of k. Subsequently, the relative distance, r ki between node k and MPR i during time interval δ is calculated using (1). Note that, we assume the vehicles exchange their speed information every second to compute the relative distance.…”
Section: Relative Distance Calculation Between Two Vanet Nodesmentioning
confidence: 99%
See 1 more Smart Citation
“…Suppose at time instance t + δ, the same node j of (i) becomes a 2-hop neighbor of k through MPR i, or the same node j of (ii) becomes a neighbor of k. Subsequently, the relative distance, r ki between node k and MPR i during time interval δ is calculated using (1). Note that, we assume the vehicles exchange their speed information every second to compute the relative distance.…”
Section: Relative Distance Calculation Between Two Vanet Nodesmentioning
confidence: 99%
“…We prove its correctness using graph theory, and also provide both simulation and experimental results to verify the algorithm's effectiveness. In [1], only simulation results were presented.…”
mentioning
confidence: 99%