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.

Aggregation and resource scheduling in machine-type communication networks : a stochastic geometry approach

Alcaraz López, Onel L.; Alves, Hirley; Nardelli, Pedro H. J.; Latva-aho, Matti (2018-05-04)

 
Avaa tiedosto
nbnfi-fe2018082033785.pdf (617.5Kt)
nbnfi-fe2018082033785_meta.xml (32.32Kt)
nbnfi-fe2018082033785_solr.xml (32.84Kt)
Lataukset: 

URL:
https://doi.org/10.1109/TWC.2018.2830767

Alcaraz López, Onel L.
Alves, Hirley
Nardelli, Pedro H. J.
Latva-aho, Matti
Institute of Electrical and Electronics Engineers
04.05.2018

O. L. Alcaraz López, H. Alves, P. H. Juliano Nardelli and M. Latva-aho, "Aggregation and Resource Scheduling in Machine-Type Communication Networks: A Stochastic Geometry Approach," in IEEE Transactions on Wireless Communications, vol. 17, no. 7, pp. 4750-4765, July 2018. doi: 10.1109/TWC.2018.2830767

https://rightsstatements.org/vocab/InC/1.0/
© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
https://rightsstatements.org/vocab/InC/1.0/
doi:https://doi.org/10.1109/TWC.2018.2830767
Näytä kaikki kuvailutiedot
Julkaisun pysyvä osoite on
https://urn.fi/URN:NBN:fi-fe2018082033785
Tiivistelmä

Abstract

Data aggregation is a promising approach to enable massive machine-type communication. This paper focuses on the aggregation phase where a massive number of machine-type devices (MTDs) transmit to aggregators. By using non-orthogonal multiple access (NOMA) principles, we allow several MTDs to share the same orthogonal channel in our proposed hybrid access scheme. We develop an analytical framework based on stochastic geometry to investigate the system performance in terms of average success probability and average number of simultaneously served MTDs, under imperfect successive interference cancellation (SIC) at the aggregators, for two scheduling schemes: random resource scheduling and channel-aware resource scheduling (CRS). We identify the power constraints on the MTDs sharing the same channel to attain a fair coexistence with purely orthogonal multiple access (OMA) setups. Then, power control coefficients are found, so that these MTDs perform with similar reliability. We show that under high access demand, the hybrid scheme with CRS outperforms the OMA setup by simultaneously serving more MTDs with reduced power consumption.

Kokoelmat
  • Avoin saatavuus [38697]
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