Printer Friendly

Qos-guaranteed capacity of centralized cognitive radio networks with interference averaging techniques.

1. Introduction

Radio spectrum is a precious natural resource, the use of which is strictly licensed by governments. Because most of the usable spectrum is already licensed to the incumbents, it is becoming increasing difficult to find more spectrum to accommodate the exploding wireless data traffics. However, numerous spectrum monitoring measurements have shown that, in most of the time, many licensed frequency bands remain underutilized [1]-[3]. As a result, cognitive radio (CR) [4]-[6] has been proposed to improve spectrum utilization by "recycling" underutilized licensed spectrum. A CR network operating as a secondary network can exploit the radio spectrum by collectively sensing the radio environment and adaptively adjusting its radio parameters without harming the service of primary networks.

CR networks can be roughly classified into three types: interweave CR, underlay CR and overlay CR networks [7]. In the interweave CR networks, the CR (secondary) user transmits in spectrum holes [5] that are not in use by the licensed (primary) users. In this case, the CR networks coexist with the primary system by operating with orthogonal radio resources. In the underlay CR networks, a very tight transmit power constraint is imposed on CR transmitters to ensure that the interference caused by CR systems is below the noise floor and hence negligible. An underlay network (e.g., ultra-wideband system) typically requires a large bandwidth to compensate for the very low transmit power. In the overlay CR networks, the CR can cause significant interference at the primary receiver, under the condition that the performance degradation at the primary receiver is carefully managed by imposing certain interference constraints, such as peak interference power constraint (e.g., [8][9]), average interference power constraint(e.g., [8]-[10]), and interference outage constraint (e.g., [11]). Compared with interweave CR networks, overlay CR networks have the potential to exploit more spectrum resources (i.e., secondary networks can overlap with primary networks in the same time, frequency, and space). Compared with underlay CR networks, overlay CR networks have the potential to transmit with much greater power. Therefore, the overlay networks represent the "true coexistence" and can achieve better spectrum utilization.

In this paper, we restrict our study to overlay CR networks. More specifically, our studies focus on overlay CR networks with interference outage constraints, which limits the probability that the interference signal power exceeds a certain threshold. Unlike peak and average interference power constraints, the outage constraint takes into account the stochastic nature of radio interference. Therefore it is more appropriate when the quality of service (QoS) of the primary system depends on the instantaneous signal to interference and noise ratio (SINR) (e.g., delay sensitive communication services) [11].

In wireless communication networks, it is an important task to guarantee certain QoS for the users, especially for users with real time services. This task, however, is very challenging because of the random variations in channel conditions and the resulting random fluctuations in received SINRs [12]. The situation is much more exasperated in wireless CR networks due to other factors such as the unpredictable activity of primary users and the availability of CR channels [13][14]. To provide guaranteed QoS in CR networks, much work have been explored through various methods such as routing design (e.g., [15]), MAC design (e.g., [16]), spectrum management (e.g., [17][18]) and power control [13]. These works, however, mostly focus on interweave CR networks. Moreover, these works are restricted to a particular aspect of system design and do not address the fundamental capacity limits of CR networks.

Capacity studies are important to understand the fundamental limits and long- term potential of overlay CR networks. The capacity upper bounds can be used as the first guideline for planning CR networks, e.g., for estimating its range, finding potential applications, and choosing operating frequencies (coexisting primary systems), before substantial efforts are invested to develop a full system. The capacity study of overlay CR networks has a combinatorial nature. A focused study can be performed for different types of networks (centralized or ad-hoc), with different types of interference constraints (peak, average, or outage constraints), at different levels (link, cell, or system levels), and using different capacity metrics (average capacity, outage capacity, bandwidth-guaranteed capacity, effective capacity, or transport capacity). Although there exists a substantial literature devoted to the capacity study of CR networks, all possible combinations of the above aspects have not been thoroughly investigated. The novelty of our work lies in filling in the research gap of the following combination: centralized, outage interference constraint, cell level, and bandwidth-guaranteed capacity. To our best knowledge, this is the first and only work that considers bandwidth-guaranteed capacity of centralized overlay CR system.

The capacity of overlay CR networks was investigated in [19] for a special case (GSM uplink band) under peak interference power constraints and in [10] [20] under averaged-interference power constraints. However, the work in [10][19][20] did not address the case of interference outage constraint. In [12][14][21], S. Akin and M. C. Gursoy have extended the former research to the study of effective capacity [22] of QoS- guaranteed CR networks, but their works are also limited to the case of averaged-interference power constraints. Moreover, no closed-from capacity formula was provided. To our best knowledge, the capacity of QoS guaranteed overlay CR networks under interference outage constraints has rarely been investigated.

