 Research
 Open Access
 Published:
Uplink achievable rate in underlay random access OFDMbased cognitive radio networks
EURASIP Journal on Wireless Communications and Networking volume 2019, Article number: 22 (2019)
Abstract
This paper investigates the uplink achievable rate of secondary users (SUs) in underlay orthogonal frequency division multiplexing based cognitive radio networks, where the SUs randomly access the subcarriers of the primary network. In practice, the primary base stations (PBSs), such as cellular base stations, may not be placed close to each other to mitigate the interferences among them. In this regard, we model the spatial distribution of the PBSs as a βGinibre point process which captures the repulsive placement of the PBSs. It is assumed that in order to alleviate the interferences at the PBSs from the SUs, each SU controls its transmit power based on the average interference level at the closest PBS induced by the SU. We first analytically identify the characteristics of the transmit powers at the SUs. Then, tight approximations of the uplink achievable rate of the secondary network are provided in two different scenarios that assume either a decentralized or centralized allocation of the SUs’ subcarriers, respectively. The accuracy of our analytical results is validated by simulation results.
1 Introduction
Orthogonal frequency division multiplexing (OFDM)based cognitive radios have been recognized as a promising solution to overcome the radio frequency spectrum scarcity [1]. In cognitive radio networks (CRNs), secondary users (SUs) access the spectrum in general via three different approaches, i.e., interweave, overlay, and underlay, respectively. Among the access models, due to their simplicity, underlay CRNs, where SUs transmit their data without spectrum sensing as long as the interference level at the primary network (PN) remains acceptable, have been widely explored [1–3].
During the past decade, many researchers have studied underlay OFDMbased CRNs where the locations of nodes in the overlapping networks are deterministic and known [4–8]. The work [4] investigated the average SU achievable rate when random subcarrier allocation schemes are adopted at the secondary network (SN), and the number of allocated subcarriers for users is fixed. The number of subcarrier collisions between the PN and the SN was analyzed in [5] assuming fixed and random numbers of subcarriers at each user. The authors in [6] proposed a joint subcarrier pairing and power allocation method to maximize the SU’s throughput in relayaided OFDMbased CRNs. The problem of determining the power and subcarrier allocation levels that maximize the average achievable throughput of multiuser OFDMbased CRNs under the constraint of an allowable interference threshold at the PN was examined in [9] and [10].
Assessing the underlay CRN performance by taking into account the spatial distributions of CRN nodes as point processes has attracted much attention recently [11]. In [12], the outage probability of an underlay CRN was established under the assumption that the locations of primary base stations (PBSs) and secondary base stations (SBSs) are modeled as two independent Poisson point processes (PPPs). Also, [13, 14] studied the coverage probability of the uplink transmission of an underlay CRN in which the distributions of PBSs, SBSs, primary users (PUs), and SUs follow independent PPPs. However, to the best of our knowledge, the performance of an underlay OFDMbased CRN, which depends implicitly on the employed subcarrier allocation method, has not been addressed yet.
Due to its mathematical tractability, the PPP whose points are independent has been widely adopted to model various types of wireless networks where nodes are placed in an unplanned fashion [15]. However, when an operator designs a network, transmitters in the network may not be placed in close proximity to each other. This measure is to reduce the interferences among the transmitters and to extend the coverage region, and it incurs a repulsive feature in the networks [16, 17]. The βGinibre point process (GPP) [18] is a repulsive point process which can reflect the repulsive nature and presents the additional benefit of including the PPP as a particular distribution [19]. For this reason, the βGPP has been applied to analyze the coverage probabilities of singletier and multitier downlink cellular networks in [20] and [21], respectively. Despite the fact that PBSs in CRNs may exhibit a repulsive behavior, the performance of an underlay OFDMbased CRN which considers the repulsion has not been investigated yet.
2 Method
This paper examines the performance of an underlay OFDMbased CRN that assumes multiple PBSs, SBSs, PUs, and SUs, and a power control method in the SN to mitigate the interferences at PBSs from the SUs. We study the SU uplink achievable rate under two scenarios: with and without a centralized allocation of subcarriers at the SN, respectively, and which affect differently the collisions among the SUs subcarriers. The PNs can stand for various networks with a repulsive feature such as cellular networks or wireless sensor networks, and hence the locations of the PBSs are modeled as a βGPP. On the other hand, since the SBSs in a SN can represent individual users or devices deployed by multiple different operators/users, the repulsion among the positions of the SBSs is negligible, and thus the spatial distribution of the SBSs is assumed to follow a PPP.
The contributions of this paper are summarized next:

First, we present the expressions of the cumulative distribution function (CDF) and probability density function (PDF) of transmit powers at SUs when the positions of the PBSs are modeled as a βGPP.

