TY - GEN
T1 - Heuristic relay assignments for green relay assisted device to device communications
AU - Han, Tao
AU - Ansari, Nirwan
PY - 2013
Y1 - 2013
N2 - Device to device (D2D) communications is a promising concept to improve data rates and the energy efficiency of mobile networks. User devices (UEs) participated in D2D communications may increase their own data rates by retrieving the content from their neighboring peers instead of from the base stations. Meanwhile, UEs may drain their batteries while performing as content providers and transmitting the content to their peers. Increasing the data rates of D2D communications is desirable to alleviate the UEs' power consumption. In this paper, we propose a novel green relay assisted D2D communication architecture, in which the relay nodes powered by green energy are deployed to increase the data rates of D2D communications. However, achieving the optimal relay assignment for green relay assisted D2D communications is challenging. We propose a heuristic green relay assignment algorithm which maximizes the minimum data rates of the D2D pairs while considering the green load capacity of the relay nodes. We show that the proposed algorithm approximates the optimal solution with low computational complexity, and validate its performance by using simulation results.
AB - Device to device (D2D) communications is a promising concept to improve data rates and the energy efficiency of mobile networks. User devices (UEs) participated in D2D communications may increase their own data rates by retrieving the content from their neighboring peers instead of from the base stations. Meanwhile, UEs may drain their batteries while performing as content providers and transmitting the content to their peers. Increasing the data rates of D2D communications is desirable to alleviate the UEs' power consumption. In this paper, we propose a novel green relay assisted D2D communication architecture, in which the relay nodes powered by green energy are deployed to increase the data rates of D2D communications. However, achieving the optimal relay assignment for green relay assisted D2D communications is challenging. We propose a heuristic green relay assignment algorithm which maximizes the minimum data rates of the D2D pairs while considering the green load capacity of the relay nodes. We show that the proposed algorithm approximates the optimal solution with low computational complexity, and validate its performance by using simulation results.
UR - http://www.scopus.com/inward/record.url?scp=84904131752&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84904131752&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2013.6831115
DO - 10.1109/GLOCOM.2013.6831115
M3 - Conference contribution
AN - SCOPUS:84904131752
SN - 9781479913534
SN - 9781479913534
T3 - Proceedings - IEEE Global Communications Conference, GLOBECOM
SP - 468
EP - 473
BT - 2013 IEEE Global Communications Conference, GLOBECOM 2013
T2 - 2013 IEEE Global Communications Conference, GLOBECOM 2013
Y2 - 9 December 2013 through 13 December 2013
ER -