pith. sign in

arxiv: 1906.11102 · v1 · pith:R4RAAT7Cnew · submitted 2019-06-25 · 💻 cs.NI · cs.IT· math.IT· stat.OT

Hybrid Resource Scheduling for Aggregation in Massive Machine-type Communication Networks

Onel L. Alcaraz L\'opez , Hirley Alves , Pedro H. J. Nardelli , Matti Latva-aho This is my paper

Pith reviewed 2026-05-25 16:14 UTC · model grok-4.3

classification 💻 cs.NI cs.ITmath.ITstat.OT
keywords mMTCNOMAdata aggregationresource schedulingimperfect SIChybrid accessmachine-type devicesrelaying phase
0
0 comments X

The pith

A NOMA-based hybrid access scheme lets multiple machine-type devices share the same orthogonal channel for data aggregation.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces a hybrid access method using non-orthogonal multiple access so several machine-type devices can transmit on one channel to an aggregator. It compares random resource scheduling against channel-dependent resource scheduling while modeling errors from imperfect successive interference cancellation. Performance is quantified as the average number of devices served simultaneously, and that quantity is then used to evaluate the relaying phase that forwards aggregated data onward to the base station. This setup addresses the need to support very large numbers of low-power devices without exhausting available channels. A reader would care because the comparison between the two scheduling methods shows how resource allocation choices affect overall system capacity under realistic cancellation limits.

Core claim

By employing non-orthogonal multiple access, a hybrid scheme is introduced in which multiple machine-type devices share the same orthogonal channel during the aggregation phase. System performance is evaluated in terms of the average number of simultaneously served devices under imperfect successive interference cancellation for random resource scheduling and channel-dependent resource scheduling, with the results then applied to the data forwarding phase to the base station.

What carries the argument

The hybrid NOMA access scheme that permits multiple MTDs per orthogonal channel, combined with random versus channel-dependent scheduling under a model of imperfect successive interference cancellation.

If this is right

  • The hybrid scheme increases the number of MTDs that can transmit simultaneously on each shared channel relative to purely orthogonal access.
  • The performance gap between random and channel-dependent scheduling directly determines which method yields more served devices under given channel conditions.
  • Aggregation-phase metrics feed forward to set the effective load and success probability of the relaying phase to the base station.
  • Imperfect cancellation imposes an upper limit on the number of devices that can share a channel before the average served count stops increasing.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If real hardware exhibits different cancellation error statistics than the model, the ranking of the two scheduling schemes could change or even reverse.
  • The framework could be extended by replacing the given cancellation model with measured error traces from specific radio hardware to produce deployment-specific predictions.
  • The same hybrid access logic might apply to other low-power wide-area scenarios where devices have sporadic traffic but share spectrum with strict power constraints.

Load-bearing premise

The analysis depends on a specific statistical model of errors in successive interference cancellation whose accuracy is taken as given.

What would settle it

Deploy a hardware aggregator with multiple MTDs, measure the actual packet error rates after successive interference cancellation for both scheduling schemes, and check whether the measured average number of served devices matches the analytical predictions.

Figures

Figures reproduced from arXiv: 1906.11102 by Hirley Alves, Matti Latva-aho, Onel L. Alcaraz L\'opez, Pedro H. J. Nardelli.

