 Research
 Open Access
 Published:
An accurate performance analysis of an FFR scheme in the downlink of cellular systems under largeshadowing effect
EURASIP Journal on Wireless Communications and Networking volume 2013, Article number: 48 (2013)
Abstract
We address the problem of analyzing the performances of interferencelimited cellular networks in largescale shadowing environments. Focusing on the fractional frequency reuse (FFR) framework, we examine how to optimally assign mobile users in a cell either to the full frequency reuse part or to the orthogonal part of the FFR band. Instead of using traditional Monte Carlo simulations, which do not provide sufficiently accurate results under important shadowing, we propose a fast and accurate numerical method. We consider a fastfading environment and we use the ergodic capacity as the performance measure. Applying a distributed power control and scheduling strategy, we examine both cases where access points have knowledge of partial or fullchannel state information (CSI); for the latter, we also propose an approximated waterfilling strategy. The interest of our method lies in the fact that it allows for a fast and accurate analysis of the performances of FFR. In addition, it takes into account a broad range of shadowing environments.
1 Introduction
Since the invention of digital networks, efforts for providing higher capacity and higher quality of service have never stopped. With the emergence of new wireless networks that aim at providing multimedia service everytime and everywhere, the need for higher spectral efficiency has never been so high [1, 2]. In order to achieve these goals, aggressive reuse of the whole frequency spectrum throughout the network is mandatory. As a consequence, today’s systems have to make intensive use of intercell interference mitigation techniques, including power control, opportunistic scheduling, FFR, MIMO... [3–9].
As the term ‘fractional’ implies, FFR attempts to find a compromise between the full frequency reuse scenario, which allocates the entire available bandwidth to each cell but at the expense of a maximum level of intercell interference, and the partial frequency reuse scenario, which provides zero intercell interference by orthogonally sharing the bandwidth among adjacent cells [10]. The idea behind FFR has come from the observation that user terminals (UTs) within a cell are not equivalent from an intercell interference point of view: due to the pathloss effect, celledge users are far more sensitive to it than users located near the center of the cell.
A key aspect in FFR design is for the access points (APs) to appropriately decide, for each UT, whether it has to be scheduled within the full frequency reuse part of the FFR band or within the orthogonal part of the FFR band. In this article, we investigate this decision issue based on the knowledge of the users channel gains.
Generally, the performances of FFR are evaluated by Monte Carlo simulations and/or empirical measurements [8, 11–13]. A recent contribution [14] has tackled the problem by following an analytical approach, however using some simplifying assumptions (very basic power control at the AP, no shadowing effect). Although the Monte Carlo simulation technique is a very common and practical tool, it does not provide sufficiently accurate results in the case where the random phenomenon included in the simulation model exhibits a heavytailed behavior. This is due to the fact that for heavytailed distributions, large amplitudes are associated a very low probability, so they rarely appear in the simulation process, despite their great impact on system performance [15]. In wireless networks, the heavytailed behavior of the interference power originates from the cumulative effect of the shadowing phenomenon in interfering links (sum of lognormal distributions) [16, 17], and this makes accurate and fast simulations very challenging in such environments.
In this article, we propose an accurate and fast numerical method to determine the performances of FFR in terms of ergodic capacity, in a multicell network suffering from path loss, shadowing and Rayleigh fading. In particular, we examine how the UT should be assigned to the FFR band, based on its channel gain. Unlike other studies that assume a fixed shadowing standard deviation (see e.g., [11, 13], where σ_{dB}=8 dB), we consider it as a variable parameter (σ_{dB}∈ [0,10] dB) in order to accurately analyze its influence on the performances of FFR.
The rest of the article is organized as follows. In Section 2, we present the system model. In Section 3, we derive the methodology of the numerical method that we use to provide a fast and accurate simulation of the performances of FFR. Numerical results are analyzed in Section 4.
2 Multicell downlink transmission model
We consider the downlink of a synchronous discretetime 19cell cellular network having the 2D hexagonal layout depicted in Figure 1. We assume a unitgain omnidirectional SISO (single input, single output) antenna pattern, both for the fixed APs and the mobile UTs. The UTs are supposed to be uniformly and independently distributed over the service area. Users belonging to the same cell are considered orthogonal, which gives rise to a wireless channel primarily limited by intercell interference, especially at the cell edges (as we do not consider sectorization in this article, there is no intersector interference^{a}). This model corresponds, e.g., to a TDMA system. In this context, the FFR scheme that we consider is a mixture of the two following patterns for allocating the available frequency spectrum across the network:

a partial frequency reuse pattern, denoted FR3, with reuse factor 3 (N=6 interferers). For this pattern, three groups of APs are active simultaneously on three orthogonal bands;

