Resource-efficient PDCCH scheduling for massive IoT in next-generation cellular networks

Abstract The exponential growth of the Internet of Things (IoT) and massive Machine-type Communications (mMTC) applications has introduced unprecedented traffic demands in next-generation (NG) cellular networks. Crucially, while a user-plane scheduler may successfully allocate Physical Resource Blocks (PRBs) on data channels (Packet Uplink Shared Channel (PUSCH)/Physical Downlink Shared Channel (PDSCH)), transmission cannot occur without successful delivery of Downlink Control Information (DCI) over the Physical Downlink Control Channel (PDCCH). Consequently, unallocated control requests render user-plane decisions void, positioning the PDCCH as a primary system bottleneck. Finite control resources and rigid mapping constraints frequently cause message blocking and resource stranding, even when data channel capacity is available. To resolve this NP-hard candidate selection problem, this paper formally defines the PDCCH Allocation Problem PDCCH-AP and introduces two Integer Linear Programming (ILP) models, Weighted Control Request Packing (W-CoRP) and Minimum Blocking Control Request Packing (MB-CoRP), to establish theoretical optimality benchmarks. We also propose Global-Aware Probabilistic Packing (eGPP), a novel heuristic that leverages probabilistic methods and multi-core processing to navigate the vast solution space and escape local optima. Extensive numerical simulations demonstrate that eGPP significantly outperforms state-of-the-art baselines by drastically reducing control channel blocking, maximizing throughput, and guaranteeing strict Quality of Service (QoS) and proportional fairness in dense NG deployments. To perform the simulations, we developed a 3rd Generation Partnership Project (3GPP) cellular network-based PDCCH simulator centered on the Medium Access Control (MAC) layer logic and scheduling performance. The simulator faithfully reproduces 3GPP-compliant control channel structures — including control resource allocation, aggregation levels, and Search Space constraints — while employing link-level physical PHY abstraction to evaluate scheduling decisions with maximum protocol fidelity and high computational efficiency.

Authors

Institutions

Publication Details

Journal
Annals of Telecommunications
Published
2026-11-14
DOI
https://doi.org/10.1007/s12243-026-01225-1
Primary Topic
IoT Networks and Protocols
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Resource-efficient PDCCH scheduling for massive IoT in next-generation cellular networks

Matheus Jun Ota, Nelson L.S. da Fonseca, Tiago P. C. de Andrade, Flávio Keidi Miyazawa
Annals of Telecommunications
IoT Networks and Protocols
article

Resource-efficient PDCCH scheduling for massive IoT in next-generation cellular networks

Matheus Jun Ota, Nelson L.S. da Fonseca, Tiago P. C. de Andrade, Flávio Keidi Miyazawa
article en

Abstract

Abstract The exponential growth of the Internet of Things (IoT) and massive Machine-type Communications (mMTC) applications has introduced unprecedented traffic demands in next-generation (NG) cellular networks. Crucially, while a user-plane scheduler may successfully allocate Physical Resource Blocks (PRBs) on data channels (Packet Uplink Shared Channel (PUSCH)/Physical Downlink Shared Channel (PDSCH)), transmission cannot occur without successful delivery of Downlink Control Information (DCI) over the Physical Downlink Control Channel (PDCCH). Consequently, unallocated control requests render user-plane decisions void, positioning the PDCCH as a primary system bottleneck. Finite control resources and rigid mapping constraints frequently cause message blocking and resource stranding, even when data channel capacity is available. To resolve this NP-hard candidate selection problem, this paper formally defines the PDCCH Allocation Problem PDCCH-AP and introduces two Integer Linear Programming (ILP) models, Weighted Control Request Packing (W-CoRP) and Minimum Blocking Control Request Packing (MB-CoRP), to establish theoretical optimality benchmarks. We also propose Global-Aware Probabilistic Packing (eGPP), a novel heuristic that leverages probabilistic methods and multi-core processing to navigate the vast solution space and escape local optima. Extensive numerical simulations demonstrate that eGPP significantly outperforms state-of-the-art baselines by drastically reducing control channel blocking, maximizing throughput, and guaranteeing strict Quality of Service (QoS) and proportional fairness in dense NG deployments. To perform the simulations, we developed a 3rd Generation Partnership Project (3GPP) cellular network-based PDCCH simulator centered on the Medium Access Control (MAC) layer logic and scheduling performance. The simulator faithfully reproduces 3GPP-compliant control channel structures — including control resource allocation, aggregation levels, and Search Space constraints — while employing link-level physical PHY abstraction to evaluate scheduling decisions with maximum protocol fidelity and high computational efficiency.

Annals of Telecommunications
University of Waterloo (CA), Universidade Estadual de Campinas (UNICAMP) (BR)
IoT Networks and Protocols
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon