scieee AI-readable full text Open interactive document viewer

Analytical Modelling of NB-IoT Uplink Resource Split Between NPRACH and NPUSCH for Device Density Optimization

Hussein, N. Fadhel

Abstract

Narrowband Internet of Things (NB-IoT) networks must support large numbers of sporadically active devices within a narrow uplink bandwidth. A key configuration choice is the split between random-access resources, Narrowband Physical Random Access Channel (NPRACH), and data-channel resources, Narrowband Physical Uplink Shared Channel (NPUSCH), which we capture with a single parameter, , defined as the fraction of uplink resources reserved for NPRACH. We develop a stylized analytical model that couples a multichannel slotted-ALOHA description of NPRACH with a simple NPUSCH capacity model and use it to characterize how the parameter affects random-access collisions, data-channel utilization, and end-to-end reliability. For representative single-cell parameters, the analysis indicates that very small values of , for example, below about 0.10, drive NPRACH into an overloaded regime with per-attempt collision probabilities exceeding 99 percent, while an intermediate range between 0.25 and 0.40 yields a stable operating region. Packet-level simulations for three traffic profiles, 30-byte, 150-byte, and 450-byte packets, confirm these trends and quantify their impact, relative to baseline configurations resembling typical deployments, tuning within the stable region increases the maximum supportable device density by approximately 61 to 238 percent, about 1.6 to 3.4 times, at a 99 percent packet-delivery target. These gains are achieved purely through software-level reconfiguration of the NPRACH/NPUSCH split, without changes to hardware or spectrum.

Full text

