Evaluation of a Compound Node Selection Function for a Greedy Routing in Urban Vehicular Ad Hoc Networks

CT Ngo, QL Hoang, H Oh - Procedia computer science, 2018 - Elsevier
The greedy routing that reduces the Euclidean distance to destination continuously to the
possible maximum in every forwarding is suitable for vehicular ad hoc networks with high …
被引用次数：1 相关文章

Evaluation of a Compound Node Selection Function for a Greedy Routing in Urban Vehicular Ad Hoc Networks

CT Ngo, QL Hoang, H Oh - Procedia Computer Science, 2018 - trid.trb.org
The greedy routing that reduces the Euclidean distance to destination continuously to the
possible maximum in every forwarding is suitable for vehicular ad hoc networks with high …