2013
DOI: 10.1109/tvt.2012.2237557
|View full text |Cite
|
Sign up to set email alerts
|

Intracluster Device-to-Device Relay Algorithm With Optimal Resource Utilization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
168
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 231 publications
(168 citation statements)
references
References 21 publications
0
168
0
Order By: Relevance
“…This is the case when the destination is out range of the source [15]. This is also the case when an obstacle exists between the source and the destination [16].…”
Section: A Assumptionsmentioning
confidence: 99%
“…This is the case when the destination is out range of the source [15]. This is also the case when an obstacle exists between the source and the destination [16].…”
Section: A Assumptionsmentioning
confidence: 99%
“…As future perspectives, the JOS problem may be investigated in more challenging scenarios: when multiple D2D communications of the same or from different hotspots are allowed per PRB into the same cell or using relays (i.e., more than onehop) [23], multiple layers are required to be processed and the scheduling problem tends to be more complex. Hence, the cooperation among cells of the same site such as in Coordinated Multipoint (CoMP) systems may be considered to jointly schedule multiple D2D pairs and the cellular UE.…”
Section: Rmentioning
confidence: 99%
“…A near-optimal discovery algorithm selects the best data forwarder for receivers with poor channel quality. The authors in [31] devised an algorithm to figure out the optimal number of relays inside the cluster. The paper focuses on in-band D2D communications, such that considered in [2].…”
Section: Related Workmentioning
confidence: 99%