Relay Selection Algorithms in D2D Cluster Underlaying Cellular Networks
2015 ◽
Vol 713-715
◽
pp. 1413-1418
Keyword(s):
With the development of mobile communication, D2D (Device-to-Device technology) has become a research hotpot. In this paper, we first derive the channel capacity of an n-hop link and get the formula of spectrum efficiency. And then to maximize the spectrum efficiency, we focus the algorithm of selecting the best relay for data transmission in a D2D cluster of cellular network. The algorithm proposed in this paper is an improvement of the greedy algorithm. This algorithm solves the problem that the greedy algorithm would be invalid in the case of having a big hole in the topology. At last, we could see a significant gain in terms of spectrum efficiency by using the new relay selection algorithm.
Keyword(s):
Keyword(s):
2011 ◽
Vol 33
(7)
◽
pp. 1525-1531
◽
Keyword(s):
2014 ◽
Vol 513-517
◽
pp. 3423-3428
Keyword(s):