2020
DOI: 10.3390/s20195509
|View full text |Cite
|
Sign up to set email alerts
|

A Novel Weighted Clustering Algorithm Supported by a Distributed Architecture for D2D Enabled Content-Centric Networks

Abstract: Next generation cellular systems need efficient content-distribution schemes. Content-sharing via Device-to-Device (D2D) clustered networks has emerged as a popular approach for alleviating the burden on the cellular network. In this article, we utilize Content-Centric Networking and Network Virtualization to propose a distributed architecture, that supports efficient content delivery. We propose to use clustering at the user level for content-distribution. A weighted multifactor clustering algorithm is propos… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 12 publications
(9 citation statements)
references
References 69 publications
(115 reference statements)
0
8
0
Order By: Relevance
“…A distributed architecture based on content-centric networking and network virtualization was proposed in [31] to enable efficient content delivery. Clustering was introduced at the user level for content distribution, and a weighted multifactor clustering approach was presented for grouping D2D User Equipment (DUEs) with a common interest.…”
Section: Related Workmentioning
confidence: 99%
“…A distributed architecture based on content-centric networking and network virtualization was proposed in [31] to enable efficient content delivery. Clustering was introduced at the user level for content distribution, and a weighted multifactor clustering approach was presented for grouping D2D User Equipment (DUEs) with a common interest.…”
Section: Related Workmentioning
confidence: 99%
“…The details of such relevant process can be found in the clustering literature (e.g. see [25], [43] that shows network latency is not impacted significantly.…”
Section: Proposed Machine Learning Approachmentioning
confidence: 99%
“…Two of the benchmarked clustering algorithms represent state-of-theart whereas the other two represent the classical clustering techniques. The classical algorithms, K-Medoids and Density-Based Spatial Clustering of Applications With Noise (DBSCAN) [12] can be widely found in the literature whereas the work presented in [31] and [43] are recently proposed algorithms, in this document, we termed them as ''EBC'' and ''Multi-Factor'' respectively. EBC algorithm selects CHs based on the entropy of betweenness centrality, which considers social-interest and shortest path between the users.…”
Section: F Analysis Of the Performance Parametersmentioning
confidence: 99%
See 1 more Smart Citation
“…However, the issue of picking the cluster head in the model of cluster in multi‐hop is more complex when compared to one‐hop model. The grounds that are present in a multihop model necessitate that the cluster head accept an additional hub as a parent hub for interfacing with the base station 11 . Though in a solitary bounce model, it is time to decide the cluster head of each gathering that will discuss straightforwardly with the base station.…”
Section: Introductionmentioning
confidence: 99%