the full frequency reuse pattern, denoted FR1, where all APs in the network transmit at the same time using the whole frequency band (N=18 intercell interferers).
In this intercellinterference framework, we analyze the network performances by focusing on a typical UT. In this regard, we consider UT in cell 0 (denoted UT_{0}, see Figure 1), because it is surrounded by 18 potential interfering cells. For UT_{0}, the received signal at time slot m can be modeled as
Here x_{0}(m) represents the information symbol intended to UT_{0} and x_{ n }(m), n≠0, the n th interfering symbol (this symbol is sent from AP n to its respective user UT_{ n }). The coefficient h_{ n }(m) denotes the instantaneous channel gain from AP n to UT_{0}. Each channel is subject to additive white Gaussian noise w_{0}(m), with variance W.
Each channel is assumed to be flatfading, possibly experiencing smallscale multipath fading and/or largescale shadowing random processes. From now on, we use the instantaneous channel power gain (or simply channel gain^{b}) defined by H_{ n }=h_{ n }(m)^{2}, that can be expressed as a threefactor product:
Note that H_{0} is the channel gain from AP 0 to UT_{0} (useful link), whereas H_{1}, H_{2}, …, and H_{ N } represent interfering channel gains. In (1), the (deterministic) path loss H_{pl,n} diminishes with the distance r_{ n } between UT_{0} and AP n[18]:
where $\alpha ={(c/(4\mathrm{\Pi f}\left)\right)}^{2}{d}_{0}^{\gamma 2}$, with c being the speed of light, f, the operating frequency, and d_{0}, a reference distance for the antenna farfield; and γ represents the attenuation coefficient. The Rayleigh fading gain H_{f,n} is modeled by an exponential distribution with rate parameter equal to 1, i.e., $\mathbb{E}\left\{{H}_{\text{f},n}\right\}=1$. The shadowing gain H_{s,n} is modeled by a unitmean lognormal distribution parameterized by what is called the shadowing standard deviation σ_{dB} (usually expressed in dB) which captures the importance of the shadowing phenomenon (e.g., a σ_{dB}=0 dB scenario represents a wireless channel subject to fading only). Since r.v.’s H_{f,n} and H_{s,n} are independent of each other, and since $\mathbb{E}\left\{{H}_{\text{f},n}\right\}=\mathbb{E}\left\{{H}_{\text{s},n}\right\}=1$, from (1) we have $\mathbb{E}\left\{{H}_{n}\right\}={H}_{\text{pl},n}$, which reflects the fact that the Rayleigh fading and shadowing components cause the actual gain H_{ N } to fluctuate about its mean value H_{pl,n}.
We now introduce the power control and scheduling strategy that we consider in this article. In what follows, we first assume a distributed environment, i.e., each AP has access to some (local) CSI provided by its respective mobile users only. According to what type of CSI data are fed back from UTs to their serving APs, we consider two different scenarios: a partial (statistical) CSI scheme (for which only path losses are available at the APs), and a fullCSI scheme (APs have knowledge of instantaneous channel gains). Since channel information is available only at the cell level^{c}, we consider a distributed power control and scheduling strategy. A channel inversiontype power control is applied within each cell, based on the mean information (i.e., the path losses H_{pl,n}) available at the APs: the power emitted at each time slot by AP n is ${P}_{n}=\mathbb{E}\left\{\left{x}_{n}{\left(m\right)}^{2}\right\right\}=min\left({P}_{max},{P}^{\ast}/{H}_{\text{pl},n}\right)$, where P_{max} is the maximum power available at the AP, and P^{∗} is the target power at the mobile user. To this power control scenario we associate the resourcefair opportunistic scheduling policy proposed (and proved to be sumrate optimal) in [19]: each cell ranks its users by (say decreasing) order of channel gain and assigns the best users to the available time slots, regardless of channel gains in other slots.
3 Methodology
In this section, we aim at developing a fast and accurate method for analyzing the performances of interferencelimited cellular systems. In this context, we focus on the FFR framework for which we examine how to assign mobile users either to the FR1 or to the FR3 band, based on their path losses (because this leads to a distributed strategy). Considering a fastfading environment, we choose the ergodic capacity as the performance measure, and we are primarily interested in determining a potential point of intersection between the ergodic capacity curve related to FR1 and the ergodic capacity curve related to FR3 (this is illustrated in Figure 2). Or, stated otherwise, we want to answer the questions: when (where) to swap from applying FR1 to applying FR3, and how does the intersection point progress as a function of the shadowing standard deviation σ_{dB}? In addition, we want to determine the average gain when considering FR3 instead of FR1 close to the cell border, where mobile users suffer from severe interference. We also recall that we assume a distributed environment, in which APs only have access to CSI provided by their respective users.
In Section 3.1, we present the ergodic capacity as the performance measure. In Section 3.2, we consider the partialCSI scheme. We examine the fullCSI scheme in Section 3.3, where we propose an approximated waterfillingintime strategy.
3.1 The ergodic capacity as the performance measure
We can write the ergodic capacity of the typical user UT_{0} as follows:
where I is the total interference power received by UT_{0}, that can be written $I=\sum _{n=1}^{N}{P}_{n}{H}_{n}$. Since no closedform expression exists for the ergodic capacity (3), it must be computed numerically. The traditional approach consists in performing Monte Carlo simulations. However, because the shadowing phenomenon exhibits a heavytailed behavior for large values of the shadowing standard deviation σ_{dB}, efficient simulations in such environments are very challenging. Hence the need for a method to quickly and accurately compute the ergodic capacity that takes into account the importance of the shadowing.
To propose such a method, let us closely examine (3). First of all, we investigate the impact of the power control and scheduling policy on the interference power gain I. Recall that the distributed scheduling policy consists, for each cell, in ranking its users by decreasing order of mean channel gain H_{pl,n}, and in assigning them, in that order, an available time slot [19]. We now make an important assumption over the transmit power. Because of the scheduling policy, each user has a mean channel gain H_{pl,n} contained in a range which (statistically) becomes more and more restricted as the number of users per cell grows. In this article, we only consider a framework in which the number of users per cell is high. So, applying the scheduling policy described previously, it can be expected that the channels between users scheduled at the same time and their serving APs have about the same power gains: H_{pl,n}≈H_{pl,m}, ∀n≠m[16]. Since the power control is based on a constant target (received) power P^{∗}, we can reasonably assume that, at each time slot, each AP transmits at the same power: P_{ n }=P, ∀n. In Appendix 1, we evaluate how this transmit power assumption is impacted by the total number of users.
The interference power thus simplifies to $I=P\sum _{n=1}^{N}{H}_{n}$. We now define the interference power gain—which is denoted G—as being the sum of the channel power gains between the interested user UT_{0} and the N interferers, i.e., $G=\sum _{n=1}^{N}{H}_{n}=\sum _{n=1}^{N}{H}_{\text{pl},n}{H}_{\text{f},n}{H}_{\text{s},n}$. In this expression, G is a function of UT_{0}’s location through the distances r_{ n } (see (2)). However, it has been shown in [20] that the impact of UT_{0}’s position on G is negligible, so G can be approximated by $G\approx \sum _{n=1}^{N}\mathbb{E}\left\{{H}_{\text{pl},n}\right\}{H}_{\text{f},n}{H}_{\text{s},n}$ (the path loss H_{pl,n} of the interfering link between AP n and UT_{0} is then replaced by a mean value). Having introduced this interference power gain, we can further write I=P G. To characterize G’s statistical law, we make use of the closedform expression, parameterized by σ_{dB}, that has been proposed in [16]. In the next place, we evaluate the expression of the power received by UT_{0} (see (3)), i.e., P_{0}H_{0}=P H_{0}. Using (1), the gain H_{0} can be decomposed as H_{0}=H_{pl,0}H_{f,0}H_{s,0}. Since an analytical formula is available in the literature [16] for the probability law ${H}_{\text{fs},0}\triangleq {H}_{\text{f},0}{H}_{\text{s},0}$, we can further write: H_{0}=H_{pl,0}H_{fs,0}.
From the abovementioned considerations, we can rewrite the ergodic capacity (3) of the typical user UT_{0} as a function of its path loss H_{pl,0}:
Fast and accurate calculation of (4) is made possible by the use of available analytical probability laws for both r.v.’s H_{fs,0} and G; this calculation is computed numerically by estimating the sample mean in (4). This makes our method of great interest as compared with traditional timeconsuming Monte Carlo simulations.
We end our discussion over the ergodic capacity by pointing out the following. We assume that mobile users are uniformly and independently distributed within each cell. If we express the ergodic capacity as a function of the r.v. H_{pl,0}, we can associate it the probability density function (pdf) of the typical user UT_{0}. This pdf has the following expression [18]:
where K is a constant. Using (4) in association with (5), we are able to determine a mean network capacity by averaging the position of mobile users in the cell: this capacity corresponds to the average network capacity when there is an infinite number of users in each cell (U→∞). Note that, for the clarity of the illustrations, we express the mean power gain H_{pl,0} in dB; the expression of its associated pdf can be easily derived from (5).
3.2 Partial (statistical) CSI
We first consider the case where the local path losses are the only information available at the APs: this is what we called the partialCSI scheme (see Section 2). Under this partialCSI scheme, we apply the path lossbased power control policy described earlier, that is, we consider that the power emitted by AP 0 towards UT_{0} is P= min(P_{max},P^{∗}/H_{pl,0}) which also corresponds to the power emitted by any AP towards its respective user. Using this power control policy, the ergodic capacity (4) becomes:
Again, we can see the great interest of our numerical method: the mathematical expectation (6) can be calculated quickly and accurately—by numerical computation of the mean in (6)—because we have at our disposal, for both frequency reuse patterns FR1 and FR3, analytical expressions for the probability laws of the r.v.’s H_{fs,0} and G, parameterized by the shadowing standard deviation σ_{dB}[16]. Plotting the ergodic capacities for FR1 and FR3, namely ${C}_{\text{erg}}^{\text{FR1}}$ and ${C}_{\text{erg}}^{\text{FR3}}$, as functions of H_{pl,0}, may then exhibit an intersection point, each side of which is applied one of the FR1 or FR3 frequence reuse patterns. This intersection point also helps us classify users in the appropriate FFR band.
Using the ergodic capacity (6) and the pdf (5), we can also determine what the average gain is of swapping from FR1 to FR3 near the cell border, where users suffer from severe interference. This gain can be calculated by comparing the ergodic capacity for the FR1 pattern with the ergodic capacity for the FR3 pattern, which we denote by ${C}_{\text{erg}}^{\text{FR1}}\left({H}_{\text{pl},0}\right)$ and ${C}_{\text{erg}}^{\text{FR3}}\left({H}_{\text{pl},0}\right)$, respectively. Finally, if we consider the FFR area, we can associate to this potential gain the ratio of users concerned with this policy; note that this last ratio grows exponentially as H_{pl,0} diminishes.
3.3 FullCSI: approximated waterfilling strategy
We then consider the fullCSI scheme for which the APs have access to the instantaneous channel gains of their respective users. From the knowledge of the instantaneous channel conditions, we are able to propose a more efficient power allocation strategy in order to optimize the network capacity. We concentrate on what is known as the waterfillingintime strategy, since it is the optimal solution with respect to capacity optimization under an average transmit power constraint when both the AP and the mobile user have perfect and instantaneous knowledge of channel conditions [21].
The waterfilling strategy considered here is subject to the same path lossbased power control policy that we have used for the partialCSI scheme, i.e., the average power received by mobile users is assumed to be constant. Under this power control and scheduling policy, the waterfilling problem performed on a percell basis for the fullCSI scheme can be formulated as follows:
By using the Lagrangian method, we obtain the following solution ^{d}:
where the constant L (the water level) satisfies the following constraint:
We now closely analyze the complexity of the optimization problem (7)–(9). By carefully examining (7), we highlight an important issue: the waterfilling strategy in cell 0 obviously depends upon the waterfilling procedures performed in other (interfering) cells. Indeed, the power P_{ n } emitted by AP n results from the waterfilling strategy of cell n, and it therefore depends on the instantaneous channel gain H_{fs,n} between AP n and UT_{ n }. However, since we have chosen for a distributed power control and scheduling policy, a cell only has access to local information, namely, the actual channel gains of its own users. As such, the optimization problem (7)–(9) thus reveals too complex to solve and the waterfilling strategy needs to be approximated.
For this purpose, we first assume that each r.v. P_{ n }, n=1,…,N, may be assimilated to its mean value: ${P}_{n}\approx \mathbb{E}\left\{{P}_{n}\right\}=\mathbb{E}\left\{{P}_{0}\right\}$, where the last equality results from the fact that, because of the opportunistic scheduling policy, users scheduled at the same time have the same path losses (see Section 3.1 and Appendix Appendix 1). The interference term $\sum _{n=1}^{N}{P}_{n}{H}_{n}$ then simplifies to $\mathbb{E}\left\{{P}_{0}\right\}\sum _{n=1}^{N}{H}_{n}$. Our second assumption pertains to the actual value $\sum _{n=1}^{N}{H}_{n}$ of the interference gain G (recall that H_{ n }=H_{pl,n}H_{fs,n} is the instantaneous channel gain between AP n and UT_{0}). Since a distributed system is considered (which actually corresponds to any practical implementation of a wireless network), this information is not available at cell 0; so we replace G by its mean value $\mathbb{E}\left\{G\right\}$. These two assumptions lead to the following (inevitably suboptimal) waterfilling solution^{e}:
where J is defined as follows:
Armed with this approximated waterfilling policy, we proceed with the computation of the ergodic capacity, which is denoted ${C}_{\text{erg}}^{\text{wf}}$. We can write from (7):
where the expectation is taken over the r.v.’s H_{fs,0}, H_{ N } and P_{ n }, n=1,2,…,N, and the instantaneous power P_{0}(H_{fs,0}) is determined by (12). But we are facing exactly the same issue as before, because the power P_{ n } emitted by AP n depends on the waterfilling policies performed in cells m, m=0,1,…,N, m≠n. Since computing the ergodic capacity (16) seems out of reach, we here too propose to assimilate P_{ n } to $\mathbb{E}\left\{{P}_{n}\right\}=\mathbb{E}\left\{{P}_{0}\right\}$. We show in Appendix Appendix 2 that introducing that approximation allows us to establish a lower bound for the ergodic capacity (16). This lower bound is denoted ${C}_{\text{erg}}^{\text{wf}}$ and it has the following expression:
where L and J are both functions of H_{pl,0}. As mentioned before, our method here also allows for a fast and accurate (numerical) computation of the ergodic capacity (17) because the probability laws of H_{fs,0} and G can be expressed analytically [16].
We end this section by formulating some concluding remarks. From Sections 3.2 and 3.3, we can establish the following inequality:
where the ergodic capacities C_{erg}(H_{pl,0}) and ${C}_{\text{erg}}^{\text{WF}}\left({H}_{\text{pl},0}\right)$ can be computed easily, respectively, from (6) and (17) (computation of the optimal value ${C}_{\text{erg}}^{\text{WF}}\left({H}_{\text{pl},0}\right)$ is intractable and meaningless in a realistic scenario). And, as for the partialCSI scheme, we are interested in determining a potential point of intersection of the capacity curves ${C}_{\text{erg}}^{\text{wf,FR1}}\left({H}_{\text{pl},0}\right)$ and ${C}_{\text{erg}}^{\text{wf,FR3}}\left({H}_{\text{pl},0}\right)$, for both the frequency reuse patterns FR1 and FR3, and for different values of the shadowing standard deviation σ_{dB}. This intersection point also allows us to assign mobile users either to the FR1 band or to the FR3 band on the basis of their path losses.
4 Numerical results
In this section, we present numerical results related to the analysis of the FFR framework under different frequency reuse scenarios and for different values of the shadowing standard deviation. In Section 4.1, we first describe the simulation parameters. In Section 4.2, we compare results of the ergodic capacity as a function of the path loss under both the FR1 and FR3 patterns and we compute the potential gain of applying the FFR technique in different wireless channels. In Section 4.3, we improve the ergodic capacity results by performing the approximated waterfilling policy described in Section 3.2.
4.1 Simulation parameters
We use the following simulation parameters. We consider a system functioning at 1 GHz. We fix the cell radius to R=700 m, the farfield distance to d_{0}=10 m, and the attenuation coefficient to γ=3.2, which corresponds to a typical urban environment, as described by the COST231 reference model [22]. We consider a wireless channel that is subject to a largescale shadowing phenomenon that may vary in a [0,10] dB range. The maximum power available at the access point is P_{max}=5·10^{−3} W and the target received power is P^{∗}=10^{−12} W. The additive white Gaussian noise has variance W=10^{−15} W. As stated previously (see Section 3.1), the number of users per cell is considered to be infinite.
4.2 PartialCSI scheme
We now present results in the case of partial CSI available at the APs. First of all, we examine how the ergodic capacity of the typical user evolves as a function of its path loss, which is illustrated in Figure 3 for both frequency reuse patterns FR1 and FR3, and for several values of the shadowing standard deviation (σ_{dB}={0,5,10} dB); all capacity curves are associated the same pdf (plotted on the bottom figure). A careful examination of these curves allows us to highlight some interesting points. First, we see that both ergodic capacities ${C}_{\text{erg}}^{\text{FR1}}\left({H}_{\text{pl},0}\right)$ and ${C}_{\text{erg}}^{\text{FR3}}\left({H}_{\text{pl},0}\right)$ are constant for high path losses (i.e., close to the AP). This can be easily explained: users located near the AP suffers from less interference, which is reinforced by the power control and scheduling policy applied by each cell (users scheduled at the same time have similar gains). Since in that fully power controlled area the interference power can be neglected (I≪W), the ergodic capacity (6) becomes
and it depends only on σ_{dB} (through the r.v. H_{fs,0}). Moreover, in this noiselimited scenario for which I→0 (which in the context of this article occurs when H_{pl,0}→∞), we can write
because in the FR1 scenario, the whole frequency band is used while this resource is divided in three orthogonal bands in the FR3 scenario. Next, we see that all capacity curves slightly take down on the left side of a fixed gain denoted ${H}_{\text{pl},0}^{\text{d}}$. This results from the maximum power constraint applied at the APs: ${H}_{\text{pl},0}^{\text{d}}$ is the demarcation point between the fully power controlled area (right side) and the area where APs emit at their maximum (saturated) power (left side); it follows immediately that ${H}_{\text{pl},0}^{\text{d}}={P}^{\ast}/{P}_{\text{max}}$.
In the next place, we make observations related to the FFR technique and we evaluate its performances with respect to network capacity. We observe in Figure 3 that the ergodic capacities ${C}_{\text{erg}}^{\text{FR1}}\left({H}_{\text{pl},0}\right)$ and ${C}_{\text{erg}}^{\text{FR3}}\left({H}_{\text{pl},0}\right)$ intersect for values of the shadowing standard deviation up to 6 dB. This makes the FFR technique attractive in these wireless channels and our method allows for optimally assigning users to either the FR1 band or the FR3 band from the sole knowledge of their path losses. The evolution of the intersection point ${H}_{\text{pl},0}^{\ast}$ as a function of σ_{dB} is plotted in Figure 4. Swapping from FR1 to FR3 when path losses are lower than ${H}_{\text{pl},0}^{\ast}$ (i.e., for users undergoing more interference) then allows to increase the ergodic capacity. The proportion of mobile users assigned to the FR3 orthogonal band as a function of σ_{dB} can be determined by computing
This proportion is illustrated in Figure 5 and we see that it can reach up to 30 % for light shadowing environments (σ_{dB}∈ [0,2]–dB range). From the ergodic capacity curves and the associated probability density function, we can compute the average gain of using FR3 vs. using FR1 as follows:
We summarize all the above observations for the partialCSI scheme in Table 1. Columns 2–6 show the results for the orthogonal FFR band (${H}_{\text{pl},0}\in \left[{H}_{\text{pl},0}^{min},{H}_{\text{pl},0}^{\ast}\right]$). The gain in col. 5 is computed from (22) and columns 3 and 4. Results from col. 6 are calculated by (21) and have already been illustrated in Figure 5. Columns 7–9 pertain to the 10percent proportion of mobile users located nearest to the cell border. We see that using FFR leads to a non negligible gain (at least 10%, see col. 9) in light shadowing environments (σ_{dB} up to 4 dB). The same observation holds for the 1percent proportion of users (columns 10–12). Our analysis confirms results obtained in other studies (for a wireless channel subject to Rayleigh fading only, see e.g., [14, 23]).
We come to the conclusion that, for the partialCSI scheme, the FFR technique may increase the average ergodic capacity for users located near the cell border, in light or moderate shadowing environments. But, more importantly, besides this capacity increase, what really makes FFR of great interest is the fact that it may concern a non negligible proportion of mobile users, especially for small values of the shadowing standard deviation.
4.3 FullCSI scheme
Finally, we consider the fullCSI scheme associated with the approximated waterfilling policy proposed in Section 3.3. The ergodic capacities ${C}_{\text{erg}}^{\text{wf,FR1}}\left({H}_{\text{pl},0}\right)$ and ${C}_{\text{erg}}^{\text{wf,FR3}}\left({H}_{\text{pl},0}\right)$, obtained from (17), as well as the associated pdf p(H_{pl,0}), are plotted in Figure 6, for both frequency reuse patterns FR1 and FR3, and for σ_{dB}=0,5 and 10 dB.
We first observe that, as compared with the partialCSI scheme (see Figure 3), the waterfilling strategy obviously improves the capacity results. We next see that the FR1 pattern performs better than the FR3 pattern, for the whole [0,10]–dB range of values of the shadowing standard deviation σ_{dB}. Let us explain why the presence of an intersection point in the partialCSI scheme offers no clue as to the presence of such a point in the fullCSI scheme (for the same shadowing standard deviation σ_{dB}). Considering a partialCSI scenario where ergodic capacity curves intersect, we can write, for ${H}_{\text{pl},0}<{H}_{\text{pl}}^{\ast}$,
Since the waterfilling gain increases when the signalto(interferenceplus)noise ratio decreases, (23) yields
where ${H}_{\text{pl},0}<{H}_{\text{pl},0}^{\ast}$. Inequality (24) is clearly illustrated in Figure 7 for ${H}_{\text{pl},0}={H}_{\text{pl},0}^{\text{min}}$ and σ_{dB}=0 dB. But from (23) and (24), we have no indication about the validity of either ${C}_{\text{erg}}^{\text{wf,FR1}}\left({H}_{\text{pl},0}\right)\ge {C}_{\text{erg}}^{\text{wf,FR3}}\left({H}_{\text{pl},0}\right)$ or ${C}_{\text{erg}}^{\text{wf,FR1}}\left({H}_{\text{pl},0}\right)\le {C}_{\text{erg}}^{\text{wf,FR3}}\left({H}_{\text{pl},0}\right)$.
From these observations, we can conclude that applying FFR is of no interest with respect to network capacity when APs perfectly know their local channel conditions (fullCSI scheme), though other simulation scenarios may lead to different conclusions.
5 Conclusion and future study
In this article, we investigated the problem of evaluating the performances of FFR in largescale shadowing environments. Instead of using Monte Carlo simulations or empirical measurements, we proposed a numerical method to easily compute the ergodic capacity in a fastfading environment. Using a distributed power control and scheduling policy, we examined both cases where APs have access to partial or fullCSI. We showed that our method allows for a fast and accurate analysis of the performances of FFR. In addition, it takes into account a broad range of shadowing environments.
The results presented in this article only hold for the simulation conditions specified; they may differ for other simulation scenarios. So a future article will pertain to applying the proposed method to other types of network (e.g., ad hoc networks, …) and using different simulation conditions (user distribution in the cell, transmit or target power, attenuation coefficient, …). Another perspective is to consider sectorization, which induces intersector interference and leads to totally different models for the power gains as well as for the interference. Yet another perspective concerns the analysis of the network performances in a slow fading environment using other performance measures, like the outage capacity or the outage probability.
Appendix 1
Validity of the assumption over the transmit power
In this Appendix, we analyze our assumption over the transmit power. First we investigate how the total number of users impacts the transmit power within one cell and we evaluate our assumption in the case where all cells have the same number of users. Then we examine the case where the total number of users varies among cells.
Same number of users per cell
Let U be the number of users in a cell, and let us assume that all users are uniformly and independently distributed over the cell area (for the sake of simplicity, we consider a circular area of radius R). Since we consider a channel inversion power control strategy, we have P∝1/H_{pl}, and the distribution function of the transmit power P can be easily written as follows:
where P_{max}∝R^{γ} is the power transmitted to a user located at the cell border. Using order statistics (recall that all users are scheduled in decreasing order of their channel gains) [25], the pdf of user u can be written
where P_{ u } is the power transmitted to user of rank u (for a total of U users in the cell), F is defined by (25) and $\beta (x,y)={\int}_{0}^{1}{t}^{x1}{(1t)}^{y1}\phantom{\rule{0.3em}{0ex}}\mathit{\text{dt}}$ is the beta function. Some of these pdf’s are illustrated in Figure 8 for different values of U. To evaluate our assumption over the transmit power, let us compute the standard deviation ${\sigma}_{{P}_{u}}$; this quantity can be obtained from (25) and (26):
Table 2 shows maximum values of the standard deviation (as a proportion of the whole [0,1]dynamics) for different numbers of users in the cell. We see that large values of ${\sigma}_{{P}_{u}}$ occur for small values of U, and that ${\sigma}_{{P}_{u}}$ becomes smaller as U increases. In a framework where all APs have the same (large) number of users, it can then be reasonably stated that users scheduled at the same time are allocated the same power, i.e., P_{ n }=P, ∀n, at each time slot.
Variability in the number of users per cell
We now examine the case where the total number of users varies from cell to cell. To this end, we focus on the particular case of a twocell network in which cell 1 and cell 2 contain U_{1}=60 users and U_{2}=120 users, respectively, and we consider a frame consisting of 120 time slots. In both cells, users are ranked according to their decreasing channel gains, and they are allocated time slots in that order; each user in cell 1 is then allocated two consecutive time slots. This leads to the following scheduling algorithm:
where v_{n,u} represents user u of cell n. To evaluate our assumption, we compute the ratio
where P_{n,t} is the (mean) power $\mathbb{E}\left\{{P}_{u}\right\}$—whose statistics is given by (26)—transmitted by AP n towards user scheduled at time slot t (in our case, t=1,2,…,120). Results are given in Table 3. We see that, for more than 93 % of all time slots, users scheduled at the same time are allocated transmit powers which differ from less than 10 %. For 40 % of them (those users located near the cell border, which are allocated more transmit power), this difference may even be less than 1 %. For users located around the AP, which possess the highest channel gains and are then allocated a weak power, the difference in transmit power may amount to 65 %. So, in the case where cells contain a different number of users, we may also assume that users scheduled at the same time are allocated the same power.
Appendix 2
A lower bound for the ergodic capacity ${C}_{\text{erg}}^{\text{WF}}\left({H}_{\text{pl},0}\right)$
In this Appendix, we establish a lower bound for the ergodic capacity ${C}_{\text{erg}}^{\text{WF}}\left({H}_{\text{pl},0}\right)$ given by formula (16):
Since all r.v.’s H_{fs,0}, H_{1},H_{2},…,H_{ N }, P_{1},P_{2},…,P_{ N }, are independent of each other, operations to compute the expectation may be performed in any order; so focusing on the sole power P_{ n }, we may rewrite (29) as follows:
Let us now define the function of one variable f(x) as:
It can be easily shown that f(x) is a convex function of the variable x, i.e., d^{2}f(x)/dx^{2}>0, ∀x. Using (31), the ergodic capacity (30) can be written
Since computing (32) is too complex, we derive a lower bound for the ergodic capacity. To this end, we propose to approximate the r.v. P_{ n } by its mean value $\mathbb{E}\left\{{P}_{n}\right\}=\mathbb{E}\left\{{P}_{0}\right({H}_{\text{fs},0}\left)\right\}$ (see Section 3.3). Since the function f(x) is convex, we have, by Jensen’s inequality [26], $\mathbb{E}\left\{f\right(x\left)\right\}\ge f\left(\mathbb{E}\right\{x\left\}\right)$, and the following holds:
Applying the above procedure iteratively on P_{ m }, m=1,…,N, m≠n, and using (9) in association with (12)–(14), yields:
Endnotes
^{a}Taking sectorization into consideration would indeed lead to a totally different interference model (see e.g., [24]).^{b}Since we focus on power gains only, the term power will then be omitted in subsequent paragraphs.^{c}Note that considering a fullCSI scheme at the network level would not be a realistic scenario because of the enormous amount of information that a central unit would have to manage.^{d}The notation [x]^{+} means max(0,x).^{e}In what follows, we write P_{0}(H_{fs,0}) instead of P_{0} to emphasize the fact that, for a fixed value of H_{pl,0}, P_{0} depends on the instantaneous channel state H_{fs,0}.
References
 1.
