TY - JOUR
T1 - Self-Organized Scheduling Request for Uplink 5G Networks: A D2D Clustering Approach
AU - Gharbieh, Mohammad
AU - Bader, Ahmed
AU - Elsawy, Hesham
AU - Yang, Hong-Chuan
AU - Alouini, Mohamed-Slim
AU - Adinoyi, Abdulkareem
N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledgements: The work of the KAUST team was supported in part by STC under grant RGC/3/2374-01-01
PY - 2018/10/16
Y1 - 2018/10/16
N2 - In 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.
AB - In 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.
UR - http://hdl.handle.net/10754/629962
UR - https://ieeexplore.ieee.org/document/8491334
UR - http://www.scopus.com/inward/record.url?scp=85055039795&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2018.2876008
DO - 10.1109/TCOMM.2018.2876008
M3 - Article
SN - 0090-6778
VL - 67
SP - 1197
EP - 1209
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 2
ER -