2019
DOI: 10.1109/access.2019.2918942
|View full text |Cite
|
Sign up to set email alerts
|

Matching-Coalition Based Cluster Formation for D2D Multicast Content Sharing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 17 publications
(7 citation statements)
references
References 30 publications
0
6
0
Order By: Relevance
“…It is not necessary that all the CUs find their favorite clusters. The CUs who are out of the clusters will connect the BS directly in the traditional cellular mode; they are denoted as DCUs [12].…”
Section: A the D2d Multicasting System Infrastructurementioning
confidence: 99%
See 1 more Smart Citation
“…It is not necessary that all the CUs find their favorite clusters. The CUs who are out of the clusters will connect the BS directly in the traditional cellular mode; they are denoted as DCUs [12].…”
Section: A the D2d Multicasting System Infrastructurementioning
confidence: 99%
“…Taking C 1 as an example, S 3 firstly receives the content from the BS via cellular spectrum resource, and then shares it with S 1 and S 2 simultaneously. Since the content sharing is also based on wireless transmissions, the spectrum resource should be assigned to avoid the mutual interference between the two communication types [12]. Within this interference environment, this study aims to properly and accurately allocate the cellular spectrum resource while maximizing the throughput of D2D multicasting system.…”
Section: A the D2d Multicasting System Infrastructurementioning
confidence: 99%
“…Further, social tie also means demand similarity. SU selection, user grouping, and power and channel allocation in content push service, such as in work by Tulu et al [36], Huang et al [37], Feng et al [38], and Wu et al [39]. Moreover, Bai et al [40] proposed a hybrid pull/push scheme by D2MD based on an social tie threshold.…”
Section: Related Workmentioning
confidence: 99%
“…In the many-to-one stable matching, each demander makes a proposal to its favorable potential providers, and if rejected, it will send a proposal to the next one. Thus, the complexity in the worst case is O(N d (N p − 1)) [39].…”
Section: Remark 1 (Complexity)mentioning
confidence: 99%