Resource Allocation for D2D Communications Underlaying Cellular Networks Over Nakagami-<inline-formula> <tex-math notation="LaTeX">$m$ </tex-math></inline-formula> Fading Channel
In this paper, we investigate the sum-rate maximization of cellular users (CUs) and device-to-device (D2D) pairs for the D2D communications underlaying cellular networks over the Nakagami-m fading channel. We consider a resource-abundant scenario where the number of CUs is more than that of D2D pair...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8643734/ |
id |
doaj-8dc005effa284d38ae2658290a250a49 |
---|---|
record_format |
Article |
spelling |
doaj-8dc005effa284d38ae2658290a250a492021-03-29T22:04:51ZengIEEEIEEE Access2169-35362019-01-017218162182510.1109/ACCESS.2019.28947218643734Resource Allocation for D2D Communications Underlaying Cellular Networks Over Nakagami-<inline-formula> <tex-math notation="LaTeX">$m$ </tex-math></inline-formula> Fading ChannelBaoshan Lu0https://orcid.org/0000-0002-3438-0510Shijun Lin1Jianghong Shi2Yang Wang3School of Information Science and Engineering, Xiamen University, Xiamen, ChinaSchool of Information Science and Engineering, Xiamen University, Xiamen, ChinaSchool of Information Science and Engineering, Xiamen University, Xiamen, ChinaSchool of Information Science and Engineering, Xiamen University, Xiamen, ChinaIn this paper, we investigate the sum-rate maximization of cellular users (CUs) and device-to-device (D2D) pairs for the D2D communications underlaying cellular networks over the Nakagami-m fading channel. We consider a resource-abundant scenario where the number of CUs is more than that of D2D pairs and discuss the joint optimization of signal-to-interference-plus-noise ratio (SINR) thresholds and CU-D2D pairing. We formulate the problem as mixed-integer non-linear programming, which is NP-hard in general. To solve the problem, we propose a two-step approach. First, we add virtual D2D pairs to make the number of D2D pairs equal to that of CUs and derive the near-optimal SINR threshold for each possible CU-D2D pairing by the simulated annealing algorithm. Second, the optimal CU-D2D pairing can be obtained by the Hungarian (HG) algorithm. The simulation results show that: 1) the proposed SINR policy outperforms the other policies by about 11.3%-63.4% and 2) compared with several state-of-the-art resource allocation policies, HG allocation can achieve an average sum-rate improvement of 10.9%-72.8%.https://ieeexplore.ieee.org/document/8643734/Device-to-deviceSINR optimizationresource allocationNakagami-<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">m</italic> fading channel |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Baoshan Lu Shijun Lin Jianghong Shi Yang Wang |
spellingShingle |
Baoshan Lu Shijun Lin Jianghong Shi Yang Wang Resource Allocation for D2D Communications Underlaying Cellular Networks Over Nakagami-<inline-formula> <tex-math notation="LaTeX">$m$ </tex-math></inline-formula> Fading Channel IEEE Access Device-to-device SINR optimization resource allocation Nakagami-<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">m</italic> fading channel |
author_facet |
Baoshan Lu Shijun Lin Jianghong Shi Yang Wang |
author_sort |
Baoshan Lu |
title |
Resource Allocation for D2D Communications Underlaying Cellular Networks Over Nakagami-<inline-formula> <tex-math notation="LaTeX">$m$ </tex-math></inline-formula> Fading Channel |
title_short |
Resource Allocation for D2D Communications Underlaying Cellular Networks Over Nakagami-<inline-formula> <tex-math notation="LaTeX">$m$ </tex-math></inline-formula> Fading Channel |
title_full |
Resource Allocation for D2D Communications Underlaying Cellular Networks Over Nakagami-<inline-formula> <tex-math notation="LaTeX">$m$ </tex-math></inline-formula> Fading Channel |
title_fullStr |
Resource Allocation for D2D Communications Underlaying Cellular Networks Over Nakagami-<inline-formula> <tex-math notation="LaTeX">$m$ </tex-math></inline-formula> Fading Channel |
title_full_unstemmed |
Resource Allocation for D2D Communications Underlaying Cellular Networks Over Nakagami-<inline-formula> <tex-math notation="LaTeX">$m$ </tex-math></inline-formula> Fading Channel |
title_sort |
resource allocation for d2d communications underlaying cellular networks over nakagami-<inline-formula> <tex-math notation="latex">$m$ </tex-math></inline-formula> fading channel |
publisher |
IEEE |
series |
IEEE Access |
issn |
2169-3536 |
publishDate |
2019-01-01 |
description |
In this paper, we investigate the sum-rate maximization of cellular users (CUs) and device-to-device (D2D) pairs for the D2D communications underlaying cellular networks over the Nakagami-m fading channel. We consider a resource-abundant scenario where the number of CUs is more than that of D2D pairs and discuss the joint optimization of signal-to-interference-plus-noise ratio (SINR) thresholds and CU-D2D pairing. We formulate the problem as mixed-integer non-linear programming, which is NP-hard in general. To solve the problem, we propose a two-step approach. First, we add virtual D2D pairs to make the number of D2D pairs equal to that of CUs and derive the near-optimal SINR threshold for each possible CU-D2D pairing by the simulated annealing algorithm. Second, the optimal CU-D2D pairing can be obtained by the Hungarian (HG) algorithm. The simulation results show that: 1) the proposed SINR policy outperforms the other policies by about 11.3%-63.4% and 2) compared with several state-of-the-art resource allocation policies, HG allocation can achieve an average sum-rate improvement of 10.9%-72.8%. |
topic |
Device-to-device SINR optimization resource allocation Nakagami-<italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">m</italic> fading channel |
url |
https://ieeexplore.ieee.org/document/8643734/ |
work_keys_str_mv |
AT baoshanlu resourceallocationford2dcommunicationsunderlayingcellularnetworksovernakagamiinlineformulatexmathnotationlatexmtexmathinlineformulafadingchannel AT shijunlin resourceallocationford2dcommunicationsunderlayingcellularnetworksovernakagamiinlineformulatexmathnotationlatexmtexmathinlineformulafadingchannel AT jianghongshi resourceallocationford2dcommunicationsunderlayingcellularnetworksovernakagamiinlineformulatexmathnotationlatexmtexmathinlineformulafadingchannel AT yangwang resourceallocationford2dcommunicationsunderlayingcellularnetworksovernakagamiinlineformulatexmathnotationlatexmtexmathinlineformulafadingchannel |
_version_ |
1724192291557474304 |