In this paper, we study a single CR cell with multiple CR users and one CR base station (BS). Our goal is to investigate the uplink system capacity of such a CR network under two constraints: (1) the interference outage constraint at primary users and (2) the QoS constraint for each CR user. Our contributions are summarized as follows. First, we propose a centralized CR network that uses interference averaging techniques to support QoS-guaranteed traffic under interference outage constraints. The closed-form capacity of such a CR network for non-fading channels is derived for the first time. Second, for the above CR network, we provide a theoretical framework to facilitate systematic investigation on the impacts of outage probability limit, channel fading and relative location of primary users in the cell on the system capacity. The accuracy of the theoretical framework is validated by Monte Carlo simulations. We further use an example to demonstrate the useful application of our theoretical frameworks for the strategic planning of centralized CR networks. Important guidelines for deploying the proposed networks in a practical band are provided.

The rest of this paper is organized as follows. The system model is introduced in Section 2. Section 3 studies the system capacities of the CR networks designed to support QoS guaranteed traffics. Numerical results, simulation results, and discussions are presented in Section 4. Finally, conclusions are drawn in Section 5.

2. System Model

2.1 Coexistence Scenario and Channel Model

The coexistence scenario we considered is shown in Fig. 1, where primary users (illustrated as disk antennas) and CR users (illustrated as mobile phones) coexist on a plane. We consider a centralized circular CR cell with a BS located at the center and N CR users uniformly distributed within the cell. The cell radius is denoted as R. In this paper, we consider the uplink capacity analysis of the CR cell, while the same approach can be extended for downlink analysis.

The interference outage constraint can be specified in two cases. In the first case, the CR network is unaware of the location of primary receivers. Therefore, the interference outage constraint should be applied to any point within the cell. In the second case, if the exact locations of the primary users are known, the interference outage constraint can be applied only to the primary user locations. Without loss of generality, we focus on an arbitrary primary receiver within the cell. This primary receiver is illustrated as a disk antenna in Fig. 1. The distance from the primary receiver to the CR BS is denoted as r (0 [less than or equal] r [less than or equal] R).

2.2 Channel Model

The channels from the CR transmitters to the primary receivers are referred to as interference channels. The instantaneous channel power gains from the jth (1 [less than or equal] j [less than or equal] N) CR user to the ith (1 [less than or equal] i [less than or equal] [infinity]) primary receiver is denoted as [h.sup.I.sub.ij]. On the other hand, the channels from the CR transmitters to the center BS are referred to as access channels. The instantaneous channel power gain from the jth CR user to the BS is denoted as [h.sup.A.sub.j]. All radio channels under consideration are narrowband channels (or single carriers of a multi-carrier system) and are assumed to be stationary and ergodic.

In previous works such as [10][20][23], only the path loss effect is considered in the channel, ignoring other effects of shadowing and fading. Although such an assumption is not very realistic, it is convenient since they often lead to elegant analytical results which can reveal important insights without over-complicating the problem. Considering only the path loss we have

[h.sup.I.sub.i,j] = [K.sub.I] / [([d.sup.I.sub.i,j]).sup.[alpha]] (1)

[h.sup.A.sub.j] = [K.sub.A] / [([d.sup.A.sub.j]).sup.[alpha]] (2)

where [K.sub.I] and [K.sub.A] are constants related to path loss and antenna gains in the interference and access channels, respectively, [d.sup.I.sub.i,j], is the distance between the ith primary receiver and the th CR transmitter, [d.sup.A.sub.j] is the distance between the jth CR transmitter and the BS, and [alpha] is the path loss exponent typically ranging from 2 to 5 [24].

If shadowing and fading are further taken into account, (1) and (2) should be modified as

[h.sup.I.sub.i,j] = [K.sub.I] [[xi].sup.I.sub.i,j] [[eta].sup.I.sub.i,j]/[([d.sup.I.sub.i,j]).sup.[alpha]] (3)

[h.sup.A.sub.j] = [K.sub.A] [[xi].sup.A.sub.j] [[eta].sup.A.sub.j]/[([d.sup.A.sub.j]).sup.[alpha]] (4)

where [[xi].sup.I.sub.i,j] [[eta].sup.I.sub.i,j] are random variables which model the effects of the shadowing and multipath fading in the interference channels, respectively. Similarly, [[xi].sup.A.sub.j] and [[eta].sup.A.sub.j] represent random shadowing and fading factors in the access channels, respectively. We assume that the shadowing factors [[xi].sup.I.sub.i,j] and [[xi].sup.A.sub.j] are mutually independent, each following a log-normal distribution with zero mean and a standard deviation [[sigma].sub.[xi]] ranging from 5 to 12 dB [24, pp. 99] with 8 dB being a typical value for macrocellular applications. We further assume that the fading factors [[eta].sup.I.sub.i,j] and [[eta].sup.A.sub.j] are also mutually independent and follow identical distributions [f.sub.[eta]](x). When Nakagami fading channels are assumed, the power gain fr (x) (squared-envelope) is given by a Gamma distribution [24, pp. 54]

[f.sub.[eta]](x) = [[[m.sup.m] [x.sup.m-1]]/[GAMMA](x)] exp (-mx), m [greater than or equal to] 1/2 (5)

where m is the Nakagami shape factor and [GAMMA]() denotes the gamma function.