TS 300 evolved universal terrestrial radio access (EUTRA) and evolved universal terrestrial radio access networks (EUTRAN); overall description; stage 2, 3GPP Std 2010.
 2.
IEEE 802.16m system description documents (SDD) 0034r3, IEEE Std., Rev. r3 June 2010.http://www.ieee802.org/16/tgm/docs/80216m09_0034r3.zip [Online]. Available: []
 3.
Corvino V, Gesbert D, Verdone R: A novel distributed interference mitigation technique using power planning. In Proc. Wireless Communications and Networking Conference. Budapest; 2009:16.
 4.
Schoenen R, Qin F: Adaptive power control for 4G OFDMA systems on frequency selective fading channels. In Proc. 5th Int. Conf. on Wireless Communications, Networking and Mobile Computing. Beijing; 2009:16.
 5.
Boudreau G, Panicker J, Guo N, Chang R, Wang N, Vrzic S: Interference coordination and cancellation for 4G networks. IEEE Commun. Mag 2009, 47(4):7481.
 6.
Himayat N, Talwar S, Rao A, Soni R: Interference management for 4G cellular standards [WiMAX/LTE UPDATE]. IEEE Commun. Mag 2010, 48(8):8692.
 7.
AliYahiya T, Chaouchi H: Fractional frequency reuse for hierarchical resource allocation in mobile WiMAX networks. EURASIP J. Wirel. Commun. Network 2010, 2010: 17.
 8.
