pith. sign in

arxiv: 1907.07083 · v1 · pith:C3LYOWIOnew · submitted 2019-07-12 · 📡 eess.SP · math.OC

Spectrum Sensing and Resource Allocation for 5G Heterogeneous Cloud Radio Access Networks

Hossein Safi , A. M Montazeri , Javane Rostampoor , Saeedeh Parsaeefard This is my paper

Pith reviewed 2026-05-24 22:43 UTC · model grok-4.3

classification 📡 eess.SP math.OC
keywords spectrum sensingresource allocationC-RANopportunistic spectrum sharing5G heterogeneous networksthroughput maximizationQoS constraintsalternating optimization
0
0 comments X

The pith

An alternating optimization procedure jointly tunes sensing time and C-RAN resource allocation to raise low-priority throughput while meeting high-priority QoS targets.

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

The paper studies opportunistic spectrum sharing in 5G cloud radio access networks where low-priority users cooperatively sense for spectrum vacancies left by high-priority users. The design objective is to maximize aggregate low-priority throughput by choosing sensing duration, user-to-RRH associations, sub-carrier assignments, and transmit powers subject to detection and false-alarm probability constraints plus high-priority quality-of-service requirements. Because the resulting problem is non-convex and NP-hard, the authors replace direct solution with an iterative algorithm that alternately optimizes sensing time, association variables, and RRH powers at each step. Numerical results illustrate that explicit adjustment of sensing time is required to realize the sensing-throughput tradeoff and that the alternating procedure produces measurable throughput gains over fixed-sensing baselines.

Core claim

The central claim is that a low-complexity iterative algorithm, which cycles through closed-form or convex updates for sensing time (given target detection and false-alarm probabilities), binary user-association indicators, and continuous RRH transmit powers, converges to a feasible operating point that increases low-priority sum rate while strictly satisfying high-priority QoS and spectrum-sensing reliability constraints in a heterogeneous C-RAN.

What carries the argument

The alternating optimization loop that sequentially refines spectrum sensing duration, user association parameters, and RRH transmit powers.

If this is right

  • Sensing time must be treated as an explicit optimization variable rather than a fixed parameter to achieve the best sensing-throughput balance.
  • Joint assignment of RRHs, sub-carriers, and powers to low-priority users produces higher aggregate rate than separate allocation steps.
  • The same alternating structure can be reused when additional C-RAN resources such as baseband-unit pools are included in the decision set.
  • Guaranteeing high-priority QoS reduces to enforcing minimum-rate or outage constraints inside each power-allocation subproblem.

Where Pith is reading between the lines

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

  • If the alternating updates converge in a few iterations, the scheme could support online reconfiguration when channel statistics change slowly.
  • The model assumes error-free exchange of sensing decisions among low-priority users; relaxing that assumption would test robustness of the throughput gains.
  • Because sensing duration directly trades against transmission time, the same framework could be extended to incorporate energy-consumption objectives for battery-powered low-priority devices.

Load-bearing premise

The non-convex joint problem can be solved to acceptable performance by cycling through separate convex or closed-form subproblems for sensing time, associations, and powers.

What would settle it

A small-scale instance in which exhaustive enumeration of sensing time and associations yields a throughput at least 20 percent higher than the iterative procedure after a fixed number of iterations.

Figures

Figures reproduced from arXiv: 1907.07083 by A. M Montazeri, Hossein Safi, Javane Rostampoor, Saeedeh Parsaeefard.