Let [K.sup.I.sub.i,j] = [[xi].sup.I.sub.i,j] [[eta].sup.I.sub.i,j] and [K.sub.A] = [[xi].sup.A.sub.j] [[eta].sup.A.sub.j] denote the composite shadowing and fading factor of the interference channel and access channel, respectively. It follows that all [K.sup.I.sub.i,j] and [K.sup.A.sub.j] follow the same Gamma-log-normal distribution [24, pp. 102] whose probability density function (PDF) is denoted as [f.sub.k](x). Such a Gamma-log-normal distribution can be approximated by a log-normal distribution as [24, pp. 102]

[f.sub.k](x) [approximately equal to] [1/[K.sub.[epsilon]] [square root of [pi][sigma]x]] exp {[(10[log.sub.10] x - [mu]).sup.2]/2[[sigma].sup.2] (6)

In (6), the mean [mu] and variance [[sigma].sup.2] are given by [24]

[mu] = [K.sup.-1.sub.[epsilon]] [[psi](m) - ln (m)] (7)

[[sigma].sup.2] = [K.sup.-2.sub.[epsilon]] [zeta] (2, m) + [[sigma].sup.2.sub.[[xi]] (8)

respectively, where [K.sub.[epsilon]] = ln (10)/10 is a constant. In (7), [psi](*) is the Euler psi function given by [24] [psi] (m) = -[K.sub.Eu] + [[summation].sup.m-1.sub.k=1](1/k)(m = 1,2, ...), where [K.sub.Eu] [approximately equal to] 0.5772 is Euler's constant. In (8), [zeta] (*,*) is Riemann's zeta function given by [24] [zeta](2,m) [[summation].sup.[infinity].sub.k=0] 1/[(m+k).sup.2] (m = 1,2, ...).

When m = 1 (i.e., Rayleigh fading) the approximation in (6) is valid for [[sigma].sub.[xi]] > 6 dB, and for m > 2 the approximation is valid for all ranges of [[sigma].sub.[xi]] of interest [24].

2.3 Access Procedure and Interference Averaging

We assume that the CR network coexist with a primary system in a licensed frequency band. The licensed band is further divided into a number of orthogonal channels (e.g., subcarriers), each of which is subject to an interference outage constraint to protect the primary system. Without loss of generality, identical interference constraints are assumed for all channels. Multiple CR users are scheduled by the CR BS to transmit in orthogonal channels to avoid mutual interferences. Furthermore, frequency hopping is adopted as an interference averaging technique to protect the primary system. Fig. 2 illustrates a possible frequency hopping scheme of a six-user cell, where users are indexed by letters (a to f and time is divided into slots. Frequency hopping works in a way that the same frequency band is randomly allocated to different CR users within the cell in different time slots. In other words, a CR user hops to a different frequency channel is each time slot. Given that CR users are randomly distributed and frequency hopping is fast enough, the usage of a particular frequency band will be geographically randomized, thereby reducing the probability of interference outage to a particular primary receiver in a particular band.

When only one particular channel is under concern, we can consider an equivalent network that has only one (target) CR user, whose location is uniformly distributed within the cell and updates in every time slot. Since our subsequent analysis will deal with a single target CR user (with random locations) and a single primary receiver (with an arbitrary location), we can drop the CR user index i and primary receiver index j to simplify the notations.

2.4 Assumptions

The following assumptions are made for our subsequent analysis. First, we assume that a CR user have perfect knowledge of the channel between itself and the CR BS. Power control is used by a CR user to adjust its transmit power according to the instantaneous channel gain, so that a predefined SNR is maintained at the BS. Such a power control mechanism is similar to what has been widely applied in CDMA networks. Unlike many works in the literature (e.g., [10] [20] [25] [26]), we assume that a CR user does not have information about the interference channel (i.e., channel from CR user to primary receiver). We note that this is more realistic as most primary receivers are hidden terminals in practice.

Second, we assume that the maximum transmit powers for CR devices are very high. Therefore the transmit powers of CR users are always limited by the interference constraints rather than CR device capabilities. This assumption allows us to study the fundamental limit of CR system capacity, which is entirely constrained by primary networks. We note that such a dependence on the primary network is what distinguishes CR networks from conventional networks, and is therefore the focus of our study.

3. Capacity of QoS-Guaranteed CR Network

In this section, we study the system capacities of the CR networks designed to support QoS guaranteed traffics in non-fading channels and fading channels, respectively. The closed-form capacities in both cases are derived. Assume that a received power [Y.sub.0] is required at the CR BS to support certain QoS. We can then write

P = [Y.sub.0]/[h.sup.A] (9)

where P is the transmit power of the target CR user and [h.sup.A] is the access channel gain. The interference perceived by the primary receiver is given by

I = P[h.sup.I] = [Y.sub.0][h.sup.I] / [h.sup.A] (10)

where hI is the interference channel gain. Clearly, the interference I would appear to be a time-varying stochastic signal when we consider the location of the target CR user changes in every time slot. We further assume that in order to protect the primary services, the probability that I exceeds a threshold [I.sub.out] should be smaller than an outage probability limit [chi]. Such an interference outage constraint in turn imposes a limit on [Y.sub.0] and allows us to express the capacity

C = [log.sub.2] (1 + [Y.sub.0]/[[OMEGA].sub.0],) (11)

as a deterministic function of [I.sub.out] and [chi]. In (11), [[OMEGA].sub.0] denotes the total interference and noise power perceived at the BS.

3.1 Capacity for Non-fading Channels

Here we consider only the path loss and aim to express C in (11) as a closed- form function of [I.sub.out] and [chi]. First, we need to obtain the PDF/CDF of the interference I. Substituting (1) and (2) into (10) we get

I = [Y.sub.0] [K.sub.I]/[K.sub.A] ([d.sup.A]/[d..sup.I]) (12)

where [K.sub.I] and [K.sub.A] are constants related to path loss and antenna gains in the interference and access channels, respectively, [d.sup.I] is the distance between the target CR transmitter and the primary receiver, [d.sup.A] is the distance between the target CR transmitter and the BS. In (12), [d.sup.A] and [d.sup.I] are correlated random variables, making it difficult to directly calculate the interference distribution. To solve the problem, let us define a new random variable, U = [([d.sup.I]/[d.sup.A]).sup.2], the CDF of U can be derived as (see Appendix)

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (13)

where k = r/R (0 [less than or equal to] k [less than or equal to] 1) and arccos (*) is the inverse cosine function. In (13), [theta] and [[theta].sub.2] are given by

[[theta].sub.1] = arccos ([(1 - x).sup.2] + [k.sup.2] - x[k.sup.2]/2k[absolute value of 1 - x]) (14)

[[theta].sub.2] = arccos (x[k.sup.2] + [k.sup.2] - [(1 - x).sup.2]/2[k.sup.2] [square root of x] (15)

respectively. For convenience in subsequent derivation, let us rewrite (12) in the dB scale

[(I).sub.dB] = [([Y.sub.0]).sub.bB] - [([K.sub.A]).sub.dB] + [([K.sub.I]).sub.dB] - [(V).sub.dB] (16)

where [(I).sub.dB] = 10[log.sub.10]I, [([K.sub.A]).sub.dB] = 10[log.sub.10] [K.sub.A], ([K.sub.I]) = 10[log.sub.10] [K.sub.I], = 10[log.sub.10] [Y.sub.0], and [(V).sub.dB] = [5[alpha][log.sub.10]U. Using the transformation of random variables [27], the CDF of [(V).sub.dB] can be written as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (17)

From (16) and (17), we can easily obtain the CDF of [(I).sub.dB] as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (18)

We now consider an interference outage constraint which specifies that [(I).sub.dB] should not exceed a threshold ([I.sub.out]) = 10[log.sub.10] [I.sub.out] with an outage probability of [chi], namely

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (19)

Substituting (18) into (19) we get

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (20)

where [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] is the inverse function of [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] given by (17). From (20) we can see that the maximum received signal power at the secondary BS is bounded by a function of the interference outage constraint parameters [I.sub.out] and [chi]. The uplink capacity is then given by

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (21)

where [([[OMEGA].sub.0]).sub.dB] = 10[log.sub.10] [[OMEGA].sub.0] is the total interference and noise power perceived at the BS in the dB scale.

3.2 Capacity for Fading Channels

Substituting (3) and (4) into (10) and dropping the user indices we have

I = [Y.sub.0] [K.sub.I]/[K.sub.A] [([d.sup.A]/[d.sup.I])sup.[alpha]] [K.sub.I]/[K.sub.A]. (22)

In the dB scale (22) can be written as

[(I).sub.dB] = [([Y.sub.0]).sub.dB] - [([V.sub.0]).sub.dB] + [([K.sub.I]).sub.dB] - [([K.sub.A]).sub.dB] + [([K.sup.I].sub.dB] - [(K.sup.A).sub.dB] (23)

where [(I).sub.dB], [([Y.sub.0]).sub.dB], and [([V.sub.0]).sub.dB] are given in (16), [([K.sup.I].sub.dB] and [(K.sup.A).sub.dB] are corresponding dB values of [K.sup.I] and [K.sup.A], respectively. In (23), [(V).sub.dB] is a random variable whose PDF [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] can be obtained by taking the derivative of its CDF [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] given by (17). In addition, [([K.sup.I]).sub.dB] and [([K.sup.A]).sub.dB] are independent Gaussian random variables. Let us define [(T).sub.dB] = -[(V).sub.dB] + [([K.sup.I]).sub.dB] - [([K.sup.A]).sub.dB]. Its PDF [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] be obtained numerically as the convolution of the individual PDFs of [(V).sub.dB], [([K.sup.I]).sub.dB], and [([K.sup.A]).sub.dB]. From [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII], we can get the corresponding CDF [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] through numerical integration. Since [([I.sub.out]).sub.dB] = [(P).sub.dB] + [(T).sub.dB], it follows that the CDF of [([I.sub.out]).sub.dB] is related to [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] by

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. (24)

Considering the interference outage constraint specified in (19), from (24) it is easy to show that ([Y.sub.0])dB is bounded by

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (25)

where [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] is the inverse function of [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII]. We can then obtain the uplink cell capacity as

[MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] (26)

4. Numerical Results and Discussions

In this section, we present the capacities of the proposed CR networks designed to support QoS guaranteed traffics in realistic scenarios. As a practical application, we consider a fixed microwave communication (FMC) system as the primary network. FMC systems (e.g., fixed WiMax) are characterized by highly directive transmissions that, intuitively, present opportunities for other systems to share their spectrum. Non-hierarchical spectrum sharing with FMC systems has been considered in e.g., [28][29], for non-cognitive systems. Here we will consider (hierarchical) spectrum sharing in the new context of CR networks. It is interesting to note that interweave CR networks may not be able to operate in these bands because highly directive primary transmissions are difficult to be detected reliably. The overlay CR then becomes the only feasible CR system to exploit spectrum opportunities in these bands.

We assume an omnidirectional antenna at the CR BS and directional antenna at the primary receivers. Based on the practical parameters discussed in [28] we assume that [K.sub.A] / [K.sub.I] = 10, [I.sub.peak] / [OMEGA].sub.0] = 1, [I.sub.out] / [[OMEGA].sub.0] = 1, the path loss exponent [alpha] = 4, and the shadowing standard deviation [[sigma].sub.[xi]] = 8 dB. Three different channel configurations, i.e., the path loss-only model, the path loss-shadowing model, and the path loss-shadowing-fading models will be used for comparison purpose to reveal the impacts of shadowing and fading on the capacity.

First, as revealed by (13), it is important to note that the capacity is not dependent upon the absolute value of the cell radius R, but rather on the relative location of primary users in the cell k = r / R. Based on (21), Fig. 3 shows the capacity C as a function of [chi] for non-fading channels. As expected, the capacity increases with increasing outage limit [chi]. A bigger value of [chi] means that the primary network is more tolerant to the interference, thereby allowing the CR network to gain more capacity. Simulation results are shown to match well with the numerical results.

Changing to fading channel models, Fig. 4 shows the capacity C as a function of % based on (26). Again, good matches between numerical and Monte Carlo simulation results are observed. Comparing Fig. 4 with Fig. 3, we found that log-normal shadowing has a significant impact on the capacity. Furthermore, the impact of small scale fading on the capacity is investigated in Fig. 5. We choose an example r = 0.3R and vary the value of the Nakagami shape factor m to represent different small-scale fading scenarios. The case of m = 1 corresponds to Rayleigh fading. Small-scale fading is found to have a smaller impact on the capacity compared with shadowing. The reason is that, mathematically speaking, the Nakagami fading distributions have shorter tails than the log-normal shadowing distribution, and therefore have less impact on a outage-based metric.

In Figs. 3 and 4, the capacities are shown to be sensitive to the exact location of the primary receiver. In Fig. 3, primary receivers closer to the edge of the cell have greater impact on the capacity when the interference outage limit is small. When the outage limit increases, the receivers near the BS tend to limit the performance. This is because under the assumptions of power control and deterministic (non-fading) channels, primary receivers closer to the CR BS have smaller dynamic ranges of the received interference power, which translates to a flatter capacity curve under interference outage constraints. On the contrary, in Fig. 4, the interference has a large dynamic range due to channel fading, therefore the capacity curves change accordingly. Fig. 4 shows that the capacity is limited by the primary user with the shortest distance to the CR BS. In an extreme case, if the primary receiver is colocated with the CR BS, the system capacity will decrease to zero for non-zero [chi]. We note that when there are multiple primary users in the cell, the capacity is limited by the minimum value among all the capacity curves.

In summary, the following guidelines are provided for the CR network supporting QoS-guaranteed traffic. First, deployment of such CR networks in the FMC band seems feasible with the use of interference averaging techniques. Second, in non- fading channel scenarios (e.g., the primary receivers and CR BS are high raised to result in a high probability of light-of-sight (LoS) channels), Fig. 3 suggests that the location of the CR BS should be carefully chosen with respect to primary user locations and [chi] to maximize the system capacity. Third, in fading channel scenarios, Fig. 4 suggests that the CR BS location should be chosen to maximize its shortest distance to any primary receivers. Fourth, since the CR network performance is shown to depend heavily on the propagation environment (e.g., shadowing), scenario-specific network optimization would be important.

5. Conclusions

In this paper, we have proposed a centralized CR network with interference averaging techniques to support QoS-guaranteed traffic under interference outage constraints. The system capacities of the network have been analyzed at the single-cell level, taking into account all major system parameters (e.g., outage probability limit, channel fading and relative location of primary users). It has been found that the capacity is susceptible to the channel shadowing as well as the locations of primary users in the cell, but insensitive to the cell radius and small-scale fading. Numerical and simulation results have shown promising capacity potential for deploying QoS-guaranteed CR networks in the FMC bands. Important deployment guidelines have been discussed. We expect that the flexible analytical framework provided in this paper can be adopted for the strategic planning of a wide range of centralized CR networks.

Appendix: Derivation of (13)

In this Appendix, we wish to find the CDF [F.sub.U] (x) of the random variable U given by U = [([d.sup.I]/[d.sup.A]).sup.2], where [d.sup.A] and [d.sup.I] are distances from the target CR user to the CR BS and the primary user, respectively. As illustrated in Fig. 3, CR users are uniformly distributed in a circular CR cell of radius R. The BS is at the center of the cell and the distance between the primary user and the CR BS is r.

One approach to find the PDF of U is by using transformations of random variables. This approach, however, leads to a definite integral which cannot be solved in a closed-form. Instead, a geometry-based method will be introduced in this Appendix to give a closed-form expression of [F.sub.U] (x). First of all, as shown in Fig. 6, we put the CR network into a (x, y) coordinate system. The coordinates of the BS (point [O.sub.1]), primary user (point P) and CR user are given by (r /2,0), (-r /2,0), and (x,y), respectively. We consider this coordinate system as a probability plane corresponding to the location distribution of the CR users. Since the CR users are uniformly distributed within the circle [O.sub.1], the disk area [O.sub.1] has a probability density of 1/[R.sup.2] and elsewhere the probability density is zero.

Under this coordinate system, we have

U = [[[(x + r/2).sup.2] + [y.sup.2]]/[[(x - r/2).sup.2] + [y.sup.2]]]. (27)

The set of the points (x, y) that fulfill (27) forms a circle [O.sub.2] with an origin located at (- r/2(1+U/1-U),0) and a radius [TEXT NOT REPRODUCIBLE IN ASCII] [absolute value of 1 - U]. The CDF of U can be obtained by investigating the relationships between circle [O.sub.1] and circle [O.sub.2]. For convenience, let us denote k = r / R. With U increasing from 0 to [infinity], we have the following five stages:

1) When U increases from 0 to (1 - [k.sup.2]), circle [O.sub.2] starts as a small circle around point P and become a circle that internally tangents circle [O.sub.1]. The CDF [F.sub.U](x) is area of disk [O.sub.2] times the probability density, i.e., [F.sub.U] (x) = [TEXT NOT REPRODUCIBLE IN ASCII], x [member of] [0,[(1 - k).sup.2].

2) When U increases from [(1 - k).sup.2] to 1, circle [O.sup.2] intersects circle [O.sup.1]. The CDF [F.sub.U] (x) is the common area of circles [O.sub.1] and [O.sub.2], denoted as S, times the probability density, i.e., [F.sub.U](x) = S / [pi][R.sup.2], x [member of] [(1 - k).sup.2],1), where S can be easily obtained using basic geometry S = [[theta].sub.1][R.sup.2] + [[theta].sub.2] [TEXT NOT REPRODUCIBLE IN ASCII] ([[theta].sub.1]). Here, we have [[theta].sub.1] = arccos [([R.sup.2] + [D.sup.2] - [TEXT NOT REPRODUCIBLE IN ASCII])], [[theta].sub.2]= arccos [TEXT NOT REPRODUCIBLE IN ASCII] and D = r/[absolute value of 1 - x] is the distance between point [O.sub.1] and point [O.sub.2].

3) When U = 1, the CDF [F.sub.U](x) is the probability density times the area which is within circle [O.sub.1] and left to the y-axis. Using basic geometry we can get [F.sub.U](x) = arccos [r / (2R)], x = 1.

4) When U increases from 1 to [(1 + k).sup.2], circle [O.sub.2] intersects circle [O.sub.1]. The complementary CDF 1 - [F.sub.U] (x) is the common area S times the probability density. It follows that the CDF is given by [F.sub.U] (x) = 1 - S / ([pi][R.sup.2]), x [member of] (1, [(1 + k).sup.2]), where S is given in stage 2.

5) When U increases from [(1 + k).sup.2] to [infinity], circle [O.sub.2] is inside circle [O.sub.1] and gradually converges toward point [O.sub.2]. The complementary CDF 1 - [F.sub.U] (x) is given by the area of disk [O.sub.2] times the probability density. It follows that the CDF is given by Fu(x) = l-[TEXT NOT REPRODUCIBLE IN ASCII], x [member of] [(1 + k).sup.2], [infinity]). Finally, (13) can be obtained by summarizing the above five steps.

