TY - GEN
T1 - Joint mode selection and resource allocation for D2D communications under queueing constraints
AU - Li, Yi
AU - Gursoy, M. Cenk
AU - Velipasalar, Senem
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/9/6
Y1 - 2016/9/6
N2 - Device-to-device (D2D) communication underlaid with cellular networks is a new paradigm, proposed to enhance the performance of cellular networks. By allowing a pair of D2D users to communicate directly and share the same spectral resources with the cellular users, D2D communication can achieve higher spectral efficiency, improve the energy efficiency, and lower the traffic delay. In this paper, we propose a novel channel matching algorithm for joint mode selection and channel allocation with the goal of maximizing the system throughput under statistical queueing constraints. Seven possible modes are considered, namely the D2D cellular mode, D2D dedicated mode, uplink dedicated mode, downlink dedicated mode, uplink reuse mode, downlink reuse mode, and D2D reuse mode. Using tools from stochastic network calculus, the throughput is characterized by determining the effective capacity. We formulate the channel allocation problem as a maximum-weight matching problem, which can be solved by employing the Hungarian algorithm. Via simulation results, we verify the performance improvements achieved by our proposed matching algorithm.
AB - Device-to-device (D2D) communication underlaid with cellular networks is a new paradigm, proposed to enhance the performance of cellular networks. By allowing a pair of D2D users to communicate directly and share the same spectral resources with the cellular users, D2D communication can achieve higher spectral efficiency, improve the energy efficiency, and lower the traffic delay. In this paper, we propose a novel channel matching algorithm for joint mode selection and channel allocation with the goal of maximizing the system throughput under statistical queueing constraints. Seven possible modes are considered, namely the D2D cellular mode, D2D dedicated mode, uplink dedicated mode, downlink dedicated mode, uplink reuse mode, downlink reuse mode, and D2D reuse mode. Using tools from stochastic network calculus, the throughput is characterized by determining the effective capacity. We formulate the channel allocation problem as a maximum-weight matching problem, which can be solved by employing the Hungarian algorithm. Via simulation results, we verify the performance improvements achieved by our proposed matching algorithm.
UR - http://www.scopus.com/inward/record.url?scp=84988892452&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84988892452&partnerID=8YFLogxK
U2 - 10.1109/INFCOMW.2016.7562126
DO - 10.1109/INFCOMW.2016.7562126
M3 - Conference contribution
AN - SCOPUS:84988892452
T3 - Proceedings - IEEE INFOCOM
SP - 490
EP - 495
BT - 2016 IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 35th IEEE Conference on Computer Communications Workshops, INFOCOM WKSHPS 2016
Y2 - 10 April 2016 through 14 April 2016
ER -