Hyppää sisältöön
    • FI
    • ENG
  • FI
  • /
  • EN
OuluREPO – Oulun yliopiston julkaisuarkisto / University of Oulu repository
Näytä viite 
  •   OuluREPO etusivu
  • Oulun yliopisto
  • Avoin saatavuus
  • Näytä viite
  •   OuluREPO etusivu
  • Oulun yliopisto
  • Avoin saatavuus
  • Näytä viite
JavaScript is disabled for your browser. Some features of this site may not work without it.

A low-complexity QoS aware resource allocation algorithm for multi pair device-to-device (D2D) communications

Bagheri, Hamidreza; Miranda Bonomi, Fernando Alberto; Katz, Marcos (2017-05-17)

 
Avaa tiedosto
nbnfi-fe2018080833528.pdf (2.070Mt)
nbnfi-fe2018080833528_meta.xml (29.76Kt)
nbnfi-fe2018080833528_solr.xml (31.67Kt)
Lataukset: 

URL:
http://doi.org/10.1002/ett.3186

Bagheri, Hamidreza
Miranda Bonomi, Fernando Alberto
Katz, Marcos
John Wiley & Sons
17.05.2017

Bagheri H, Miranda Bonomi FA, Katz M. A low‐complexity QoS aware resource allocation algorithm for multi pair device‐to‐device (D2D) communications. Trans Emerging Tel Tech. 2017;28:e3186. https://doi.org/10.1002/ett.3186

https://rightsstatements.org/vocab/InC/1.0/
© 2017 John Wiley & Sons, Ltd. This is the peer reviewed version of the following article: Bagheri H, Miranda Bonomi FA, Katz M. A low‐complexity QoS aware resource allocation algorithm for multi pair device‐to‐device (D2D) communications. Trans Emerging Tel Tech. 2017;28:e3186. https://doi.org/10.1002/ett.3186, which has been published in final form at https://doi.org/10.1002/ett.3186. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Self-Archiving.
https://rightsstatements.org/vocab/InC/1.0/
doi:https://doi.org/10.1002/ett.3186
Näytä kaikki kuvailutiedot
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi-fe2018080833528
Tiivistelmä

Abstract

Device‐to‐device (D2D) communication underlaying cellular networks is considered a promising technology to enhance network throughput, spectral efficiency, and performance of next generation networks. However, these potential gains hinge on the exploiting mechanism for resource sharing between cellular users (CUs) and D2D pairs. In this paper, we analytically formulate the problem of resource sharing as an optimization problem to maximize network throughput while guaranteeing the required quality‐of‐service (QoS) for both cellular and D2D users. We propose a low‐complexity four‐step resource allocation algorithm to address the optimization problem. We exploit a distance‐based method to derive a resource reuse candidacy graph (RCG) and three exclusive regions (ERs) to evaluate the suitability of resource sharing between each CU and D2D pair. Then, we use a paring mechanism to find the optimal set of D2D pairs for spectrum sharing with each CU to maximize network throughput. The performance of the proposed algorithm is investigated in terms of network throughput, outage probability, and computational complexity. Numerical results show that the proposed algorithm provides high throughput and spectrum utilization with low complexity while efficiently guaranteeing QoS for CUs and D2D pairs.

Kokoelmat
  • Avoin saatavuus [38840]
oulurepo@oulu.fiOulun yliopiston kirjastoOuluCRISLaturiMuuntaja
SaavutettavuusselosteTietosuojailmoitusYlläpidon kirjautuminen
 

Selaa kokoelmaa

NimekkeetTekijätJulkaisuajatAsiasanatUusimmatSivukartta

Omat tiedot

Kirjaudu sisäänRekisteröidy
oulurepo@oulu.fiOulun yliopiston kirjastoOuluCRISLaturiMuuntaja
SaavutettavuusselosteTietosuojailmoitusYlläpidon kirjautuminen