http://dx.doi.org/10.3837/tiis.2014.01.002

References

[1] FCC Spectrum Policy Task Force, "Report of the spectrum efficiency working group," Nov. 2002. [Online]. Article (CrossRef Link).

[2] FCC, "Facilitating opportunities for flexible, efficient, and reliable spectrum use employing cognitive radio technologies," NPRM & Order, ET Docket No. 03-108, FCC 03-322, Dec. 2003. Article (CrossRef Link).

[3] Federal Communications Commission, "Spectrum Policy Task Force," Rep. ET Docket no. 02-135, Nov. 2002. Article (CrossRef Link).

[4] I. F. Akyildiz, W. Y. Lee, M. C. Vuran, and S. Mohanty, "Next generation dynamic spectrum access/cognitive radio wireless networks: a survey," Computer Networks, vol. 50, no. 13, pp. 2127-2159, Sept. 2006. Article (CrossRef Link).

[5] S. Haykin, "Cognitive radio: brain-empowered wireless communications," IEEE J. Sel. Areas Commun., vol. 23, no. 2, pp. 201-220, Feb. 2005. Article (CrossRef Link).

[6] X. Hong, C.-X. Wang, H.-H. Chen, and Y. Zhang, "Secondary spectrum access networks," IEEE Vehi. Technol. Mag., vol. 4, no. 2, pp. 36-43, June 2008. Article (CrossRef Link).