Engineering and Technology Journal e-ISSN: 2456-3358 Volume 10 Issue 12 December-2025, Page No.-8241-8246 DOI: 10.47191/etj/v10i12.24, I.F. โ€“ 8.482 ยฉ 2025, ETJ 8241 ETJ Volume 10 Issue 12 December 2025, Hussein N. Fadhel Analytical Modelling of NB-IoT Uplink Resource Split Between NPRACH and NPUSCH for Device Density Optimization Hussein N. Fadhel Northern Technical University, Iraq, Kirkuk 36001 ABSTRACT: Narrowband Internet of Things (NB-IoT) networks must support large numbers of sporadically active devices within a narrow uplink bandwidth. A key configuration choice is the split between random-access resources, Narrowband Physical Random Access Channel (NPRACH), and data-channel resources, Narrowband Physical Uplink Shared Channel (NPUSCH), which we capture with a single parameter, ๐‘ŸUL, defined as the fraction of uplink resources reserved for NPRACH. We develop a stylized analytical model that couples a multichannel slotted-ALOHA description of NPRACH with a simple NPUSCH capacity model and use it to characterize how the parameter ๐‘ŸUL affects random-access collisions, data-channel utilization, and end-to-end reliability. For representative single-cell parameters, the analysis indicates that very small values of ๐‘ŸUL, for example, below about 0.10, drive NPRACH into an overloaded regime with per-attempt collision probabilities exceeding 99 percent, while an intermediate range between 0.25 and 0.40 yields a stable operating region. Packet-level simulations for three traffic profiles, 30-byte, 150-byte, and 450-byte packets, confirm these trends and quantify their impact, relative to baseline configurations resembling typical deployments, tuning ๐‘ŸUL within the stable region increases the maximum supportable device density by approximately 61 to 238 percent, about 1.6 to 3.4 times, at a 99 percent packet-delivery target. These gains are achieved purely through software-level reconfiguration of the NPRACH/NPUSCH split, without changes to hardware or spectrum. KEYWORDS: Narrowband IoT, resource allocation, device density optimization, collision analysis, NPRACH, NPUSCH, massive IoT. I. INTRODUCTION The Internet of Things (IoT) is expected to connect tens of billions of devices, many of which generate small, sporadic uplink messages that must be delivered reliably and at low cost. Narrowband IoT (NB-IoT) is the 3GPP cellular technology designed to meet this demand, offering wide-area coverage, extended battery life, and low device complexity by operating in only 180 kHz of spectrum [1]-[3]. Despite rapid standardization and commercial deployment, both analytical studies and measurement driven evaluations indicate that existing NB-IoT networks can operate well below their theoretical capacity when the uplink access procedure and resource allocation are not carefully tuned [3]- [6]. A central design challenge in NB-IoT is the allocation of uplink resources between random access and data transmission. In the uplink, the Narrowband Physical Random Access Channel (NPRACH) is used for contentionbased access and initial synchronization, while the Narrowband Physical Uplink Shared Channel (NPUSCH) carries user data [1], [7]. We focus on a single dimensionless parameter, denoted by ๐‘ŸUL, that captures this allocation, where, ๐‘ŸUL is the fraction of uplink resources devoted to NPRACH, with the remaining fraction 1โˆ’๐‘ŸUL available for NPUSCH. This abstraction is in line with recent work on uplink resource partitioning and NPRACH-aware allocation schemes [8], [9]. This single factor induces a fundamental trade-off. If ๐‘ŸUL is too small, NPRACH opportunities are too sparse to accommodate the offered traffic, leading to heavy randomaccess contention, frequent preamble collisions, and access failures. If ๐‘ŸUL is too large, excessive resources are reserved for NPRACH, starving NPUSCH and causing congestion, delays, or drops on the data channel. Detailed models of the NB-IoT random-access procedure including stochasticgeometry and Markov-chain analyses with coverageenhancement groups [10], [11], packet-level evaluations of dense public and private deployments [4], [12], and survey work on congestion management [5], [13] all point to random access as a primary bottleneck in dense NB-IoT networks. At the same time, operators often configure NPRACH and NPUSCH parameters according to spectrum constraints and qualitative rules of thumb rather than explicit end-to-end optimization, leaving room for improvement in how ๐‘ŸUL is chosen in practice [3]-[6]. Recent work has explored data-driven and reinforcementlearning-based approaches to tune NB-IoT parameters adaptively, including random access configuration, access barring, scheduling policies, and uplink resource allocation [4]-[16]. These methods are promising for complex, time- โ€œAnalytical Modelling of NB-IoT Uplink Resource Split Between NPRACH and NPUSCH for Device Density Optimizationโ€ 8242 ETJ Volume 10 Issue 12 December 2025, Hussein N. Fadhel varying environments, and surveys of Random Access (RA) congestion-control schemes increasingly emphasize learningbased adaptations [13]. However, such approaches offer limited analytical insight into the underlying capacity limits and failure mechanisms. In particular, there is comparatively little work that couples a tractable random-access model with an explicit representation of NPUSCH utilization, so as to expose simple operating regions and failure boundaries as functions of ๐‘ŸUL and the traffic load, and to provide closedform design rules that can guide both static configuration and adaptive control. In this paper, we develop a stylized but transparent analytical framework that links NB-IoT random access and datachannel utilization through a multichannel slotted-ALOHA model of NPRACH. We treat the random-access stage as a slotted-ALOHA system with multiple orthogonal preambles, derive the load and collision probability as functions of ๐‘ŸUL and the arrival rate, and couple the resulting successful-access rate to a simple model of NPUSCH capacity that captures the impact of packet size and coverage-enhancement level. The framework focuses on a single NB-IoT cell with homogeneous Poisson arrivals, a fixed coverageenhancement mix, and a heuristic mapping from NPUSCH utilization to congestion probability. These assumptions enable closed-form expressions while intentionally abstracting away backoff dynamics, access class barring, and multi-cell effects. Within this setting, we study how to choose ๐‘ŸUL so as to maximize the supported device density under a target reliability constraint. Our contributions are threefold. First, we formulate an analytical model that couples NPRACH contention and NPUSCH utilization through a single control parameter ๐‘ŸUL, making the main NB-IoT uplink bottlenecks explicit in terms of random-access load, collision probability, and datachannel occupancy. Second, we use this model to delineate qualitative operating regions, including collapse, congestionlimited, and stable regimes, in the (๐‘ŸUL, ฮป) plane, where ๐œ† denotes the aggregate arrival rate of devices (devices/s), and to identify a practical range of ๐‘ŸUL values that keeps the system within the stable region under the assumed traffic model. Third, we validate the analytical predictions with packet-level simulations and quantify the achievable devicedensity improvements relative to typical baseline configurations, observing gains between approximately 61% and 238% (1.6โ€“3.4 times more devices per km2) across three representative traffic profiles. We translate these results into simple design guidelines that allow network operators to treat ๐‘ŸUL as an explicit tuning factor and to complement more detailed optimization and learning-based control schemes [14]-[16]. The rest of this paper is organized as follows. Section II presents the system model and mathematical analysis framework, deriving the impact of ๐‘ŸUL on random access and NPUSCH utilization. Section III validates the analysis with packet-level simulations and discusses the resulting device density gains. Section IV concludes the paper and outlines directions for future work, including extensions to multi-cell scenarios and adaptive tuning of ๐‘ŸUL and related NB-IoT configuration parameters. II. SYSTEM MODEL AND ANALYTICAL FRAMEWORK A. System Model, Assumptions, and Metrics We consider a single NB-IoT cell in which devices generate uplink reports according to a homogeneous Poisson process with rate ๐œ† (devices/s). The uplink follows the tandem structure of NPRACH for initial access and NPUSC for data transmission. The resource-splitting parameter ๐‘ŸUL governs how much of the uplink resource budget is devoted to NPRACH versus NPUSCH. We define: ๐‘Ÿ๐‘ˆ๐ฟ =๐‘๐‘ƒ๐‘…๐ด๐ถ๐ป ๐‘Ÿ๐‘’๐‘ ๐‘œ๐‘ข๐‘Ÿ๐‘๐‘’๐‘  (๐‘๐‘ƒ๐‘…๐ด๐ถ๐ป ๐‘Ÿ๐‘’๐‘ ๐‘œ๐‘ข๐‘Ÿ๐‘๐‘’๐‘  + ๐‘๐‘ƒ๐‘ˆ๐‘†๐ถ๐ป ๐‘Ÿ๐‘’๐‘ ๐‘œ๐‘ข๐‘Ÿ๐‘๐‘’๐‘ ),(1) so that ๐‘Ÿ๐‘ˆ๐ฟ is the fraction of uplink resources reserved for NPRACH, and the remaining fraction 1โˆ’๐‘ŸUL is available for NPUSCH. Increasing ๐‘ŸUL makes random access more frequent but reduces the capacity of NPUSCH. Decreasing ๐‘ŸUL frees resources for NPUSCH but increases contention on NPRACH. To keep the analysis tractable and aligned with our goal of obtaining closed-form expressions, we adopt a stylized model with the following simplifying assumptions, (i) a single cell with no inter-cell interference and homogeneous Poisson arrivals, (ii) a multichannel slotted-ALOHA description of NPRACH with ๐‘š= 48 orthogonal preambles and independent preamble choices, without modelling detailed backoff dynamics or access-class barring, (iii) an NPUSCH service model based on a per-second Resource-Unit (RU) budget and an aggregate utilization metric, rather than a detailed scheduler, and (iv) a fixed distribution over Coverage-Enhancement (CE) levels and a heuristic mapping from NPUSCH utilization to congestion probability. These assumptions intentionally abstract away fine-grained protocol features in exchange for analytical transparency. Within this framework, our primary performance metric is the maximum device density (devices/km2) that can be supported while meeting a target end-to-end success probability ๐‘ƒsucc โ‰ฅ ๐‘ƒtar (with ๐‘ƒtar = 0.99 in our examples). At the analytical level, we track three quantities: (i) the random access collision probability ๐‘ƒcoll on NPRACH, (ii) the congestion probability ๐‘ƒcong on NPUSCH, and (iii) the combined per-attempt failure probability ๐‘ƒfailure resulting from both contention and congestion. B. Random-Access Analysis via Multichannel Slotted ALOHA In the NB-IoT configuration considered, each Random Access Opportunity (RAO) offers ๐‘š = 48 orthogonal โ€œAnalytical Modelling of NB-IoT Uplink Resource Split Between NPRACH and NPUSCH for Device Density Optimizationโ€ 8243 ETJ Volume 10 Issue 12 December 2025, Hussein N. Fadhel preambles. The nominal RAO period for the baseline configuration is ๐›ฟRAO. Allocating a fraction ๐‘ŸUL of the uplink resource budget to NPRACH effectively scales the RAO density, yielding ๐‘‡RAO =๐›ฟRAO ๐‘ŸUL . (2) Smaller values of ๐‘ŸUL correspond to sparser RAOs and thus higher contention. Let ๐œ† be the aggregate arrival rate of new reports (devices/s). Under the slotted-ALOHA model with independent choices of preamble and RAO, the expected load per preamble in each RAO is ๐บ = ๐œ†๐›ฟRAO ๐‘ŸUL , (3) which is dimensionless and can be interpreted as the average number of contending devices per preamble per RAO. Under the standard independence assumption, the probability that a given preamble experiences no collision, i.e., exactly one device selects it, is ๐บ๐‘’โˆ’๐บ, and the collision probability experienced by an individual device is ๐‘ƒcoll = 1โˆ’ ๐‘’โˆ’๐บ, ๐‘†(๐บ)= ๐บ๐‘’โˆ’๐บ, (4) where ๐‘†(๐บ) is the normalized slotted-ALOHA throughput. As ๐บ increases beyond 1, the throughput saturates and then decreases, while ๐‘ƒcoll approaches 1, indicating an overloaded random-access channel. For a representative configuration with ฮป= 50 devices/s, ๐‘š = 48 preambles, and ๐›ฟRAO = 0.64 s, low values of ๐‘ŸUL correspond to large ๐บ and near-certain collisions. For example, at ๐‘ŸUL = 0.05 we obtain ๐บ โ‰ˆ13.33 and ๐‘ƒcoll > 0.999, effectively making random access unusable. At ๐‘ŸUL= 0.30, ๐บ โ‰ˆ2.22 and ๐‘ƒcoll โ‰ˆ0.89, which is still high at the per attempt level but lies near the high-efficiency region of the slotted-ALOHA curve. TABLE I RANDOM-ACCESS OPERATING POINT VERSUS ๐’“UL (REPRESENTATIVE PARAMETERS) ๐’“UL Load ๐‘ฎ ๐‘ทcoll ๐‘บ(๐‘ฎ) Zone (Interpretive) 0.05 13.33 >99.9% 0.000 Collapse 0.10 6.67 99.9% 0.008 Collapse / Critical 0.15 4.44 98.8% 0.053 High-load 0.20 3.33 96.4% 0.119 Marginal 0.25 2.67 93.1% 0.184 Stable (Conservative) 0.30 2.22 89.1% 0.245 Stable 0.35 1.90 85.0% 0.286 Stable / Recommended 0.40 1.67 81.2% 0.313 Stable / Recommended 0.45 1.48 77.3% 0.329 Stable 0.50 1.33 73.6% 0.353 High-efficiency Table I summarizes the random-access operating point for a range of ๐‘ŸUL values under this parameter set. The โ€œCollapseโ€ zone corresponds to very high collision probability and negligible throughput. The โ€œStableโ€ zone combines high but manageable collision probabilities with the high-throughput region of the slotted-ALOHA curve. These qualitative zones will later be compared against simulation results in Section III. The table corresponds to the parameters ๐œ† = 50 devices/s, ๐›ฟRAO = 0.64 s, ๐‘š= 48. ๐‘†(๐บ) = ๐บ๐‘’โˆ’๐บ is the normalized slotted-ALOHA throughput. Zone labels are qualitative and specific to this parameter set. They are used to interpret operating regions rather than to claim universal thresholds. C. Data Transmission Phase and NPUSCH Utilization Devices that successfully complete NPRACH proceed to NPUSCH for data transmission. Under the slotted-ALOHA model, the aggregate rate of successful random-access attempts is ๐œ†๐‘  = ๐‘š ๐บ๐‘’โˆ’๐บ ๐‘‡๐‘…๐ด๐‘‚ = ๐‘š ๐‘†(๐บ) ๐‘‡๐‘…๐ด๐‘‚ [devices/s], (5) where ๐บ and ๐‘‡๐‘…๐ด๐‘‚ are given by (2)โ€“(3). This is the arrival rate into the NPUSCH service system. Each device carries a packet of size ๐ฟ bytes and belongs to a coverage-enhancement level CE โˆˆ {0,1,2}. In line with NBIoT transport block sizing, we approximate the number of resource units (RUs) required for a packet as ๐‘RU = โŒˆ๐ฟ 32โŒ‰๐‘…CE [RUs/packet], (6) where ๐‘…CE โˆˆ {1,8,64} for CE โˆˆ {0,1,2}, respectively. Let P(CE = ๐‘–) denote the fraction of devices in each CE level. In our numerical examples we use a fixed distribution representative of urban deployments, leading to ๐ธ[๐‘๐‘…๐‘ˆ] = โŒˆ๐ฟ 32โŒ‰ โˆ‘P(CE = ๐‘–)๐‘…CE ๐‘– =๐‘–. (7) The total NPUSCH RU budget per second is denoted by ๐‘total. Allocating a fraction ๐‘ŸUL of the uplink to NPRACH leaves ๐ถNPUSCH = ๐‘total(1โˆ’๐‘ŸUL) [RUs /s] (8) for data transmission. The resulting NPUSCH utilization is ๐œŒNPUSCH = ๐œ†๐‘ ๐ธ[๐‘RU] ๐ถNPUSCH . (9) This quantity captures how close NPUSCH is to saturation as a function of ๐‘ŸUL, the arrival rate, and the traffic mix. D. End-to-End Failure Probability and Optimization The end-to-end per-attempt failure probability combines contention failures on NPRACH and congestion failures on NPUSCH. We approximate it as ๐‘ƒfailure = ๐‘ƒcoll + (1โˆ’๐‘ƒcoll)๐‘ƒcong, (10) โ€œAnalytical Modelling of NB-IoT Uplink Resource Split Between NPRACH and NPUSCH for Device Density Optimizationโ€ 8244 ETJ Volume 10 Issue 12 December 2025, Hussein N. Fadhel where ๐‘ƒcoll is given by (4) and ๐‘ƒcong is the probability that a device that has gained access to NPUSCH fails to be served within the latency or buffer constraints of the application. In principle, ๐‘ƒcong could be derived from a detailed queueing model of the NPUSCH scheduler. To keep the framework simple and analytically transparent, we instead adopt a heuristic mapping from utilization to congestion: ๐‘ƒcong =max {0,๐œŒNPUSCH โˆ’0.8 0.2 }, (11) so that ๐‘ƒcong= 0 for ๐œŒNPUSCH โ‰ค0.8 and increases linearly to 1 as ๐œŒNPUSCH approaches 1. The threshold value 0.8 is chosen to reflect the utilization range where queueing delays begin to grow rapidly in M/D/1-type systems. The linear mapping itself is a modeling choice that is later calibrated against simulation in Section III. Equations (4)โ€“(11) together define ๐‘ƒfailure as a function of ๐‘ŸUL, the arrival rate, and the traffic mix. In practice, NB-IoT devices are allowed multiple random-access attempts. Our simulator implements these attempts and their timers explicitly, while the analytical model uses ๐‘ƒfailure as a firstorder approximation of the per-attempt failure probability. The reliability constraint ๐‘ƒsucc = 1 โˆ’ ๐‘ƒfailure โ‰ฅ๐‘ƒtar, combined with a traffic model and a deployment geometry, yields a maximum sustainable device density for each value of ๐‘ŸUL. Rather than claiming universal boundaries, we interpret the results of this analytical model as a way to delineate qualitative operating regions in the (๐‘ŸUL, ฮป) plane and to identify practical ranges of ๐‘ŸUL that keep the system out of collapse and congestion-dominated regimes for the scenarios of interest. These regions are compared against packet-level simulation results in Section III, which both validate the analytical trends and quantify how they translate into concrete device-density gains. III. VALIDATION AND RESULTS A. Simulation Setup We validate the analytical framework of Section II through a discrete-event NB-IoT uplink simulator that implements the NPRACH and NPUSCH procedures, the coverage enhancement levels, and the retransmission rules defined in the 3GPP specifications [1], [4], [7]. New reports are generated according to a homogeneous Poisson process with rate ฮป and immediately trigger a random-access attempt on NPRACH. Collisions are resolved exactly as in the analytical model. In each RAO, devices choose among the ๐‘š= 48 orthogonal preambles uniformly at random; an NPRACH attempt succeeds if and only if it is the unique use of its preamble in that RAO. Upon successful random access, devices enter the NPUSCH scheduler, which allocates RUs according to the coverage-enhancement level and packet size. The simulator tracks both contention failures on NPRACH and congestion-induced failures on NPUSCH, so that the measured metrics are directly comparable with those defined in the mathematical analysis. Unless stated otherwise, we consider a single-cell deployment with ๐œ† = 50 devices/s, ๐›ฟRAO = 0.64 s, and an RU budget consistent with a single-carrier NB-IoT configuration. The coverage-enhancement distribution is fixed to the representative mix used in the analytical model, yielding the same mean RU requirement ๐ธ[๐‘RU]. Each configuration is simulated for 400 s, and multiple independent runs are averaged so that 95% confidence intervals on ๐‘ƒsucc are within a few percentage points and are omitted from the plots for clarity. A packet is declared successful if it is delivered within at most ๐ดmax random-access attempts and without exceeding an NPUSCH delay budget of 10 s, otherwise it is counted as a failure. The resulting overall success probability ๐‘ƒsucc is compared against the reliability target ๐‘ƒtar (here, ๐‘ƒtar = 0.99) when computing the maximum sustainable device density. B. Optimization Results Table II summarizes the network capacity obtained from simulation for three packet sizes (30 B, 150 B, and 450 B) and several values of ๐‘ŸUL. For each packet size we select a baseline configuration that is representative of typical deployments (for example, ๐‘ŸUL= 0.15 for 30 B and 150 B traffic and ๐‘ŸUL = 0.20 for 450 B), and we report the corresponding device density (devices/km2) at which the endto-end success probability ๐‘ƒsucc remains above 0.99. For all configurations, the table reports the device density and the per-attempt collision rate measured from simulation, together with the relative improvement with respect to the baseline configuration. TABLE II: COMPREHENSIVEDEVICEDENSITYOPTIMIZATIONRESULTS Packet Size ๐’“UL Device Density (devices/k m2) Improveme nt vs. baseline Collision Rate 30 B 0.15 485 baseline 99% 0.25 834 +72% 93% 0.35 1,120 +131% 82% 0.40 1,316 +171% 80% 150 B 0.15 331 baseline 99% 0.20 634 +91% 96% 0.30 960 +190% 89% 0.35 1,120 +238% 82% 450 B 0.20 254 baseline 96% 0.30 409 +61% 89% 0.40 485 +91% 80% 0.45 520 +105% 78% The table reveals three consistent patterns. First, moving from the baseline configuration to the optimized ๐‘ŸUL often approximately doubles or more than doubles the sustainable โ€œAnalytical Modelling of NB-IoT Uplink Resource Split Between NPRACH and NPUSCH for Device Density Optimizationโ€ 8245 ETJ Volume 10 Issue 12 December 2025, Hussein N. Fadhel device density. The improvements range from +61% (large packets) to +238% (mixed traffic) while still satisfying the same reliability target. Second, although the optimized points operate with very high random-access collision rates, between 78% and 93%, the overall success probability remains above 0.99 because devices are allowed multiple access attempts and NPUSCH remains uncongested. Third, the optimal ๐‘ŸUL shifts gradually with packet size, smaller packets favor larger values of๐‘ŸUL, whereas large packets benefit from leaving more resources for NPUSCH. These shifts are consistent with the analytical trade-off between collision probability and NPUSCH utilization derived in Section II. C. Collision Zones and Capacity Optimization To quantify how the analytical collision regions translate into practice, Figure 1 plots the per-attempt collision probability as a function of ๐‘ŸUL for the representative parameter set. The solid curve shows the multichannel slotted-ALOHA prediction from (4), and the markers overlay simulation results. Figure 1. Random-access collision probability as a function of ๐’“UL for the representative configuration (๐€ = ๐Ÿ“๐ŸŽ devices/s, ๐œนRAO = 0.64 s, ๐’Ž= ๐Ÿ’๐Ÿ–). The curve shows the multichannel slotted-ALOHA prediction (4), and markers show simulation results. Shaded regions illustrate collapse (red), marginal (yellow), and stable (green) operating zones. The background shading highlights three operating zones: a red โ€œcollapseโ€ zone for ๐‘ŸUL <0.10, where ๐‘ƒcoll >99% and throughput is negligible. A yellow marginal zone for 0.10โ‰ค ๐‘ŸUL <0.25 where collisions remain above 93%, and a green stable zone for 0.25โ‰ค๐‘ŸUL โ‰ค0.40 where collisions are still high but random access remains feasible. Simulation points track the analytical curve closely, typically within a few percentage points, supporting the collision component of the mathematical model. Figure 2 complements the table by plotting the sustainable device density as a function of ๐‘ŸUL for each packet size. For each configuration, the device density corresponds to the maximum value at which the simulated end-to-end success probability satisfies ๐‘ƒsucc โ‰ฅ0.99. The shaded vertical band marks the practical optimization zone 0.25โ‰ค๐‘ŸUL โ‰ค0.40, where all three traffic profiles achieve near-maximal capacity while remaining in the stable collision region. The annotations highlight, for example, the +171% gain for 30 B packets at ๐‘ŸUL = 0.40 and the +238% gain for 150 B packets at ๐‘ŸUL = 0.35, relative to their respective baselines in Table II. Figure 2. Network capacity (devices/km2) versus ๐’“UL for three packet sizes. Each point gives the maximum sustainable device density for which ๐‘ทsucc โ‰ฅ 0.99in simulation. The shaded region indicates the practical optimization zone where all traffic profiles achieve nearmaximal capacity while remaining in the stable collision region. Across the configurations in Table II and Figure 2, the practical range 0.25โ‰ค๐‘ŸUL โ‰ค0.40 consistently delivers large gains while keeping the system within the stable collision region and below the NPUSCH congestion threshold. The exact optimum depends on the traffic mix and packet size, but the overall pattern is robust: values of ๐‘ŸUL around 0.30โ€“0.35 strike a good compromise between collision probability and data-channel utilization. The simulations therefore corroborate the analytical trade-offs derived in Section II and indicate that many NB-IoT deployments can significantly increase device density through software-level reconfiguration of the NPRACH/NPUSCH resource split, without changing hardware or spectrum. CONCLUSION This paper presented an analytical framework and supporting simulation study for understanding how the NB-IoT uplink resource split between NPRACH and NPUSCH, captured by the parameter ๐‘ŸUL, affects random-access collisions, datachannel utilization, and end-to-end reliability. By modeling NPRACH as a multichannel slotted-ALOHA system and NPUSCH as a resource-unit budget driven by the successful random-access rate, we derived closed-form expressions for the collision probability, NPUSCH utilization, and a firstorder approximation of the overall failure probability as functions of ๐‘ŸUL and the offered load. Under a single-cell setting with homogeneous Poisson arrivals, a fixed coverage-enhancement mix, and a heuristic mapping from utilization to congestion probability, the analysis delineates qualitative operating regions in the (๐‘ŸUL, ฮป) plane. Low values of ๐‘ŸUL lead to random-access overload, โ€œAnalytical Modelling of NB-IoT Uplink Resource Split Between NPRACH and NPUSCH for Device Density Optimizationโ€ 8246 ETJ Volume 10 Issue 12 December 2025, Hussein N. Fadhel high values of ๐‘ŸUL limit NPUSCH, and an intermediate range around 0.25 โ‰ค ๐‘ŸUL โ‰ค 0.40 yields a stable region where random access remains feasible and NPUSCH utilization stays below the congestion threshold for the traffic profiles we consider. Packet-level simulations confirm these trends and quantify their impact: relative to baseline configurations resembling typical deployments, tuning ๐‘ŸUL within this range supports approximately 61% to 238% more devices per km2 (about 1.6โ€“3.4 times) while maintaining ๐‘ƒsucc โ‰ฅ0.99, despite high per attempt collision probabilities. The framework is intentionally simplified: it does not model dynamic access barring, detailed backoff behavior, or multicell interference, and it treats the mapping from utilization to congestion in a heuristic way. Within these limitations, the results indicate that revisiting the NPRACH/NPUSCH split can yield substantial gains using only software-level reconfiguration. Future work includes extending the model to multi-cell scenarios and more detailed schedulers, and combining the analytical insights with optimization or learning-based control schemes for closed-loop adjustment of ๐‘ŸUL and related NB-IoT parameters. REFERENCES 1. Y . P. E. Wang, X. Lin, A. Adhikary, A. Gr ยจovlen, Y . Sui, Y . Blankenship, J. Bergman, and H. S. Razaghi, โ€œA primer on 3GPP narrowband Internet of Things (NB-IoT),โ€IEEE Communications Magazine, vol. 55, no. 3, pp. 117โ€“123, Mar. 2017. 2. C. B. Mwakwata, H. Malik, M. Mahtab Alam, Y . Le Moullec, S. P ยจarand, and S. Mumtaz, โ€œNarrowband Internet of Things (NB-IoT): From physical (PHY) and media access control (MAC) layers perspectives,โ€ Sensors, vol. 19, no. 11, art. 2613, Jun. 2019. 3. E. Rastogi, N. Saxena, A. Roy, and D. R. Shin, โ€œNarrowband Internet of Things: A comprehensive study,โ€Computer Networks, vol. 173, art. 107209, May 2020. 4. S. Martiradonna, G. Piro, and G. Boggia, โ€œOn the evaluation of the NB-IoT random access procedure in monitoring infrastructures,โ€ Sensors, vol. 19, no. 14, art. 3237, Jul. 2019. 5. E. M. Migabo, K. Djouani, and A. M. Kurien, โ€œThe narrowband Internet of Things (NB-IoT) resources management performance: State of art, challenges, and opportunities,โ€ IEEE Access, vol. 8, pp. 97 658โ€“ 97 675, 2020. 6. B. Martinez, F. Adelantado, A. Bartoli, and X. Vilajosana, โ€œExploring the performance boundaries of NB-IoT,โ€ IEEE Internet of Things Journal, vol. 6, no. 3, pp. 5702โ€“5712, Jun. 2019. 7. 3GPP, โ€œE-UTRA; medium access control (MAC) protocol specification,โ€ 3GPP TS 36.321, Rel. 13, v13.3.0, Jan. 2016. [Online]. Available: https://portal.3gpp.org 8. Y .-J. Yu and J.-K. Wang, โ€œNPRACH-aware link adaptation and uplink resource allocation in NB-IoT cellular networks,โ€ IEEE Transactions on Vehicular Technology, vol. 70, no. 5, pp. 4894โ€“4906, 2021. 9. Y .-J. Yu, Y .-H. Huang, and Y . Y . Shih, โ€œCrosscycled uplink resource allocation over NB-IoT,โ€ Sensors, vol. 21, no. 23, art. 7948, 2021. 10. Y . Liu, Y . Deng, N. Jiang, M. Elkashlan, and A. Nallanathan, โ€œAnalysis of random access in NB-IoT networks with three coverage enhancement groups: A stochastic geometry approach,โ€ IEEE Transactions on Wireless Communications, vol. 20, 2021. 11. C. Ramineniet al., โ€œPerformance evaluation of random access in narrow band Internet of Things systems,โ€Computer Networks, vol. 205, art. 109399, 2022. 12. P. J ยจorke, D. Ronschka, and C. Wietfeld, โ€œPerformance evaluation of random access for small data transmissions in highly dense public and private NB-IoT networks,โ€ inProc. IEEE 97th Vehicular Technology Conf. (VTC2023-Spring), 2023, pp. 1โ€“ 7. 13. L. Iiyambo, G. Hancke, and A. M. Abu-Mahfouz, โ€œA survey on NB-IoT random access: Approaches for uplink radio access network congestion management,โ€ IEEE Access, vol. 12, pp. 95 487โ€“95 506, 2024. 14. N. Jiang, Y . Deng, A. Nallanathan, and J. A. Chambers, โ€œDeep reinforcement learning for realtime optimization in NB-IoT networks,โ€arXiv preprintarXiv:1812.09026, Dec. 2018. 15. Y . Hadjadj-Aoul, M. Bagaa, T. Taleb, and M.-S. Alouini, โ€œAccess control in NB-IoT networks: A deep reinforcement learning approach,โ€ Information, vol. 11, no. 11, art. 541, Nov. 2020. 16. S. Anbazhagan and R. K. Mugelan, โ€œNext-gen resource optimization in NB-IoT networks: Harnessing soft actorโ€“critic reinforcement learning,โ€ Computer Networks, vol. 252, art. 110670, 2024.