Then, we derive approximations of the average of the SU uplink achievable rate for the cases where the SUs subcarriers are allocated in a decentralized or centralized manner at the SN.

Lastly, we explore the impact of subcarrier collisions among the SUs and repulsion among the locations of PBSs on the SU achievable rate.
The organization of this paper is as follows: Section 3 describes the system model of an underlay OFDMbased CRN. The characteristics of the transmit powers at SUs and the SU uplink achievable rate are investigated in Section 4. In Section 5, numerical simulation results are provided to validate the tightness of the derived analytical results. Lastly, conclusions are made in Section 6.
The following notations are used throughout the paper. \({\mathbb P}(A)\) and \({\mathbb E}[X]\) stand for the probability of an event A and the mean of a random variable X, respectively. The operators ∖ and ∥·∥ denote the set difference operation and the Euclidean 2norm, respectively. The list of symbols used in this paper and their definitions is provided in Table 1.
3 System model
We consider an underlay OFDMbased CRN consisting of a PN and a SN. We will focus on assessing the uplink performance of the SN when each SU (or PU) is associated with the SBS (or PBS) providing the highest average channel gain, i.e., the nearest SBS (or PBS), and transmits its data to the associated SBS (or PBS).
To capture the repulsive behavior among the locations of PBSs, the spatial distribution of the PBSs is modeled as a βGPP Φ_{P} with repulsion parameter β and intensity λ_{P}. Here, the parameter β∈(0,1] determines the degree of repulsion among the positions of the PBSs. More specifically, the PBSs are more evenly distributed when β increases and Φ_{P} converges to a homogeneous PPP with intensity λ_{P} when β→0. The locations of SBSs are assumed to follow a homogeneous PPP Φ_{S} with intensity λ_{S}. Also, we model the distributions of PUs and SUs as a homogeneous PPP \(\Phi _{P}^{(u)}\) with intensity \(\lambda _{P}^{(u)}\) and a homogeneous PPP \(\Phi _{S}^{(u)}\) with intensity \(\lambda _{S}^{(u)}\), respectively. It is presumed that Φ_{P}, Φ_{S}, \(\Phi _{P}^{(u)}\), and \(\Phi _{S}^{(u)}\) are mutually independent.
We assume that there are N available subcarriers, and the number of allocated subcarriers for each PU and each SU is N_{P} and N_{S}, respectively^{Footnote 1}. In the PN, to alleviate the interferences among the PUs, each PBS allocates each subcarrier to at most one PU which is associated to the PBS so that the PUs communicating with the same PBS do not collide. More specifically, if the number of PUs in the Voronoi cell of a PBS is M_{P}, as each PU requests N_{P} subcarriers, the number of subcarriers requested by the connected PUs is equal to M_{P}N_{P}. When M_{P}N_{P}≤N, the allocations of PUs subcarriers are conducted by maintaining orthogonality among them. On the other hand, if M_{P}N_{P}>N, each of N subcarriers is assigned to a single PU that is chosen in a random fashion.
Two types of subcarrier allocation methods for the SN are considered, i.e., decentralized subcarrier allocation (DSA) and centralized subcarrier allocation (CSA). When the DSA is applied, each SU randomly selects N_{S} subcarriers independently with respect to other SUs and PUs. On the other hand, when the CSA is adopted, each SBS sequentially and randomly assigns orthogonal sets of subcarriers to its associated SUs. More precisely, if the number of SUs in the Voronoi cell of a SBS is equal to M_{S} and M_{S}N_{S}≤N, each SU connected to the SBS utilizes N_{S} subcarriers which are orthogonal with other subcarriers allocated for other SUs in the Voronoi cell. Otherwise, if M_{S}N_{S}>N, each of N subcarriers is allocated to a single SU that is selected in a random fashion [4].
Since data transmissions from SUs cause interferences at PBSs, they lead to a degradation in the PN performance. On the other hand, the SN performance can be improved with larger transmit powers at the SUs. In this context, it would be reasonable to increase the transmit powers at the SUs as long as the interferences at the PBSs do not exceed a certain threshold. Hence, we consider the scenario where each SU adjusts its transmit power based on the average interference level at the closest PBS induced by the SU. Under this scenario, the transmit power at the SU situated at \({\mathbf {x}} \in {\mathbb R}^{2}\) is expressed as
where
where τ, α_{P}, and r_{P,x} represent the predefined interference threshold, path loss exponent for channels between SUs and PBSs, and distance between the SU at x and its nearest PBS, respectively. When the maximum transmit power constraint at SUs is considered, the transmit power at the SU at x becomes
where P_{max} is the maximum transmit power allowed at SUs.
Denote now the set of indices of all subcarriers as \({\mathcal N} = \{ 1, \dots, N \}\). We consider a typical SU and represent the set of indices of the subcarriers selected by the typical SU by \({\mathcal F} = \{ f_{1}, \dots, f_{N_{S}} \}\), where \({\mathcal F} \subset {\mathcal N}\). Since the homogeneous PPP is stationary [22], without loss of generality, we assume that the typical SU is located at the origin o. We term the SBS which is associated with the typical SU as tagged SBS.
Denoting the location of the tagged SBS by \({\mathbf {y}} \in {\mathbb R}^{2}\), for the subcarrier \(f_{i} \in {\mathcal F}\), the signaltointerferenceplusnoise ratio (SINR) γ_{i} is expressed as
where
where σ^{2} indicates the power of additive white Gaussian noise (AWGN), P_{P} denotes the transmit power at PUs and α_{S} is the path loss exponent for channels between users and SBSs. We define \(\Phi _{S,i}^{(u)}\) and \(\Phi _{P,i}^{(u)}\) as the point processes representing the distributions of the SUs and the PUs employing the subcarrier f_{i}, respectively. Also, h_{x,i} (or g_{x,i}) stands for the power of smallscale fading channel between the tagged SBS and the SU (or PU) at x for the subcarrier f_{i}, which is independent with respect to Φ_{P}, Φ_{S}, \(\Phi _{P}^{(u)}\), and \(\Phi _{S}^{(u)}\). It is assumed that the smallscale fading channels are Rayleigh distributed, and hence {h_{x,i}} and {g_{x,i}} are independent exponential random variables with unit mean.
Remarkably, even when the CSA is adopted in the SN, there exist interferences from other SUs which are connected to other SBSs, i.e., I_{S,i} in (4). In addition, since both the CSA and the DSA do not consider the subcarrier allocation in the PN, signals from PUs may collide with the signal transmitted at the typical SU, and this collision is quantified by I_{P,i} in (5).
For the typical SU, the total instantaneous achievable rate is expressed as
In the following section, we will derive approximations of the average of C in (6) and confirm the tightness of the approximations in Section 5.
4 Performance analysis
4.1 Characteristics of transmit powers at SUs
From [20, Prop. 1], for the βGPP \(\Phi _{P} = \{ {\mathbf {y}}_{k} \}_{k \in {\mathbb N}}\), the set \(\left \{ \ {\mathbf {y}}_{k} \^{2} \right \}_{k \in {\mathbb N}}\) follows the same distribution as the set Ξ_{P} constructed from a sequence \(B_{P,i} \sim {\mathcal G}\left (i,\beta /(\pi \lambda _{P}) \right)\) of independent random variables by deleting each B_{P,i} independently and with probability 1−β, where \({\mathcal G}(a,b)\) denotes a gamma random variable with shape parameter a and scale parameter b. As the βGPP is stationary [18], the characteristics of P_{S,x} are invariant to the location x. Thus, for brevity of presentation, we omit the subscript x. We introduce the CDF and PDF of transmit power P_{S} in (1) in the following lemma.
Lemma 1
The CDF of P_{S} in (1) is expressed as
where \(\gamma (a,b) = \int _{0}^{b} t^{a1} e^{t} dt\) and \(\Gamma (a) = \int _{0}^{\infty } t^{a1} e^{t} d t\) denote the lower incomplete gamma function and gamma function, respectively. The PDF of P_{S} is given by
where \(a_{k}(x) \triangleq 1  \frac {\beta }{\Gamma (k)} \gamma \left (k, \pi \lambda _{P} x^{2/\alpha _{P}}/\left (\beta \tau ^{2/\alpha _{P}}\right) \right)\).
Proof
See See Appendix A. □
From the expression (7), we can see that the CDF of P_{S} is an increasing (or a decreasing) function of λ_{P} (or τ), and this indicates that the transmit power P_{S} gets smaller as λ_{P} grows and τ decays. When the maximum available transmit power is considered for SUs, the CDF of P_{S} in (2) is represented as
and the corresponding PDF is given by
where \(\varphi = \prod _{k=1}^{\infty }\! \left (1 \,\, \frac {\beta }{\Gamma (k)} \gamma \left (k, \frac {\pi \lambda _{P} P_{{\text {max}}}^{2/\alpha _{P}}}{ \beta \tau ^{2/\alpha _{P}}} \right) \! \right)\) and \({\mathbbm 1}(\cdot)\) is the indicator function.
Now, let us look at the case where the spatial distribution of the PBSs follows a homogeneous PPP with intensity λ_{P}, i.e., β→0. Note that for a sufficiently small positive value ω and for δ>0, −(1+δ)ω≤ ln(1−ω)≤−ω. Let us define \(\bar {a}_{k}(x) \triangleq 1  a_{k}(x) = \frac {\beta }{\Gamma (k)} \gamma \left (k, \pi \lambda _{P} x^{2/\alpha _{P}}/\left (\beta \tau ^{2/\alpha _{P}}\right) \right)\). Then, since \(\bar {a}_{k}(x) \rightarrow 0\) as β→0 for all \(k \in {\mathbb N}\), when β→0, we get
By letting δ→0, we have
which is the same with the result for the homogeneous PPP [22]. In addition, by differentiating \(F_{P_{S}}(x)\) with respect to x, the PDF of P_{S} is given by
Each PU may adjust its transmit power based on the distance between the PU and its associated PBS. In this case, the CDF and PDF of transmit powers at PUs can be derived in the same manner as in Lemma 1. Then, the corresponding SU uplink achievable rate can be identified by utilizing the obtained PDF of the transmit powers at the PUs. The goal of this paper is to investigate the impacts of the power control scheme at SUs and the subcarrier allocation methods at the SN on the SU uplink achievable rate. Therefore, we have not considered the power control at the PUs in this paper, and more sophisticated performance analysis for the networks with power controls at both SUs and PUs is left for future work.
4.2 Analysis
Denote the total average achievable rate by \(\hat {C} \triangleq {\mathbb E}[C]\). Then, from the fact \({\mathbb E}\left [ q(X) \right ] = q(0) + \int _{0}^{\infty } \frac {\partial q(u)}{\partial u} {\mathbb P}\left (X \geq u \right) d u\) for a nonnegative and monotonically increasing function q(·), we have
Note that as each SU adjusts its transmit power based on the distance to its closest PBS, transmit powers at all SUs {P_{S,x}} are dependent on the locations of PBSs Φ_{P}, and this introduces correlation among the powers {P_{S,x}} and correlation between I_{S,i} and I_{P,i}. For analytical tractability, we assume that the transmit powers at SUs {P_{S,x}} are independent with each other, and I_{S,i} and I_{P,i} are independent. Thus, we obtain
where (a) follows from the fact that the CDF of an exponential random variable X with mean ρ is \({\mathbb P}(X< x) = 1  \exp (x / \rho)\), f_{r}(r)=2πλ_{S}r exp(−πλ_{S}r^{2}) is the PDF of the distance from the typical SU and the tagged SBS [22], \(f_{P_{S}}(p)\) is the PDF of the transmit powers at SUs in (8) or (10), and \({\mathcal L}_{X}(t) \triangleq {\mathbb E}\left [ \exp (tX)\right ]\) denotes the Laplace transform of a random variable X.
Before deriving analytical expressions for the Laplace transforms \({\mathcal L}_{I_{S,i}}\) and \({\mathcal L}_{I_{P,i}}\), we examine the point processes \(\Phi _{S,i}^{(u)}\) in (4) and \(\Phi _{P,i}^{(u)}\) in (5). For a PBS, the average number of associated PUs is \(\lambda _{P}^{(u)}/\lambda _{P}\). Since each PU utilizes N_{P} subcarriers and each subcarrier is allocated to at most one PU, the intensity of \(\Phi _{P,i}^{(u)}\) is
For the same reason, when the CSA method is adopted at the SN, the intensity of \(\Phi _{S,i}^{(u)}\) can be expressed as
On the other hand, when the DSA method is employed at the SN, the intensity of \(\Phi _{S,i}^{(u)}\) is equal to
However, since the points in \(\Phi _{P,i}^{(u)}\) (or \(\Phi _{S,i}^{(u)}\)) are relevant to the Voronoi tessellation induced by Φ_{P} (or Φ_{S}), the points are correlated, and hence it is intractable to identify the exact distributions of \(\Phi _{S,i}^{(u)}\) and \(\Phi _{P,i}^{(u)}\). To circumvent this difficulty, we approximate \(\Phi _{P,i}^{(u)}\) and \(\Phi _{S,i}^{(u)}\) as homogeneous PPPs with intensities \(\tilde {\lambda }_{P}^{(u)}\) and \(\tilde {\lambda }_{\mathrm {S,CSA}}^{(u)} \left (\text {or}\ \tilde {\lambda }_{\mathrm {S,CSA}}^{(u)}\right)\), respectively.
Due to the stationarity of the homogeneous PPP, the Laplace transform \({\mathcal L}_{I_{P,i}}\) can be approximated as
where (b) follows from the independence between Φ_{P,i} and g_{x,i}, (c) comes from the fact that the Laplace transform of an exponential random variable X with mean ρ is \({\mathcal L}_{X}(t) = 1/(1+\rho t)\), and (d) is due to the PPP probability generating functional (PGFL) [22].
Before examining the Laplace transform \({\mathcal L}_{I_{S,i}}(t)\), let us compare I_{S,i} in the cases with the DSA and the CSA. When the DSA is applied, each SU chooses subcarriers independently with respect to other SUs. Thus, as illustrated in Fig. 1, the desired signal may collide not only with the signals from SUs associated with other SBSs but also with the signals from SUs connected to the tagged SBS. On the other hand, when the CSA is adopted, each SBS assigns orthogonal sets of subcarriers to its associated SUs. Hence, the desired signal does not collide with the signals from other SUs communicating with the tagged SBS as illustrated in Fig. 2.
We would like to mention that, in the previous works in [23–25], each transmitter adjusts its transmit power based on the distance between the transmitter and its intended receiver. Since both transmit power and desired signal term are determined by the distance between a transmitter and its receiver, it is tractable to characterize the performance of the networks in [23–25]. On the other hand, in underlay cognitive radio networks, transmit power at a SU is computed based on the distance between the SU and its nearest PBS, and the desired signal term is relevant to the distance between the SU and its closest SBS. Therefore, analyzing the performance of underlay cognitive radio networks is more challenging than those of the networks in [23–25].
In the following lemma, we derive an approximation of \({\mathcal L}_{I_{S,i}}(t)\) in the case with the CSA where the interfering SUs are located outside of the Voronoi cell of the tagged SBS.
Lemma 2
When the CSA is adopted, the Laplace transform of the interference from other SUs \({\mathcal L}_{I_{S,i}}(t)\) is approximated by
where \(\eta \triangleq \int _{0}^{\infty } q^{2/\alpha _{S}} f_{P_{S}}(q) d q\) and \(f_{P_{S}}(q)\) is the PDF of transmit power P_{S} in (8) or (10).
Proof
See See Appendix B. □
When the DSA is employed, unlike the case with the CSA, the interfering SUs can be located in the Voronoi cell of the tagged SBS. Hence, by changing the lower limit of the integral in (15) to zero and replacing \(\tilde {\lambda }_{\mathrm {S,CSA}}^{(u)}\) with \(\tilde {\lambda }_{\mathrm {S,CSA}}^{(u)}\), an approximation of the Laplace transform \({\mathcal L}_{I_{S,i}}(t)\) can be derived as
Finally, when the CSA (or DSA) is adopted, we can evaluate \(\hat {C}\) in (11) by plugging (12), (14), (15) (or (16)) into (11). From the derived analytical expressions, we can expect that \(\hat {C}\) is an increasing function of the number of available subcarriers N since an increase in N leads to decreases in the intensities of interfering users, i.e., \(\tilde {\lambda }_{\mathrm {S,CSA}}^{(u)}\), \(\tilde {\lambda }_{\mathrm {S,CSA}}^{(u)}\) and \(\tilde {\lambda }_{P}^{(u)}\). When N→∞, the Laplace transforms \({\mathcal L}_{I_{P,i}}\) and \({\mathcal L}_{I_{S,i}}\) in (12) become one since \(\tilde {\lambda }_{P}^{(u)}\), \(\tilde {\lambda }_{\mathrm {S,CSA}}^{(u)}\), and \(\tilde {\lambda }_{\mathrm {S,CSA}}^{(u)}\) converge to zero. In this case, if N_{S}/N→0, an increase of N_{S} leads to an enhanced total average achievable rate \(\hat {C}\) as the number of summations in (11) gets larger as N_{S} grows. Also, from the definitions of \(\tilde {\lambda }_{\mathrm {S,CSA}}^{(u)}\), \(\tilde {\lambda }_{\mathrm {S,CSA}}^{(u)}\), and \(\tilde {\lambda }_{P}^{(u)}\), we can infer that \({\mathbb P} \left (\gamma _{i} \geq u \right)\) in (12) decays as N_{S} and N_{P} get larger.
5 Simulation results
Next, we present numerical simulation results to validate our analytical results. Unless otherwise stated, we set α_{P}=α_{S}=4, P_{P}=20 dBm, σ^{2}=− 120 dBm, N = 128, N_{P} = 30, \(\lambda _{P}^{(u)} = 3 \times 10^{4}/\mathrm {m}^{2}\), \(\lambda _{S}^{(u)}~=~6 \times 10^{4}/\mathrm {m}^{2}\), and P_{max} = ∞. Figure 3 examines the CDFs of the transmit power at a SU for different values of β, λ_{P}, and τ. First of all, we observe that our analytical result in (7) is perfectly matched by the simulation results. Since the degree of repulsion among the locations of PBSs gets bigger as β increases, the locations of PBSs tend to be distributed more evenly when β is large. In this regard, the distance between a SU and its nearest PBS becomes smaller as β grows, and thus the transmit power at the SU decreases when β becomes higher as shown in Fig. 3. In addition, as expected from (1) and (7), the transmit powers at SUs decay when λ_{P} increases and τ gets smaller. This phenomenon can also be explained by the fact that an increase of λ_{P} results in a decrease of the distance between a SU and its closest PBS.
In Fig. 4, we present the total average SU achievable rate \(\hat {C}\) in (11) when λ_{P}=5×10^{−5}/m^{2}, N_{S}=10, and the DSA is adopted. From Fig. 4, we infer that our analytical result predicts well \(\hat {C}\). Since a larger λ_{S} leads to a smaller distance between a typical SU and its associated SBS, \(\hat {C}\) gets higher when λ_{S} grows. On the other hand, from (1), the SINR γ_{i} (3) is an increasing function of τ, and thus \(\hat {C}\) becomes larger when τ increases as observed in Fig. 4. Note that, since transmit power at a SU is a decreasing function of β, both P_{S,o} and {P_{S,x}} in (3) get higher as β decays, and thus it is difficult to analytically identify the impact of β on \(\hat {C}\). Instead, under the assumption that the influences of β on P_{S,o} and {P_{S,x}} are the same, we can infer that the SINR γ_{i} in (3) will be decreased with β. From Fig. 4, it is seen that \(\hat {C}\) decays as the degree of repulsion among the PBSs grows, i.e., β→1.
Figure 5 illustrates the total average SU achievable rate \(\hat {C}\) in (11) for different values of P_{max} and α_{P} when λ_{P}=5×10^{−5}/m^{2}, N_{S}=10 and the DSA is employed. It is shown that \(\hat {C}\) is enhanced when P_{max} or α_{P} becomes bigger since the transmit powers at SUs are increased with P_{max} and α_{P}. Also, we can observe that \(\hat {C}\) is sensitive to P_{max} when α_{P} is large as the SUs are more likely to use the maximum transmit power P_{max} when α_{P} is high.
Figure 6 demonstrates the total average SU achievable rate \(\hat {C}\) in (11) for the case where β=1, λ_{P}=5×10^{−5}/m^{2}, and λ_{S}=10^{−4}/m^{2}. First, it is shown that \(\hat {C}\) is enhanced when the CSA method, which mitigates the interferences from other SUs, is applied at the SN. As the total SU achievable rate \(\hat {C}\) is the sum of capacities for each subcarrier as seen in (6), \(\hat {C}\) grows as the number of subcarriers for each SU N_{S} increases. On the other hand, the desired signal is more likely to collide with signals from other SUs as N_{S} becomes higher. Hence, when N_{S} is large, \(\hat {C}\) is sensitive to the subcarrier allocation methods, i.e., the gap between the capacities with the CSA and the DSA gets bigger as N_{S} grows.
In Fig. 7, we evaluate the total average SU achievable rate \(\hat {C}\) in (11) for difference values of λ_{P} when β=1, λ_{S}=10^{−4}/m^{2}, and N_{S}=10. From Fig. 7, we can infer that our analytical results are well matched with the simulated results and the performance is improved when the CSA is adopted at the SN. As observed from Fig. 3, the transmit powers at SUs decay when λ_{P} is large. Moreover, since \(\tilde {\lambda }_{P}^{(u)}\) in (13) is a nondecreasing function of λ_{P}, the interference from PUs increases as λ_{P} becomes larger. In this regard, the SU achievable rate \(\hat {C}\) gets lower as λ_{P} grows.
6 Conclusions
This paper studied an underlay OFDMbased CRN where the locations of PBSs are modeled as a βGPP. The scenario where the SUs control their transmit powers to alleviate the inferences at the PBSs is considered. Also, two types of subcarrier allocation techniques are considered depending on whether the subcarriers for the SN are allocated in a centralized manner or not. First, we have identified the characteristics of the transmit powers at SUs. Then, we have derived approximations of the total average SU achievable rate and verified the tightness of the approximations via numerical simulations. In addition, from simulations, we have observed that the transmit power at SUs and the SU achievable rate become smaller as the degree of repulsion among the PBS increases, and that the SU achievable rate is enhanced when the centralized subcarrier allocation method is applied at the SN.
7 Appendix A Proof of Lemma 1
From the definition of P_{S} in (1), the CDF of P_{S} is derived as follows:
where (e) follows from the fundamental property of the βGPP and (f) comes from the fact that the CDF of a gamma random variable \(X \sim {\mathcal G}(a,b)\) is \({\mathbb P}(X < x) = \gamma (a,x/b)/\Gamma (a)\).
By differentiating \(F_{P_{S}}(x)\) in (17) with respect to x, we obtain the PDF of P_{S}:
where \(a_{k}(x) \triangleq 1  \frac {\beta }{\Gamma (k)} \gamma \left (k, \pi \lambda _{P} x^{2/\alpha _{P}}/(\beta \tau ^{2/\alpha _{P}}) \right)\).
8 Appendix B Proof of Lemma 2
Note that, in the uplink scenario, ∥y∥ is not always smaller than the distances between the tagged SBS and interfering SUs, i.e., ∥x−y∥ for \({\mathbf {x}} \in \Phi _{S,i}^{(u)} \setminus o\). In addition, since the transmit powers at SUs (P_{S,o} and P_{S,x}) depend on the distribution of PBSs Φ_{P}, the average power of the desired signal \(\phantom {\dot {i}\!}P_{S,o} \ {\mathbf {y}} \^{\alpha _{S}}\) is not always larger than the average interference power \(\phantom {\dot {i}\!}P_{S,{\mathbf {x}}} \ {\mathbf {x}}  {\mathbf {y}} \^{\alpha _{S}}\) for \({\mathbf {x}} \in \Phi _{S,i}^{(u)} \setminus o\). In such a scenario, deriving the exact expression for \({\mathcal L}_{I_{S,i}}(t)\) is intractable. To circumvent this difficulty, we assume that the weighted Voronoi cell of the tagged SBS for the typical SU is a ball with radius \(\phantom {\dot {i}\!}P_{S,o} \ {\mathbf {y}} \^{\alpha _{S}}\), i.e., \(\phantom {\dot {i}\!}P_{S,o} \ {\mathbf {y}} \^{\alpha _{S}} > P_{S,{\mathbf {x}}} \ {\mathbf {x}}  {\mathbf {y}} \^{\alpha _{S}}\) for \(\phantom {\dot {i}\!}{\mathbf {x}} \in \Phi _{S,i}^{(u)} \setminus o\). Then, an approximation of I_{S,i} is expressed as follows:
Our approximation (18) only takes into account the interfering signals whose powers are larger than the power of the desired signal, and thus the approximation can be interpreted as a lowerbound of I_{S,i}.
By leveraging the approximation in (18), the following derivations can be established:
where (g), (h), and (i) follow from the approximation in (18), the stationarity of the homogeneous PPP and the assumption that the transmit powers {P_{S,x}} are independent, respectively. Also, (j) and (k) are due respectively to the PGFL of the homogeneous PPP and the variable change \(\phantom {\dot {i}\!}y= x(tq)^{1/\alpha _{S}}\), where \(\eta \triangleq \int _{0}^{\infty } q^{2/\alpha _{S}} f_{P_{S}}(q) d q\).
Notes
In this paper, nonrandom N_{P} and N_{S} are considered for analytical tractability. An extension to networks with randomly varying N_{P} and N_{S} is outside the scope of this paper and represents an interesting problem.
Abbreviations
 AWGN:

Additive white Gaussian noise
 CDF:

Cumulative distribution function
 CRN:

Cognitive radio networks
 CSA:

Centralized subcarrier allocation
 DSA:

Decentralized subcarrier allocation
 GPP:

Ginibre point process
 OFDM:

Orthogonal frequency division multiplexing
 PBS:

Primary base station
 PDF:

Probability density function
 PGFL:

Probability generating functional
 PN:

Primary network
 PPP:

Poisson point process
 PU:

Primary user
 SBS:

Secondary base station
 SINR:

Signaltointerferenceplusnoise ratio
 SN:

Secondary network
 SU:

Secondary user
References
H. A. Mahmoud, T. Yucek, H. Arslan, OFDM for cognitive radio: Merits and challenges. IEEE Wireless Commun. 16(2), 6–15 (2009).
D. C. Popescu, D. R. Joshi, O. A. Dobre, in Proc. IEEE Asilomar Conf. Signals, Syst., Comput.Spectrum allocation and power control in OFDMbased cognitive radios with target SINR constraints (IEEEPacific Grove, 2010).
J. Yuan, M. Torlak, in Proc. IEEE Int. Wireless Commun. Mobile Comput. Conf. (IWCMC). Optimization of throughput and autonomous sensing in random access cognitive radio networks (IEEEIstanbul, 2011).
S. Ekin, M. M. Abdallah, K. A. Qaraqe, E. Serpedin, Random subcarrier allocation in OFDMbased cognitive radio networks. IEEE Trans. Signal Process. 60(9), 4758–4774 (2012).
S. Ekin, M. M. Abdallah, K. A. Qaraqe, E. Serpedin, A study on intercell subcarrier collisions due to random access in OFDMbased cognitive radio networks. IEEE Trans. Commun. 61(5), 1695–1707 (2013).
G. A. S. Sidhu, F. Gao, W. Wang, W. Chen, Resource allocation in relayaided OFDM cognitive radio networks. IEEE Trans. Veh. Technol. 62(8), 3700–3710 (2013).
D. Darsena, G. Gelli, F. Verde, An opportunistic spectrum access scheme for multicarrier cognitive sensor networks. IEEE Sensors J. 17(8), 2596–2606 (2017).
H. A. Shah, I. Koo, A novel physical layer security scheme in OFDMbased cognitive radio networks. IEEE Access. 6:, 29486–29498 (2018).
M. G. Khoshkholgh, N. M. Yamchi, K. Navaie, H. Yanikomeroglu, V. C. M. Leung, K. G. Shin, Radio resource allocation for OFDMbased dynamic spectrum sharing: Duality gap and time averaging. IEEE J. Sel. Areas Commun. 33(5), 848–864 (2015).
M. Chami, M. Pischella, D. L. Ruyet, Resource allocation for OFDMbased multiuser cooperative underlay cognitive systems. EURASIP J. Wirel. Commun. Netw. 2017(1), 180 (2017).
H. ElSawy, E. Hossain, M. Haenggi, Stochastic geometry for modeling, analysis, and design of multitier and cognitive cellular wireless networks: A survey. IEEE Commun. Surv. Tuts. 15(3), 996–1019 (2013).
C. H. Lee, M. Haenggi, Interference and outage in Poisson cognitive networks. IEEE Trans. Wirel. Commun. 11(4), 1392–1401 (2012).
G. Yuchen, N. Kai, L. Jiaru, Stochastic geometric analysis of the uplink throughput in cognitive radio cellular networks. China Commun. 10(8), 44–53 (2013).
S. R. Sabuj, M. Hamamura, Uplink modeling of cognitive radio network using stochastic geometry. Perform. Eval. 117:, 1–15 (2017).
S. Weber, J. G. Andrews, N. Jindal, An overview of the transmission capacity of wireless networks. IEEE Trans. Commun. 58:, 3593–3604 (2010).
A. Guo, M. Haenggi, Spatial stochastic models and metrics for the structure of base stations in cellular networks. IEEE Trans. Wirel. Commun. 12(11), 5800–5812 (2013).
S. R. Cho, W. Choi, Energyefficient repulsive cell activation for heterogeneous cellular networks. IEEE J. Sel. Areas Commun. 31:, 870–882 (2013).
A. Goldman, The Palm measure and the Voronoi tessellation for the Ginibre process. Ann. Appl. Probab. 20(1), 90–128 (2010).
N. Miyoshi, T. Shirai, Cellular networks with αGinibre configurated base stations. The Impact of Applications on Mathematics (Springer, New York, 2014).
N. Deng, W. Zhou, M. Haenggi, The Ginibre point process as a model for wireless networks with repulsion. IEEE Trans. Wirel. Commun. 14(1), 107–121 (2015).
I. Nakata, N. Miyoshi, Spatial stochastic models for analysis of heterogeneous cellular networks with repulsively deployed base stations. Perform. Eval. 78:, 7–17 (2014).
M. Haenggi, Stochastic geometry for wireless networks (Cambridge Univ. Press, Cambridge, 2012).
H. ElSawy, E. Hossain, On stochastic geometry modeling of cellular uplink transmission with truncated channel inversion power control. IEEE Trans. Wirel. Commun. 13:, 4454–4469 (2014).
H. ElSawy, A. SultanSalem, M. S. Alouini, M. Z. Win, Modeling and analysis of cellular networks using stochastic geometry: A tutorial. IEEE Commun. Surv. Tuts. 19:, 167–203 (2017).
T. D. Novlan, H. S. Dhillon, J. G. Andrews, Analytical modeling of uplink cellular networks. IEEE Trans. Wirel. Commun. 12:, 2669–2679 (2013).
Acknowledgements
This work was supported by NSF EARS Award No. 1547447.
Funding
This work was supported by NSF EARS Award No. 1547447.
Author information
Authors and Affiliations
Contributions
ES and KQ proposed the conception of subcarrier allocation methods of the study. HBK and SE contributed to the analysis and simulation. All authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare that they have no competing interests.
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Kong, HB., Ekin, S., Serpedin, E. et al. Uplink achievable rate in underlay random access OFDMbased cognitive radio networks. J Wireless Com Network 2019, 22 (2019). https://doi.org/10.1186/s136380191339y
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/s136380191339y
Keywords
 Orthogonal frequency division multiplexing
 Cognitive radio
 Random access
 Underlay network
 Stochastic geometry