[7] S. Srinivasa and S. A. Jafar, "The throughput potential of cognitive radio: a theoretical perspective," in Proc. of Fortieth Asilomar Conference on Signals, Systems and Computers, pp. 221-225, 2006. Article (CrossRef Link).

[8] M. Gastpar, "On capacity under receive and spatial spectrum-sharing constraints", IEEE Trans. Inform. Theory, vol. 53, no. 2, pp. 471-487, Feb. 2007. Article (CrossRef Link).

[9] A. Ghasemi and E. S. Sousa, "Capacity of fading channels under spectrum- sharing constraints," in Proc. of IEEE ICC'06, Istanbul, Turkey, June 2006, pp. 4373-4378. Article (CrossRef Link).

[10] C.-X. Wang, X. Hong, H.-H. Chen, and J. S. Thompson, "On capacity of cognitive radio networks with average interference power constraints," IEEE Trans. Wireless Commun., vol. 8, no. 4, pp. 1620-1625, Apr. 2009. Article (CrossRef Link).

[11] R. Menon, R. M. Buehrer, and J. H. Reed, "Outage probability based comparison of underlay and overlay spectrum sharing techniques," in Proc. of IEEEDySPAN'05, Baltimore, USA, Nov. 2005, pp. 101-109. Article (CrossRef Link).

