Show simple item record

dc.contributor.authorGharbieh, Mohammad
dc.contributor.authorBader, Ahmed
dc.contributor.authorElsawy, Hesham
dc.contributor.authorYang, Hong-Chuan
dc.contributor.authorAlouini, Mohamed-Slim
dc.contributor.authorAdinoyi, Abdulkareem
dc.date.accessioned2018-11-21T13:14:53Z
dc.date.available2018-11-21T13:14:53Z
dc.date.issued2018-10-16
dc.identifier.citationGharbieh M, Bader A, El Sawy H, Yang H-C, Alouini M-S, et al. (2018) Self-Organized Scheduling Request for Uplink 5G Networks: A D2D Clustering Approach. IEEE Transactions on Communications: 1–1. Available: http://dx.doi.org/10.1109/TCOMM.2018.2876008.
dc.identifier.issn0090-6778
dc.identifier.issn1558-0857
dc.identifier.doi10.1109/TCOMM.2018.2876008
dc.identifier.urihttp://hdl.handle.net/10754/629962
dc.description.abstractIn one of the several manifestations, the future cellular networks are required to accommodate a massive number of devices; several orders of magnitude compared to today’s networks. At the same time, the future cellular networks will have to fulfill stringent latency constraints. To that end, one problem that is posed as a potential showstopper is extreme congestion for requesting uplink scheduling over the physical random access channel (PRACH). Indeed, such congestion drags along scheduling delay problems. In this paper, the use of self-organized device-to-device (D2D) clustering is advocated for mitigating PRACH congestion. To this end, the paper proposes two D2D clustering schemes, namely; Random-Based Clustering (RBC) and Channel-Gain-Based Clustering (CGBC). Accordingly, this paper sheds light on random access within the proposed D2D clustering schemes and presents a case study based on a stochastic geometry framework. For the sake of objective evaluation, the D2D clustering is benchmarked by the conventional scheduling request procedure. Accordingly, the paper offers insights into useful scenarios that minimize the scheduling delay for each clustering scheme. Finally, the paper discusses the implementation algorithm and some potential implementation issues and remedies.
dc.description.sponsorshipThe work of the KAUST team was supported in part by STC under grant RGC/3/2374-01-01
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.relation.urlhttps://ieeexplore.ieee.org/document/8491334
dc.rights(c) 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, 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 components of this work in other works.
dc.subjectCellular networks
dc.subjectD2D clustering
dc.subjectDelays
dc.subjectDevice-to-device communication
dc.subjectDownlink
dc.subjectLong Term Evolution
dc.subjectLTE cellular networks
dc.subjectProtocols
dc.subjectrandom access
dc.subjectself-organized networks
dc.subjectstochastic geometry
dc.subjectUplink
dc.titleSelf-Organized Scheduling Request for Uplink 5G Networks: A D2D Clustering Approach
dc.typeArticle
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentElectrical Engineering Program
dc.identifier.journalIEEE Transactions on Communications
dc.eprint.versionPost-print
dc.contributor.institutionDepartment of Electrical and Computer Engineering, University of Victoria, Victoria, BC V8P 5C2, Canada.
dc.contributor.institutionInsyab Wireless Limited, 1961 Dubai-UAE.
dc.contributor.institutionElectrical Engineering Department, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia.
dc.contributor.institutionSaudi Telecom Company (STC).
dc.identifier.arxivid1810.06235
kaust.personElsawy, Hesham
kaust.personAlouini, Mohamed-Slim
refterms.dateFOA2018-11-22T07:14:36Z
dc.date.published-online2018-10-16
dc.date.published-print2019-02


Files in this item

Thumbnail
Name:
08491334.pdf
Size:
3.249Mb
Format:
PDF
Description:
Accepted Manuscript

This item appears in the following Collection(s)

Show simple item record