Fu W, Tao Z, Zhang J, Agrawal DP: Clustering based fractional frequency reuse and fair resource allocation in multicell networks. In Proc. IEEE Int. Conf. on Wireless Communications, Networking and Mobile Computing. Cape Town; 2010:15.
 9.
Kim K: Interference mitigation in wireless communications. Ph.D. dissertation, School of Electrical and Computer Engineering, Georgia Institute of Technology (Atlanta, 2005)
 10.
Wang F, Ghosh A, Sankaran C, Fleming PJ, Hsieh F, Benes SJ: Mobile WiMAX systems: performance and evolution. IEEE Commun. Mag 2008, 46(10):4149.
 11.
Sankaran C, Wang F, Amitava G: Performance of frequency selective scheduling and fractional frequency reuse schemes for WiMAX. In Proc. IEEE 69th Vehicular Technology Conference, VTC Spring. Barcelona; 2009:15.
 12.
Xie Z, Walke B: Enhanced fractional frequency reuse to increase capacity of OFDMA systems. In Proc. 3rd International Conference on New Technologies, Mobility and Security. Cairo; 2009:234238.
 13.
Zhou Y, Zein N: Simulation study of fractional frequency reuse for mobile WiMAX. In Proc. IEEE 67th Vehicular Technology Conference, VTC Spring. Marina Bay; 2008:25922595.
 14.