[12] S. Akin and M. C. Gursoy, "QoS Analysis of Cognitive Radio Channels with Perfect CSI at both Receiver and Transmitter," in Proc. of IEEE Wireless Communications and Networking Conference (WCNC), 2010. Article (CrossRef Link).

[13] T. Wysocki and A. Jamalipour, "Mean-Variance Based QoS Management in Cognitive Radio", IEEE Trans. Wireless Commun., vol. 9, no. 10, pp. 3281-3289, 2010. Article (CrossRef Link).

[14] S. Akin and M. C. Gursoy, "Performance Analysis of Cognitive Radio Systems under QoS Constraints and Channel Uncertainty," IEEE Global Telecommunications Conference (GLOBECOM), 2010. Article (CrossRef Link).

[15] Q. He and H. Zhou, "Research on the Routing Algorithm Based on QoS Requirement for Cognitive Radio Networks," in Proc. of International Conference on Computer Science and Software Engineering, vol. 4, pp. 1114 - 1117, Dec. 2008. Article (CrossRef Link).

[16] V. Mishra, Lau Chiew Tong, S. Chan and J. Mathew, "MAC protocol for Two level QoS support in Cognitive Radio Network," in Proc. of International Symposium on Electronic System Design (ISED), Dec. 2011. Article (CrossRef Link).