Figure 1
Figure 1. Figure 1: a), b) and c) Snapshot of the aggregation phase with [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Average dimension of the search space D¯N as a function of N for m¯ ∈ {10, 20, 60, 120}. DK,N =    1, if K ≤ N K 2N−K 2(K−N)−1  (K−N), if N <K ≤2N K 2N  N(2N − 1), if K >2N , (19) while on average the dimension of the search space is D¯N = P∞ k=0 Dk,N Pr(K = k), which can be stated as in (20) at the top of the next page. Notice that (a) came from using (19), while (b) followed from using the CDF of K… view at source ↗
Figure 3
Figure 3. Figure 3: Average number of successful MTDs as a function of the [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Relaying phase: average number of successful MTDs as [PITH_FULL_IMAGE:figures/full_fig_p007_4.png] view at source ↗
Figure 6
Figure 6. Figure 6: Maximum average of simultaneously served MTDs as a fu [PITH_FULL_IMAGE:figures/full_fig_p007_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Average number of successful MTDs as a function of the [PITH_FULL_IMAGE:figures/full_fig_p007_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Region of intersection. a) 0 ≤ θa2 a1 < 1 (top), b) θa2 a1 ≥ 1 (bottom). while (a) and (b) come from using their CDF expressions, which are obtained next. FV1 (v1) = Pr(max(h1, h2) − θa2 a1 min(h1, h2) ≤ v1) = Pr max(h1, h2) ≤ v1 + θa2 a1 min(h1, h2)  = Pr h1 ≤ v1 + θa2 a1 min(h1, h2) \ h2 ≤ v1 + θa2 a1 min(h1, h2)  = Pr  min(h1, h2) ≥ (h1 − v1)a1 θa2 \ min(h1, h2) ≥ (h2 − v1)a1 θa2  = Pr  h1 ≥ (h1−v1… view at source ↗
read the original abstract

Data aggregation is a promising approach to enable massive machine-type communication (mMTC). Here, we first characterize the aggregation phase where a massive number of machine-type devices transmits to their respective aggregator. By using non-orthogonal multiple access (NOMA), we present a hybrid access scheme where several machine-type devices (MTDs) share the same orthogonal channel. Then, we assess the relaying phase where the aggregatted data is forwarded to the base station. The system performance is investigated in terms of average number of MTDs that are simultaneously served under imperfect successive interference cancellation (SIC) at the aggregator for two scheduling schemes, namely random resource scheduling (RRS) and channel-dependent resource scheduling (CRS), which is then used to assess the performance of data forwarding phase.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper proposes a hybrid NOMA-based access scheme for the aggregation phase in mMTC networks, allowing multiple machine-type devices (MTDs) to share the same orthogonal channel at an aggregator. It evaluates system performance via the average number of simultaneously served MTDs under imperfect successive interference cancellation (SIC) for two scheduling policies—random resource scheduling (RRS) and channel-dependent resource scheduling (CRS)—and then uses these results to assess the subsequent relaying phase to the base station.

Significance. If the modeling assumptions hold, the work contributes to understanding how NOMA and scheduling choices affect aggregation efficiency in massive connectivity scenarios, with potential implications for 5G/6G mMTC design. The explicit comparison of RRS versus CRS under imperfect SIC provides a concrete, quantifiable metric that could inform practical resource allocation if the residual interference model is shown to be robust.

major comments (2)
  1. [§4] §4 (System Model and Performance Analysis), the SINR expressions under imperfect SIC: the residual interference is modeled via a fixed factor multiplying the cancelled signal power. Because the average number of served MTDs for both RRS and CRS is obtained by substituting this fixed factor into the success probability expressions, the reported ordering and gap between the two schemes are monotonic functions of that factor; no sensitivity analysis or hardware validation is provided.
  2. [§5] §5 (Numerical Results), the curves comparing RRS and CRS: the headline metric (average number of simultaneously served MTDs) and the claim that CRS outperforms RRS rest entirely on the specific imperfect-SIC parameter choice; altering the residual-interference statistics (e.g., making it SNR-dependent) would require re-deriving the closed-form expressions and could reverse the ranking, yet no such sweep is reported.
minor comments (2)
  1. [Abstract] Abstract: the sentence beginning 'Then, we assess the relaying phase...' is a run-on; splitting it would improve readability.
  2. [Abstract] Abstract: 'aggregatted' is a typographical error and should read 'aggregated'.

Simulated Author's Rebuttal

2 responses · 1 unresolved

We thank the referee for the constructive comments regarding the imperfect SIC modeling and numerical evaluation. We respond to each major comment below.

read point-by-point responses

  1. Referee: [§4] §4 (System Model and Performance Analysis), the SINR expressions under imperfect SIC: the residual interference is modeled via a fixed factor multiplying the cancelled signal power. Because the average number of served MTDs for both RRS and CRS is obtained by substituting this fixed factor into the success probability expressions, the reported ordering and gap between the two schemes are monotonic functions of that factor; no sensitivity analysis or hardware validation is provided.

    Authors: The fixed residual interference factor is a standard modeling assumption in the NOMA literature to enable tractable closed-form analysis of average performance under imperfect SIC. The expressions and resulting ordering are indeed monotonic in this parameter. We will add a sensitivity analysis (plots of average served MTDs versus the residual factor) for both RRS and CRS to the revised manuscript. Hardware validation lies outside the scope of this theoretical analysis paper. revision: partial

  2. Referee: [§5] §5 (Numerical Results), the curves comparing RRS and CRS: the headline metric (average number of simultaneously served MTDs) and the claim that CRS outperforms RRS rest entirely on the specific imperfect-SIC parameter choice; altering the residual-interference statistics (e.g., making it SNR-dependent) would require re-deriving the closed-form expressions and could reverse the ranking, yet no such sweep is reported.

    Authors: Our analysis and claims are derived under the fixed-factor imperfect SIC model, which is widely used for its analytical tractability in mMTC contexts. We agree a sweep strengthens the results and will add numerical curves over a practical range of the residual factor in the revised Section 5 to confirm the CRS advantage holds for typical values. An SNR-dependent model would require new derivations, which we do not pursue here as it falls outside the paper's modeling framework. revision: yes

standing simulated objections not resolved
  • Hardware validation of the imperfect SIC residual interference model

Circularity Check

0 steps flagged

No circularity: performance metrics derived from standard imperfect-SIC model without self-referential fitting or self-citation chains

full rationale

The provided abstract and description contain no equations, parameter definitions, or self-citations that would allow identification of any load-bearing step reducing to its own inputs by construction. The average number of served MTDs is assessed under an imperfect SIC model presented as given input for comparing RRS and CRS; this is a standard modeling choice rather than a fitted quantity renamed as prediction or a self-definitional loop. No uniqueness theorems, ansatzes smuggled via citation, or renamings of known results are visible. The derivation chain is therefore self-contained against external benchmarks for the purpose of this analysis.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review supplies no explicit free parameters, axioms, or invented entities; the imperfect-SIC model is implicitly assumed but not detailed.

pith-pipeline@v0.9.0 · 5683 in / 1064 out tokens · 27509 ms · 2026-05-25T16:14:47.536064+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

32 extracted references · 32 canonical work pages

  1. [1]

    Understanding the I nternet of Things: definition, potentials, and societal role of a fast e volving paradigm,

    L. Atzori, A. Iera, and G. Morabito, “Understanding the I nternet of Things: definition, potentials, and societal role of a fast e volving paradigm,” Ad Hoc Networks , vol. 56, pp. 122–140, 2017

    work page 2017

  2. [2]

    Machine-to-machine communi cations: Technologies and challenges,

    K.-C. Chen and S.-Y . Lien, “Machine-to-machine communi cations: Technologies and challenges,” Ad Hoc Networks , vol. 18, pp. 3–23, 2014

    work page 2014

  3. [3]

    (2017, nov) Ericsson mobility report

    Ericsson. (2017, nov) Ericsson mobility report. [Onlin e]. Available: https://www.ericsson.com/en/mobility-report/reports/november-2017/internet-of-things-outlook

    work page 2017

  4. [4]

    To- ward massive machine type cellular communications,

    Z. Dawy, W. Saad, A. Ghosh, J. G. Andrews, and E. Y aacoub, “ To- ward massive machine type cellular communications,” IEEE Wireless Commun., vol. 24, no. 1, pp. 120–128, February 2017

    work page 2017

  5. [5]

    A survey of MAC layer issues and protocols for machine-to-machine communications,

    A. Rajandekar and B. Sikdar, “A survey of MAC layer issues and protocols for machine-to-machine communications,” IEEE Internet of Things Journal, vol. 2, no. 2, pp. 175–186, April 2015

    work page 2015

  6. [6]

    Evolved universal terrestria l radio access (E-UTRA); radio resource control (RRC),

    3GPP TS 36.331 V10.50.0, “Evolved universal terrestria l radio access (E-UTRA); radio resource control (RRC),” Mar 2012

    work page 2012

  7. [7]

    PRADA: Pri oritized random access with dynamic access barring for MTC in 3GPP LTE -A networks,

    T. M. Lin, C. H. Lee, J. P . Cheng, and W. T. Chen, “PRADA: Pri oritized random access with dynamic access barring for MTC in 3GPP LTE -A networks,” IEEE Trans. on V ehic. Tech., vol. 63, no. 5, pp. 2467–2472, Jun 2014

    work page 2014

  8. [8]

    Performance analy sis and parameter optimization of random access backoff algorithm in LTE,

    X. Y ang, A. Fapojuwo, and E. Egbogah, “Performance analy sis and parameter optimization of random access backoff algorithm in LTE,” in IEEE VTC-Fall, Sept 2012, pp. 1–5

    work page 2012

  9. [9]

    DERA: Augmented r andom access for cellular networks with dense H2H-MTC mixed traffi c,

    M. I. Hossain, A. Azari, and J. Zander, “DERA: Augmented r andom access for cellular networks with dense H2H-MTC mixed traffi c,” in 2016 IEEE Globecom W orkshops (GC Wkshps) , Dec 2016, pp. 1–7

    work page 2016

  10. [10]

    Goodbye, ALOHA!

    A. Laya, C. Kalalas, F. V azquez-Gallego, L. Alonso, and J. Alonso- Zarate, “Goodbye, ALOHA!” IEEE Access, vol. 4, pp. 2029–2044, 2016

    work page 2029

  11. [11]

    Da ta aggregation in capillary networks for machine-to-machine communication s,

    H. Shariatmadari, P . Osti, S. Iraji, and R. J¨ antti, “Da ta aggregation in capillary networks for machine-to-machine communication s,” in 2015 IEEE 26th Annual International Symposium on Personal, Indo or , and Mobile Radio Communications (PIMRC) , Aug 2015, pp. 2277–2282

    work page 2015

  12. [12]

    Maximizing the link throughput between smar t meters and aggregators as secondary users under power and outage co nstraints,

    P . H. Nardelli, M. de Castro Tom´ e, H. Alves, C. H. de Lima , and M. Latva-aho, “Maximizing the link throughput between smar t meters and aggregators as secondary users under power and outage co nstraints,” Ad Hoc Networks , vol. 41, pp. 57–68, 2016

    work page 2016

  13. [13]

    Finite blocklength communications in smart grids for dynamic spectrum access and locally licensed scenarios,

    I. Ramezanipour, P . Nouri, H. Alves, P . H. J. Nardelli, R . D. Souza, and A. Pouttu, “Finite blocklength communications in smart grids for dynamic spectrum access and locally licensed scenarios,” IEEE Sensors Journal, vol. 18, no. 13, pp. 5610–5621, July 2018

    work page 2018

  14. [14]

    Big data challenges and data aggregation strategies in wireless sen sor networks,

    S. Boubiche, D. E. Boubiche, A. Bilami, and H. Toral-Cru z, “Big data challenges and data aggregation strategies in wireless sen sor networks,” IEEE Access , vol. 6, pp. 20 558–20 571, 2018

    work page 2018

  15. [15]

    M2M data aggregatio n over cellular networks: Signaling-delay trade-offs,

    N. Kouzayha, M. Jaber, and Z. Dawy, “M2M data aggregatio n over cellular networks: Signaling-delay trade-offs,” in 2014 IEEE Globecom W orkshops (GC Wkshps), Dec 2014, pp. 1155–1160

    work page 2014

  16. [16]

    Dat a aggregation for group communication in machine-to-machine environmen ts,

    A. Riker, E. Cerqueira, M. Curado, and E. Monteiro, “Dat a aggregation for group communication in machine-to-machine environmen ts,” in 2014 IFIP Wireless Days (WD) , Nov 2014, pp. 1–7

    work page 2014

  17. [17]

    CoAP: An ap plication protocol for billions of tiny Internet nodes,

    C. Bormann, A. P . Castellani, and Z. Shelby, “CoAP: An ap plication protocol for billions of tiny Internet nodes,” IEEE Internet Computing , vol. 16, no. 2, pp. 62–67, March 2012

    work page 2012

  18. [18]

    Energy- optimal data aggregation and dissemination for the Internet of Things,

    E. Fitzgerald, M. Pi´ oro, and A. Tomaszewski, “Energy- optimal data aggregation and dissemination for the Internet of Things,” IEEE Internet of Things Journal , vol. 5, no. 2, pp. 955–969, April 2018

    work page 2018

  19. [19]

    Mass ive machine type communication with data aggregation and resource sche duling,

    J. Guo, S. Durrani, X. Zhou, and H. Y anikomeroglu, “Mass ive machine type communication with data aggregation and resource sche duling,” IEEE Transactions on Communications , vol. 65, no. 9, pp. 4012–4026, Sept 2017

    work page 2017

  20. [20]

    Ma ssive non- orthogonal multiple access for cellular IoT: Potentials an d limitations,

    M. Shirvanimoghaddam, M. Dohler, and S. J. Johnson, “Ma ssive non- orthogonal multiple access for cellular IoT: Potentials an d limitations,” IEEE Communications Magazine , vol. 55, no. 9, pp. 55–61, 2017

    work page 2017

  21. [21]

    System-level performance evaluation of downlink non-orthogonal multip le access (NOMA),

    Y . Saito, A. Benjebbour, Y . Kishiyama, and T. Nakamura, “System-level performance evaluation of downlink non-orthogonal multip le access (NOMA),” in IEEE PIMRC , Sept 2013, pp. 611–615. 10 FV1 (v1) = Pr ( h1 ≤ v1 ⋂ h2 ≤ θa2 a1 h1 + v1 ) + Pr ( v1 ≤ h1 ≤ v1 1 − θa2 a1 ⋂ a1 θa2 h1 − v1a1 θa2 ≤ h2 ≤ θa2 a1 h1 + v1 ) = v1∫ 0 FH2 ( θa2 a1 h1 + v1)fH1 (h1)dh1...

    work page 2013

  22. [22]

    On the performan ce of non-orthogonal multiple access in 5G systems with randomly deployed users,

    Z. Ding, Z. Y ang, P . Fan, and H. V . Poor, “On the performan ce of non-orthogonal multiple access in 5G systems with randomly deployed users,” IEEE Sig. Proces. Lett. , vol. 21, no. 12, Dec 2014

    work page 2014

  23. [23]

    Stochastic geome try based performance study on 5G non-orthogonal multiple access sch eme,

    Z. Zhang, H. Sun, R. Q. Hu, and Y . Qian, “Stochastic geome try based performance study on 5G non-orthogonal multiple access sch eme,” in IEEE GLOBECOM , Dec 2016, pp. 1–6

    work page 2016

  24. [24]

    Aggregation and resource scheduling in machine-type comm unication networks: A stochastic geometry approach,

    O. L. A. L ´ opez, H. Alves, P . H. J. Nardelli, and M. Latva- aho, “Aggregation and resource scheduling in machine-type comm unication networks: A stochastic geometry approach,” IEEE Transactions on Wireless Communications, vol. 17, no. 7, pp. 4750–4765, July 2018

    work page 2018

  25. [25]

    Proportional fairness-based power allocation and user set selection for downlink NOMA systems ,

    F. Liu, P . M¨ ah¨ onen, and M. Petrova, “Proportional fairness-based power allocation and user set selection for downlink NOMA systems ,” in 2016 IEEE International Conference on Communications (ICC) , May 2016, pp. 1–6

    work page 2016

  26. [26]

    Ma ssive mul- tiple access based on superposition raptor codes for cellul ar M2M communications,

    M. Shirvanimoghaddam, M. Dohler, and S. J. Johnson, “Ma ssive mul- tiple access based on superposition raptor codes for cellul ar M2M communications,” IEEE Trans. on Wireless Commun. , vol. 16, no. 1, pp. 307–319, Jan 2017

    work page 2017

  27. [27]

    Optimizing d ata aggre- gation for uplink machine-to-machine communication netwo rks,

    D. Malak, H. S. Dhillon, and J. G. Andrews, “Optimizing d ata aggre- gation for uplink machine-to-machine communication netwo rks,” IEEE Trans. on Commun. , vol. 64, no. 3, pp. 1274–1290, March 2016

    work page 2016

  28. [28]

    Haenggi, Stochastic geometry for wireless networks

    M. Haenggi, Stochastic geometry for wireless networks . Cambridge University Press, 2012

    work page 2012

  29. [29]

    Spa tiotemporal stochastic modeling of IoT enabled cellular networks: Scal ability and stability analysis,

    M. Gharbieh, H. ElSawy, A. Bader, and M. S. Alouini, “Spa tiotemporal stochastic modeling of IoT enabled cellular networks: Scal ability and stability analysis,” IEEE Transactions on Communications , vol. 65, no. 8, pp. 3585–3600, Aug 2017

    work page 2017

  30. [30]

    The mean interference-to-signal ratio an d its key role in cellular and amorphous networks,

    M. Haenggi, “The mean interference-to-signal ratio an d its key role in cellular and amorphous networks,” IEEE Wireless Commun. Letters , vol. 3, no. 6, pp. 597–600, Dec 2014

    work page 2014

  31. [31]

    Asymptotics and approximat ion of the SIR distribution in general cellular networks,

    R. K. Ganti and M. Haenggi, “Asymptotics and approximat ion of the SIR distribution in general cellular networks,” IEEE Trans. on Wireless Commun., vol. 15, no. 3, pp. 2130–2143, March 2016

    work page 2016

  32. [32]

    Non-orthogonal multi ple access with SIC error propagation in downlink wireless MIMO networ ks,

    H. Sun, B. Xie, R. Q. Hu, and G. Wu, “Non-orthogonal multi ple access with SIC error propagation in downlink wireless MIMO networ ks,” in IEEE V ehicular Technology Conference (VTC-Fall), Sept 2016, pp. 1–5

    work page 2016