Aggregated Throughput Prediction for Collated Massive Machine-Type Communications in 5G Wireless Networks

The demand for extensive data rates in dense-traffic wireless networks has expanded and needs proper controlling schemes. The fifth generation of mobile communications (5G) will accommodate these massive communications, such as massive Machine Type Communications (mMTC), which is considered to be on...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Sensors (Basel, Switzerland) Switzerland), 2019-08, Vol.19 (17), p.3651
Hauptverfasser: Adel Aly, Ahmed, M ELAttar, Hussein, ElBadawy, Hesham, Abbas, Wael
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The demand for extensive data rates in dense-traffic wireless networks has expanded and needs proper controlling schemes. The fifth generation of mobile communications (5G) will accommodate these massive communications, such as massive Machine Type Communications (mMTC), which is considered to be one of its top services. To achieve optimal throughput, which is considered a mandatory quality of service (QoS) metric, the carrier sense multiple access (CSMA) transmission attempt rate needs optimization. As the gradient descent algorithms consume a long time to converge, an approximation technique that distributes a dense global network into local neighborhoods that are less complex than the global ones is presented in this paper. Newton's method of optimization was used to achieve fast convergence rates, thus, obtaining optimal throughput. The convergence rate depended only on the size of the local networks instead of global dense ones. Additionally, polynomial interpolation was used to estimate the average throughput of the network as a function of the number of nodes and target service rates. Three-dimensional planes of the average throughput were presented to give a profound description to network's performance. The fast convergence time of the proposed model and its lower complexity are more practical than the previous gradient descent algorithm.
ISSN:1424-8220
1424-8220
DOI:10.3390/s19173651