[17] Shao-Yu Lien, Chih-Cheng Tseng, Kwang-Cheng Chen, and Chih-Wei Su, "Cognitive Radio Resource Management for QoS Guarantees in Autonomous Femtocell Networks," in Proc. of IEEE International Conference on Communications (ICC), May 2010. Article (CrossRef Link).

[18] Li-Chun Wang and Chung-Wei Wang, "Spectrum management techniques with QoS provisioning in cognitive radio networks," in Proc. of 5th IEEE International Symposium on Wireless Pervasive Computing (ISWPC), May 2010. Article (CrossRef Link).

[19] J. Gao, H. A. Suraweera, M. Shafi, and M. Faulkner, "Channel capacity of a cognitive radio network in GSM uplink band," in Proc. of IEEE Intl. Symp. Commun. Inform. Technol. (ISCIT), Sydney, Australia, Oct. 2007, pp. 1511-1515. Article (CrossRef Link).

[20] C.-X. Wang, H.-H. Chen, X. Hong, and M. Guizani, "Cognitive radio network management-tuning to real time conditions," IEEE Vehi. Technol. Mag., vol. 3, no. 1, pp. 28-35, Mar. 2008. Article (CrossRef Link).

[21] S. Akin and M. C. Gursoy, "Cognitive Radio Transmission under Interference Limitations and QoS Constraints," in Proc. of IEEE International Conference on Communications (ICC), May 2010. Article (CrossRef Link).