Figure 1
Figure 1. Figure 1: System model and the structure of sensing-transmission time frames. [PITH_FULL_IMAGE:figures/full_fig_p006_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Interruption Probability for LVWN users versus sensing time and [PITH_FULL_IMAGE:figures/full_fig_p016_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Average achievable throughput for LVWN versus sensing time for different [PITH_FULL_IMAGE:figures/full_fig_p017_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Optimal sensing time versus detection probability for the different values of false [PITH_FULL_IMAGE:figures/full_fig_p018_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Average achievable throughput versus the number of users and the different values [PITH_FULL_IMAGE:figures/full_fig_p018_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Optimal sensing time (ms) for different number of RRHs, [PITH_FULL_IMAGE:figures/full_fig_p019_6.png] view at source ↗
read the original abstract

In this paper, the problem of opportunistic spectrum sharing for the next generation of wireless systems empowered by the cloud radio access network (C-RAN) is studied. More precisely, low-priority users employ cooperative spectrum sensing to detect a vacant portion of the spectrum that is not currently used by high-priority users. The design of the scheme is to maximize the overall throughput of the low-priority users while guaranteeing the quality of service of the high-priority users. This objective is attained by optimally adjusting spectrum sensing time with respect to imposed target probabilities of detection and false alarm as well as dynamically allocating and assigning C-RAN resources, i.e., transmit powers, sub-carriers, remote radio heads (RRHs), and base-band units. The presented optimization problem is non-convex and NP-hard that is extremely hard to tackle directly. To solve the problem, a low-complex iterative approach is proposed in which sensing time, user association parameters and transmit powers of RRHs are alternatively assigned and optimized at every step. Numerical results are then provided to demonstrate the necessity of performing sensing time adjustment in such systems as well as balancing the sensing-throughput tradeoff.

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 studies opportunistic spectrum sharing in 5G heterogeneous C-RANs where low-priority users perform cooperative spectrum sensing to access spectrum not used by high-priority users. The goal is to maximize aggregate throughput of low-priority users subject to QoS constraints on high-priority users by jointly optimizing sensing time (subject to detection/false-alarm targets), binary user-association indicators, sub-carrier allocation, RRH assignment, and continuous transmit powers. The resulting problem is declared non-convex and NP-hard; the authors propose an alternating iterative procedure that successively optimizes sensing time, association variables, and powers, and they present numerical results illustrating the sensing-throughput tradeoff.

Significance. If the alternating procedure can be shown to produce stationary points with quantifiable sub-optimality, the work would supply a concrete, implementable heuristic for joint sensing and resource allocation in cloud RANs, directly addressing the sensing-throughput tension that appears in many spectrum-sharing deployments. The explicit inclusion of sensing-time adjustment as an optimization variable is a useful modeling choice.

major comments (2)
  1. [iterative approach paragraph (post-problem statement)] The central claim that the alternating optimization 'solves' the non-convex NP-hard joint problem rests on the iterative procedure described after the problem formulation, yet no convergence theorem, stationarity guarantee, or proof that each sub-problem is convex after relaxation is supplied. Without such analysis the numerical illustrations only show feasible points, not that the procedure reaches a local optimum or improves upon simpler baselines.
  2. [optimization problem and numerical results sections] The abstract and problem statement assert that the method guarantees QoS for high-priority users while maximizing low-priority throughput, but no section derives a performance bound relative to the global optimum or reports the duality gap after relaxation of the binary association variables.
minor comments (2)
  1. [problem formulation] Notation for the binary association indicators and the sensing-time variable should be introduced once with consistent symbols across the problem formulation and algorithm description.
  2. [numerical results] The numerical results would benefit from an explicit statement of the number of Monte-Carlo trials and the channel model parameters used to generate the plotted curves.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive feedback. We address each major comment below, indicating planned revisions where appropriate.

read point-by-point responses

  1. Referee: [iterative approach paragraph (post-problem statement)] The central claim that the alternating optimization 'solves' the non-convex NP-hard joint problem rests on the iterative procedure described after the problem formulation, yet no convergence theorem, stationarity guarantee, or proof that each sub-problem is convex after relaxation is supplied. Without such analysis the numerical illustrations only show feasible points, not that the procedure reaches a local optimum or improves upon simpler baselines.

    Authors: We acknowledge that the manuscript does not provide a formal convergence theorem or stationarity guarantee. Each alternating step solves a subproblem that becomes convex (or solvable via one-dimensional search) after fixing the other variables and applying standard relaxations to the binary association indicators. Numerical results demonstrate consistent improvement and stabilization within few iterations, outperforming fixed-sensing baselines. In revision we will add a subsection discussing subproblem convexity after relaxation and include an empirical convergence plot. revision: partial

  2. Referee: [optimization problem and numerical results sections] The abstract and problem statement assert that the method guarantees QoS for high-priority users while maximizing low-priority throughput, but no section derives a performance bound relative to the global optimum or reports the duality gap after relaxation of the binary association variables.

    Authors: The QoS constraints on high-priority users are formulated as hard constraints and are satisfied by construction at every feasible point returned by the algorithm. Because the joint problem is NP-hard, a computable bound relative to the global optimum is unavailable. The binary variables are relaxed to [0,1] and the duality gap of the relaxed problem is not reported. In revision we will add a brief remark noting that the relaxed solutions frequently recover integer values in the presented simulations, indicating tightness in practice. revision: partial

Circularity Check

0 steps flagged

No circularity: standard alternating optimization heuristic for NP-hard resource allocation

full rationale

The paper formulates a non-convex NP-hard joint optimization over sensing time, binary associations, and powers, then proposes an alternating iterative procedure as a practical solver. No equations, derivations, or self-citations are visible that reduce any claimed result to its own inputs by construction. The method is presented as a heuristic without invoking uniqueness theorems, fitted parameters renamed as predictions, or ansatzes smuggled via prior self-work. The central claim (feasibility and throughput improvement via alternation) remains independent of any self-referential loop.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract provides no details on specific parameters, assumptions, or new entities introduced.

pith-pipeline@v0.9.0 · 5743 in / 878 out tokens · 22130 ms · 2026-05-24T22:43:14.035363+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

38 extracted references · 38 canonical work pages

  1. [1]

    J. G. Andrews, S. Buzzi, W. Choi, S. V. Hanly, A. Lozano, A. C. Soong, J. C. Zhang, What will 5G be?, IEEE J. Sel. Areas Commun. 32 (6) (June

    work page

  2. [2]

    M. Shafi, A. F. Molisch, P. J. Smith, T. Haustein, P. Zhu, P. D. Silva, F. Tufvesson, A. Benjebbour, G. Wunder, 5G: A tutorial overview of stan- dards, trials, challenges, deployment, and practice, IEEE J. Sel. Areas Com- mun. 35 (6) (June 2017) 1201–1221

    work page 2017

  3. [3]

    Bangerter, S

    B. Bangerter, S. Talwar, R. Arefi, K. Stewart, Networks and devices for the 5G era, IEEE Commun. Mag. 52 (2) (Feb. 2014) 90–96

    work page 2014

  4. [4]

    M. Peng, Y. Li, J. Jiang, J. Li, C. Wang, Heterogeneous cloud radio access networks: a new perspective for enhancing spectral and energy efficiencies, IEEE Wireless Commun. 21 (6) (2014) 126–135

    work page 2014

  5. [5]

    P. Rost, C. J. Bernardos, A. De Domenico, M. Di Girolamo, M. Lalam, A. Maeder, D. Sabella, D. W¨ ubben, Cloud technologies for flexible 5G radio access networks, IEEE Commun. Mag. 52 (5) (Sep. 2014) 68–76

    work page 2014

  6. [6]

    Checko, H

    A. Checko, H. L. Christiansen, Y. Yan, L. Scolari, G. Kardaras, M. S. Berger, L. Dittmann, Cloud RAN for mobile networks - a technology overview, IEEE Commun. Surveys Tuts. 17 (1) (Mar. 2015) 405–426

    work page 2015

  7. [7]

    Richart, J

    M. Richart, J. Baliosian, J. Serrat, J.-L. Gorricho, Resource slicing in vir- tual wireless networks: A survey, IEEE Trans. Netw. Service Manag. 13 (3) (Sep. 2016) 462–476

    work page 2016

  8. [8]

    G. Caso, L. De Nardis, M.-G. Di Benedetto, Toward context-aware dynamic spectrum management for 5G, IEEE Wireless Commun. 24 (5) (Oct. 2017) 38–43

    work page 2017

  9. [9]

    C. Yang, J. Li, M. Guizani, A. Anpalagan, M. Elkashlan, Advanced spec- trum sharing in 5G cognitive heterogeneous networks, IEEE Wireless Com- mun. 23 (2) (Apr. 2016) 94–101

    work page 2016

  10. [10]

    al, View on 5G architecture, White Paper, (July 2016)

    5G PPP Architecture Working Group and et. al, View on 5G architecture, White Paper, (July 2016)

    work page 2016

  11. [11]

    Bhushan, J

    N. Bhushan, J. Li, D. Malladi, R. Gilmore, D. Brenner, A. Damnjanovic, R. Sukhavasi, C. Patel, S. Geirhofer, Network densification: the dominant theme for wireless evolution into 5G, IEEE Commun. Mag. 52 (2) (Feb

    work page

  12. [12]

    Kliks, O

    A. Kliks, O. Holland, A. Basaure, M. Matinmikko, Spectrum and license flexibility for 5G networks, IEEE Commun. Mag. 53 (7) (July 2015) 42–49. 21

    work page 2015

  13. [13]

    Bogucka, P

    H. Bogucka, P. Kryszkiewicz, A. Kliks, Dynamic spectrum aggregation for future 5G communications, IEEE Commun. Mag. 53 (5) (May. 2015) 35–43

    work page 2015

  14. [14]

    J. F. Monserrat, G. Mange, V. Braun, H. Tullberg, G. Zimmermann, ¨O. Bu- lakci, METIS research advances towards the 5G mobile and wireless sys- tem definition, EURASIP Journal on Wireless Commun. and Net. 2015 (1) (Dec. 2015) 53

    work page 2015

  15. [15]

    Liang, Y

    Y.-C. Liang, Y. Zeng, E. C. Peh, A. T. Hoang, Sensing-throughput trade-off for cognitive radio networks, IEEE Trans. Wireless Commun. 7 (4) (Apr

    work page

  16. [16]

    I. F. Akyildiz, B. F. Lo, R. Balakrishnan, Cooperative spectrum sensing in cognitive radio networks: A survey, Physical commun. 4 (1) (Mar. 2011) 40–62

    work page 2011

  17. [17]

    Parsaeefard, V

    S. Parsaeefard, V. Jumba, A. Dalili, M. Derakhshani, T. Le-Ngoc, User as- sociation in cloud RANs with massive MIMO, IEEE Trans. Cloud Comput. (Aug. 2018)

    work page 2018

  18. [18]

    Huang, C.-C

    J. Huang, C.-C. Xing, Y. Qian, Z. J. Haas, Resource allocation for multi- cell device-to-device communications underlaying 5G networks: A game- theoretic mechanism with incomplete information, IEEE Trans. Veh. Tech- nol. 67 (3) (Mar. 2017) 2557–2570

    work page 2017

  19. [19]

    F. Fang, H. Zhang, J. Cheng, V. C. Leung, Energy-efficient resource allo- cation for downlink non-orthogonal multiple access network, IEEE Trans. Commun. 64 (9) (Sep. 2016) 3722–3732

    work page 2016

  20. [20]

    M. Peng, K. Zhang, J. Jiang, J. Wang, W. Wang, Energy-efficient resource assignment and power allocation in heterogeneous cloud radio access net- works, IEEE Trans. Veh. Technol. 64 (11) (Nov. 2015) 5275–5287

    work page 2015

  21. [21]

    Parsaeefard, R

    S. Parsaeefard, R. Dawadi, M. Derakhshani, T. Le-Ngoc, M. Baghani, Dynamic resource allocation for virtualized wireless networks in Massive- MIMO-aided and fronthaul-limited C-RAN, IEEE Trans. Veh. Technol. 66 (10) (Oct. 2017) 9512–9520

    work page 2017

  22. [22]

    Liang, F

    C. Liang, F. R. Yu, Wireless network virtualization: A survey, some re- search issues and challenges, IEEE Commun. Surveys Tuts. 17 (1) (Mar

    work page

  23. [23]

    H. Gao, W. Ejaz, M. Jo, Cooperative wireless energy harvesting and spec- trum sharing in 5G networks, IEEE Access 4 (Jun. 2016) 3647–3658

    work page 2016

  24. [24]

    X. Lin, J. G. Andrews, A. Ghosh, Spectrum sharing for device-to-device communication in cellular networks, IEEE Trans. Wireless Commun. 13 (12) (Dec. 2014) 6727–6740. 22

    work page 2014

  25. [25]

    Moubayed, A

    A. Moubayed, A. Shami, H. Lutfiyya, Wireless resource virtualization with device-to-device communication underlaying LTE network, IEEE Trans. Broadcast. 61 (4) (Dec. 2015) 734–740

    work page 2015

  26. [26]

    Cicho´ n, A

    K. Cicho´ n, A. Kliks, H. Bogucka, Energy-efficient cooperative spectrum sensing: A survey, IEEE Commun. Surveys Tuts. 18 (3) (Apr. 2016) 1861– 1886

    work page 2016

  27. [27]

    Khanikar, R

    K. Khanikar, R. Sinha, R. Bhattacharjee, Cooperative spectrum sensing us- ing quantized energy statistics in the absence of dedicated reporting chan- nel, IEEE Trans. Veh. Technol. 67 (5) (Jan. 2018) 4149–4160

    work page 2018

  28. [28]

    Sardellitti, S

    S. Sardellitti, S. Barbarossa, Joint optimization of collaborative sensing and radio resource allocation in small-cell networks, IEEE Trans. Signal Process. 61 (18) (Sep. 2013) 4506–4520

    work page 2013

  29. [29]

    Ghasemi, E

    A. Ghasemi, E. S. Sousa, Collaborative spectrum sensing for opportunistic access in fading environments, in: Proc, 2005 IEEE DySPAN, pp. 131–136

    work page 2005

  30. [30]

    Rakovic, D

    V. Rakovic, D. Denkovski, V. Atanasovski, P. M¨ ah¨ onen, L. Gavrilovska, Capacity-aware cooperative spectrum sensing based on noise power esti- mation, IEEE Trans. Commun. 63 (7) (Jul. 2015) 2428–2441

    work page 2015

  31. [31]

    W. Xu, X. Li, C.-H. Lee, M. Pan, Z. Feng, Joint sensing duration adap- tation, user matching, and power allocation for cognitive OFDM-NOMA systems, IEEE Trans. Wireless Commun. 17 (2) (Dec. 2017) 1269–1282

    work page 2017

  32. [32]

    MOSEK ApS, The MOSEK optimization software, [Online] Available: http://www. mosek. com

    work page

  33. [33]

    Burer, A

    S. Burer, A. N. Letchford, Non-convex mixed-integer nonlinear program- ming: A survey, Surveys in Oper. Res. Manag. Sci. 17 (2) (Jul. 2012) 97–106

    work page 2012

  34. [34]

    Grant, S

    M. Grant, S. Boyd, CVX: Matlab software for disciplined convex program- ming

    work page

  35. [35]

    H. D. Tuan, S. Hosoe, H. Tuy, DC optimization approach to robust controls: the optimal scaling value problem, IEEE Trans. Autom. Control 45 (10) (Oct. 2000) 1903–1909

    work page 2000

  36. [36]

    S. Boyd, L. Vandenberghe, Convex Optimization , Cambridge University Press, 2004

    work page 2004

  37. [37]

    Razaviyayn, M

    M. Razaviyayn, M. Hong, Z.-Q. Luo, A unified convergence analysis of block successive minimization methods for nonsmooth optimization, SIAM Journal on Optimization 23 (2) (Jun. 2013) 1126–1153

    work page 2013

  38. [38]

    Goldsmith, Wireless Communications , Cambridge University Press, 2005

    A. Goldsmith, Wireless Communications , Cambridge University Press, 2005. 23

    work page 2005