Novlan TD, Ganti RK, Ghosh A, Andrews JG: Analytical evaluation of Fractional Frequency Reuse for OFDMA cellular networks. IEEE Trans. Wirel. Commun 2011, 12: 42944305.
 15.
Markovitch N: Nonparametric Analysis of Univariate HeavyTailed Data: Research and Practice, Wiley Series in Probability and Statistics, WileyInterscience,. John Wiley & Sons Ltd, The Atrium, Southern Gate, Chichester, West Sussex PO19 8SQ, England; 2007.
 16.
Pijcke B, ZwingelsteinColin M, Gazalet M, Gharbi M, Corlay P: An analytical model for the intercell interference power in the downlink of wireless cellular networks. EURASIP J. Wirel. Commun. Netw 2011, 2011: 120.
 17.
Szyszkowicz SS: Interference in cellular networks: Sum of lognormals modeling. 2007.
 18.
Goldsmith A: Wireless Communications. Cambridge University Press, 40 West 20th street, NewYork, NY 100114211, USA; 2005.
 19.
Kiani SG, Gesbert D: Optimal and distributed scheduling for multicell capacity maximization. IEEE Trans. Wirel. Commun 2008, 7: 288297.
 20.
Pijcke B, ZwingelsteinColin M, Gazalet M, Gharbi M, Corlay P, Coudoux FX: Contribution to the interference power modeling in cognitive radio networks. In Proc. European Wireless Technology Conference. Paris; 2010:137140.
 21.
