Show simple item record

dc.contributor.authorHussien, Zaid Haj
dc.contributor.authorŞadi, Yalçın
dc.date.accessioned2020-12-20T20:08:28Z
dc.date.available2020-12-20T20:08:28Z
dc.date.issued2018
dc.identifier.issn2165-0608
dc.identifier.urihttps://hdl.handle.net/20.500.12469/3615
dc.description.abstractThe fast growth of machine-to-machine (M2M) communications in cellular networks brings the challenge of satisfying diverse Quality-of-Service (QoS) requirements of massive number of machine type communications (MTC) devices with limited radio resources. In this study, we first introduce the minimum bandwidth resource allocation problem for M2M communications in 5G and beyond cellular networks. NP-hardness of the problem is proven. Then, we propose a fast and efficient polynomial-time algorithm exploiting the periodicity of the MTC traffic based on persistent resource allocation. We prove a mathematical performance result for this algorithm considering a special case of the problem. Simulations show that the proposed algorithm outperforms the previously proposed clustering based radio resource algorithm significantly and performs very close to optimal.en_US
dc.language.isoEnglishen_US
dc.publisherIEEEen_US
dc.subjectMachine-to-machine communicationsen_US
dc.subject5G cellular networksen_US
dc.subjectResource Allocationen_US
dc.titleFlexible Radio Resource Allocation for Machine Type Communications in 5G Cellular Networksen_US
dc.typeProceedings Paperen_US
dc.relation.journal2018 26th Signal Processing And Communications Applications Conference (Siu)en_US
dc.identifier.wosWOS:000511448500693en_US
dc.contributor.khasauthorHussien, Zaid Hajen_US
dc.contributor.khasauthorŞadi, Yalçınen_US


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record