2010 2nd International Conference on Future Computer and Communication 2010
DOI: 10.1109/icfcc.2010.5497808
|View full text |Cite
|
Sign up to set email alerts
|

A VANETs routing algorithm based on Euclidean distance clustering

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

2013
2013
2024
2024

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 19 publications
(9 citation statements)
references
References 9 publications
0
9
0
Order By: Relevance
“…Clustering of GRS is done based on the distance among the GRSs. Euclidean Distance from one GRS to the other GRSs is calculated and 3 GRSs which are close to the GRS from which distance has been calculated are grouped under one cluster [28]. We have ensured that a GRS doesn't belong to two or more clusters simultaneously.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…Clustering of GRS is done based on the distance among the GRSs. Euclidean Distance from one GRS to the other GRSs is calculated and 3 GRSs which are close to the GRS from which distance has been calculated are grouped under one cluster [28]. We have ensured that a GRS doesn't belong to two or more clusters simultaneously.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…In this step, we should choose a sufficient method depending on the circumstances and constraints of the problem. For instant, some of the proposed clustering methods are suitable for crowded paths [14,15] or some other ones are convenient for a way with low density of vehicles [16]. On the next step, we should find a sufficient CH.…”
Section: Overviewmentioning
confidence: 99%
“…In approaches provided in [13]- [15], uses the location attribute for clustering the vehicles in the VANET. In [16] Syed et.…”
Section: Related Workmentioning
confidence: 99%