2017
DOI: 10.1007/978-981-10-6454-8_2
|View full text |Cite
|
Sign up to set email alerts
|

A Study of Conceptual Connected Communication Vehicular Network Using Distributed Cluster Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…Most of the research done in IoVs for resource allocation that we find in literature used the Knap Sank algorithm [29] and the greedy algorithm. ere is a large "network load" during communication that causes "traffic congestion," thus the reason for trouble in large data handling.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Most of the research done in IoVs for resource allocation that we find in literature used the Knap Sank algorithm [29] and the greedy algorithm. ere is a large "network load" during communication that causes "traffic congestion," thus the reason for trouble in large data handling.…”
Section: Related Workmentioning
confidence: 99%
“…grouping nodes in several clusters. Each cluster has two components: CH and cluster member (CM) [33]. In V2V communication, CH's role is to lead the group, and all the participants in the group are its members called CM [34].…”
Section: Clustering Vehicular Clustering Is a Technique Ofmentioning
confidence: 99%