2019 IEEE 24th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD) 2019
DOI: 10.1109/camad.2019.8858428
|View full text |Cite
|
Sign up to set email alerts
|

On Game Theory-Based Coordination Schemes for Mobile Small Cells

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
6
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
3
1
1

Relationship

1
4

Authors

Journals

citations
Cited by 7 publications
(6 citation statements)
references
References 13 publications
0
6
0
Order By: Relevance
“…The clustering of cooperating transmission points in JT-CoMP has been identified as a significant challenge in various studies [9], [10]. As shown in our previous studies [11], [12], incautious clustering can result in reduced spectral efficiency and data rates for the UEs not in the cell edges (or nonedge UEs) as there is a high probability of committing too many resources to cell edge UEs (or edge UEs), especially if their percentage in the network is high. Also, JT-CoMP stresses the links between the BBU pool and the core network, i.e.…”
Section: Introductionmentioning
confidence: 90%
See 3 more Smart Citations
“…The clustering of cooperating transmission points in JT-CoMP has been identified as a significant challenge in various studies [9], [10]. As shown in our previous studies [11], [12], incautious clustering can result in reduced spectral efficiency and data rates for the UEs not in the cell edges (or nonedge UEs) as there is a high probability of committing too many resources to cell edge UEs (or edge UEs), especially if their percentage in the network is high. Also, JT-CoMP stresses the links between the BBU pool and the core network, i.e.…”
Section: Introductionmentioning
confidence: 90%
“…Therefore, a dynamic coalition formation algorithm needs to be constructed that can adapt to possible changes. Our proposed algorithm is a modified version of the coalition formation algorithm based on merge and split operations in [11], [12] and is divided in three stages:…”
Section: Proposed Coalition Formation Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…In a cooperative environment, it can produce the upper bound efficiency in multicasting. The future networks with small cell environment featuring device to device communication and cooperative environment of devices, try to ensure that every user in the network will be fairly provided with the required services [16]- [18]. In such a cooperative environment, as shown in fig 2, the receivers would receive partial streams from the channel and cooperate with the neighbouring nodes to create the complete information.…”
Section: Introductionmentioning
confidence: 99%