2014 International Conference on Information Science, Electronics and Electrical Engineering 2014
DOI: 10.1109/infoseee.2014.6946156
|View full text |Cite
|
Sign up to set email alerts
|

Research on relay selection in device-to-device communications based on maximum capacity

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(2 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…Perfect channel estimation is assumed and multiple cellular links with a single D2D link is considered. Extending the work in [24], Chen Zhengwen et al [25] formulated relay selection as an optimization problem in which the capacity of the relay-D2D receiver link is optimized while ensuring the QoS requirement of cellular UEs. The relay selection is done jointly with resource allocation to limit interference to cellular UEs.…”
Section: Relay Selection In Relay Aided D2d Communicationmentioning
confidence: 99%
See 1 more Smart Citation
“…Perfect channel estimation is assumed and multiple cellular links with a single D2D link is considered. Extending the work in [24], Chen Zhengwen et al [25] formulated relay selection as an optimization problem in which the capacity of the relay-D2D receiver link is optimized while ensuring the QoS requirement of cellular UEs. The relay selection is done jointly with resource allocation to limit interference to cellular UEs.…”
Section: Relay Selection In Relay Aided D2d Communicationmentioning
confidence: 99%
“…a[n] = J 0 (2πf D T [n])), while ∆h(n) and ∆g(n) are the time varying component of the channel h and g and are independent and identically distributed with distribution CN (0, σ 2 i ), i = 1, 2 [36]. Estimation (that is the knowledge the Centralised Fixed [18] Resource allocation Numerical optimization using Asymptotically optimal Centralised Fixed Karush-Kuhn-Tucker [20] Matching Theory Yes Near Optimal Distributed Fixed [19] Numerical optimization using Mobile Karush-Kuhn-Tucker [25] Resource allocation and Numerical analysis No Optimal Distributed Relay selection [29] Relay selection Numerical analysis No NA Distributed [26] Performance analysis Distributed [33] Interference Management MIMO beamforming Yes Centralised Fixed [28] Relay allocation auction based bipartite matching No Optimal Centralised Mobile [27] Bipartite matching Suboptimal Centralised Fixed Hungarian algorithm receiver has) of the channels are given by h and g are complex random Gaussian processes described as, h ∼ CN (a…”
Section: A Problem Formulationmentioning
confidence: 99%