[22] D. Wu and R. Negi, "Effective capacity: a wireless link model for support of quality of service", IEEE Trans. Wireless Commun., vol.2, no. 4, pp. 630-643, July 2003. Article (CrossRef Link).

[23] S. A. Jafar and S. Srinivasa, "Capacity limits of cognitive radio with distributed and dynamic spectral activity," IEEE. J. Sel. Areas Commun. vol. 25, no. 3, pp. 529-537, Apr. 2007. Article (CrossRef Link).

[24] G. L. Stuber, Principles of Mobile Communication, 2nd Edition, Boston: Kluwer Academic Publishers, 2001.

[25] X. Gong, S. A. Vorobyov, and C. Tellambura, "Optimal bandwidth and power allocation for sum ergodic capacity under fading channels in cognitive radio networks," IEEE Trans. Signal Processing, vol. 59, no. 4, pp. 1814-1826, April 2011. Article (CrossRef Link).

[26] W. Wang, W. Wang, Q. Lu, K. G. Shin, and T. Peng, "Geometry-based optimal power control of fading multiple access channels for maximum sum-rate in cognitive radio networks," IEEE Trans. Wireless Commun., vol. 9, no. 6, pp. 1843-1848, June 2010. Article (CrossRef Link).

[27] A. Papoulis and S. U. Pillai, Probability, Random Variables and Stochastic Processes, 4th ed. New York: McGraw-Hill, 2002.

[28] Y.-R. Tsai and J.-F. Chang, "Feasibility of adding a personal communications network to an existing fixed-service microwave system," IEEE Trans. Commun., vol.44, no.1, pp. 76-83, Jan. 1996. Article (CrossRef Link).

[29] R. Fantacci, D. Marabissi, and D. Tarchi, "Proposal of a fixed communication system sharing the bandwidth of an existing personal communication network," IEEE Trans. Vehi. Technol., vol. 57, no. 1, pp. 180-187, Jan. 2008. Article (CrossRef Link).

Jing Wang, Mingming Lin, Xuemin Hong, and Jianghong Shi

School of Information Science and Engineering, Xiamen University

Xiamen, Fujian 361005 - P. R. China

[e-mail: xuemin.hong@xmu.edu.cn]

* Corresponding author: Xuemin Hong

Received August 19, 2013; revised December 1, 2013; accepted December 28, 2013; published January 29, 2014

Submitted to KSII Transactions on Internet and Information Systems. This paper was presented in part at the IEEE International Conference on Communications, Circuits and Systems, Xiamen, China, May 2008. The authors acknowledge the support from the Natural Science Foundation of China (NSFC) (Grant No. 61201195) and Natural Science Foundation of Fujian (2012J01292).

Jing Wang received her B.Eng. degree from Henan Normal University, Xinxiang, Henan, China, in 2012. She is currently a postgraduate student at Xiamen University, Xiamen, Fujian, China. Her research interest is cognitive radio networks.

Mingming Lin received his B.Eng. degree from Fuzhou University, Fuzhou, Fujian, China, in 2011. He is currently a postgraduate student at Xiamen University, Xiamen, Fujian, China. His research interests include cognitive radio networks and ad hoc networks.

Xuemin Hong (S'05-M'12) received a PhD degree from Heriot-Watt University, UK, in 2008. Since 2011, he has been an associate professor at Xiamen University, China. From 2009 to 2011, he was a post-doc research fellow at the University of Waterloo, Canada and Heriot-Watt University, UK. Dr Hong's research interests include MIMO and cooperative systems, wireless channel modelling, cognitive radio networks, and wireless ad hoc networking. He has published more than 20 technical papers in major international journals and conferences and 1 book chapter in the area of wireless communications. He served as a member of the Technical Program Committee for a number of international conferences.

Jianghong Shi received his PhD from Xiamen University, China, in 2002. He is currently a professor in the School of Information Science and Technology, Xiamen University. He is also the director of the West Straits Communications Engineering Center, Fujian Province, China. His research interests include wireless communication networks and satellite navigation.
COPYRIGHT 2014 KSII, the Korean Society for Internet Information
No portion of this article can be reproduced without the express written permission from the copyright holder.
Copyright 2014 Gale, Cengage Learning. All rights reserved.

Article Details
Printer friendly Cite/link Email Feedback
Title Annotation:quality of service
Author:Wang, Jing; Lin, Mingming; Hong, Xuemin; Shi, Jianghong
Publication:KSII Transactions on Internet and Information Systems
Article Type:Report
Date:Jan 1, 2014
Words:6777
Previous Article:Securing cooperative spectrum sensing against rational SSDF attack in cognitive radio networks.
Next Article:Multi-criteria vertical handoff decision algorithm using hierarchy modeling and additive weighting in an integrated WLAN/WiMAX/UMTS Environment--a...
Topics:

Terms of use | Privacy policy | Copyright © 2019 Farlex, Inc. | Feedback | For webmasters