Goldsmith A, Varaiya P: Capacity of fading channels with channel side information. IEEE Trans. Inf. Theory 1997, 43(6):19861992. 10.1109/18.641562
 22.
European Cooperative in the Field of Science and Technical Research EUROCOST 231: Urban transmission loss models for mobile radio in the 900 and 1800 MHz bands. The Hague, Tech. Rep., September (1991) rev. 2
 23.
Novlan T, Andrews J, Sohn I, Ganti R, Ghosh A: Comparison of fractional frequency reuse approaches in the OFDMA cellular downlink. In Proc. IEEE Global Telecommunications Conference. Miami; 2010:15.
 24.
Tse D, Viswanath P: Fundamentals of Wireless Communication. Cambridge University Press, The Edinburg Building, Cambridge CB2 8RU, UK; 2005.
 25.
Balakrishnan N, Rao CR: Handbook of Statistics 16  Order Statistics: Theory & Methods, Elsevier Science,. ELSEVIER SCIENCE B.V, Sarah Burgerhartstraat 25, P.O. Box 211, 1000 AE Amsterdam, The Netherlands; 1998.
 26.
Cover TM, Thomas JA: Elements of Information Theory 2nd Edition (Wiley Series in Telecommunications and Signal Processing), WileyInterscience;. John Wiley & Sons, Inc., Hoboken, New Jersey; 2006.
Author information
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
About this article
Received
Accepted
Published
DOI
Keywords
 Wireless networks
 Intercell interference
 Fractional frequency reuse
 Rayleigh fading
 Lognormal shadowing
 Ergodic capacity