Open Access

Uncertainty area-based interference mitigation for cognitive radio

EURASIP Journal on Wireless Communications and Networking20112011:175

https://doi.org/10.1186/1687-1499-2011-175

Received: 28 February 2011

Accepted: 21 November 2011

Published: 21 November 2011

Abstract

A new interference mitigation approach is presented for a Mobile Ad Hoc NETwork (MANET), acting as a secondary wireless network, which takes advantage of smart antennas and cognitive radio capabilities when arbitrarily deployed in the same area as a primary wireless network while both sharing the same spectrum. The MANET has to cope with the very coarse probabilistic estimate of the primary network antenna location, resulting from the absence of communication between both networks. Prior to MANET deployment, a Monte Carlo simulation is performed to evaluate the MANET's potential aggregate interference. Thus, both network managers have offline requirements to meet by such a simulation before approving their coexistence in the same environment. The adequate size of an uncertainty area surrounding each primary antenna, to respect those requirements, is therefore our main contribution to mitigate the MANET's interference. This is a novel solution for this kind of non-intrusive underlay spectrum sharing paradigm.

Keywords

cognitive radio interference estimation mobile ad hoc network probabilistic location radio coverage area smart antennas uncertainty area underlay paradigm wireless network coexistence

1. Introduction

The rapid growth of electromagnetic radio-spectrum use has made this natural resource a rather scarce asset for different wireless networks deployed in overlapping areas. Acute bandwidth shortage is predicted in the near future by considering the frequency bands already assigned for various applications such as television broadcast, cellular communications [1], etc. In contrast to this apparent spectrum scarcity has been the pervasive existence of spectrum opportunity as extensive measurements indicate that, at any given time and location, a large portion of licensed spectrum lies unused [2]. Even when a frequency band is actively used, the bursty nature of many applications results in abundant spectrum opportunities [3]. The relatively new spectrum underlay paradigm even allows simultaneous use of the shared spectrum by both the primary and secondary networks [4]. The cognitive radio concept is viewed as a promising way for improving the usage of this resource with two main objectives in mind: highly reliable communications whenever and wherever needed as well as efficient utilization of the radio spectrum [5].

The FCC has proposed an interference temperature model [6], for the underlay approach of wireless network coexistence, where unlicensed transceivers can operate on the same frequencies as licensed signals provided they can quantify and bound the resulting additional interference [4]. In this model, a secondary node (SN) senses the available spectrum band to further estimate the interference temperature experienced at each channel for each primary antenna (PA) and/or primary user that uses the channel. It is then allowed to transmit data on a channel provided the interference temperature for that channel does not exceed a predefined threshold at any aforementioned primary device [7]. Although temporarily abandoned by the FCC policy task force, the interference temperature model is still widely used among researchers as it provides an accurate measure at a receiving primary device for the acceptable level of RF interference in the spectrum band of interest [8]. The interference temperature of a channel is a function of the channel's average interference power for a given central frequency and spectral bandwidth. In this article though, an aggregate interference power is estimated in a radio agnostic fashion, using generic propagation loss parameters, so that no particular physical layer standards need to be specified. As such, we are concerned about the interference power instead of the temperature model, although the latter is indirectly considered by virtue of aggregate interference.

Many beamforming techniques may be used at transmitters and/or receivers belonging to the same network to enhance their communication. Choosing the best radiation beamwidth and direction at a given transceiver--so as to maximize the signal-to-interference-plus-noise ratio on desired links while minimizing it on any other link--is the challenging purpose of its smart antenna. This interference alleviation method also brought a lot of interest for the development of dynamic spectrum access strategies, where the transmitted power from SNs must be either lowered towards PAs or steered away from them, when sufficient information about PAs' location is available at SNs.

A major obstacle in estimating the aggregate interference at PAs can be the absence of communication between both networks to ensure non-intrusiveness, which can lead to a very inaccurate estimation of the PAs' location by the secondary network. The originality of this study is that our approach is especially designed to deal with this specific issue, which has rather been neglected in the past. Furthermore, it takes advantage of smart-antenna technology, but our scheme can be applied to any wireless network enabling such transmission directivity or not. The emphasis is also on the use of a Mobile Ad hoc NETwork (MANET) as the secondary network since MANETs will be soon very popular for a fast, easy, and low-cost deployment. Our original scheme also demonstrates that, by means of offline communicated coexistence requirements to be statistically satisfied by both networks, i.e., MANET interference underestimation and overestimation constraints imposed, respectively, by the primary and secondary networks, the unavailable online communication between both networks can be surprisingly counterweighted.

There will certainly be many future arising applications requiring the deployment of a MANET in the same environment as a primary network, from which any online communication is practically impossible and the knowledge of PAs' location by the MANET seriously lacks accuracy. Among many examples, one may think about a short-term special event occurring in a city and requiring mobile wireless video transfer for security purposes. Even though the precise PAs' location might be offline communicated to the such a MANET in this rather friendly situation, the radio-wave propagation behavior in this urban environment adds an non-negligible unpredictability factor. A military deployment in an enemy territory is another relevant example, although the assumption of offline communicated coexistence requirements may not hold (the primary network belonging to the enemy). Indeed, as the military MANET (intruder) wishes to reach a minimum QoS while not being detected by the enemy network, the previously mentioned interference estimation constraints still apply.

2. Related work

In many other approaches found in literature, pilot signals sent by a primary to a secondary network allow the latter to estimate the interference it causes to the former, so that interference constraints can only be violated within the desired limits as in [9], hence resulting on an intrusive secondary network deployment. Other authors as in [1014] have proposed an alternative method--using omnidirectional antennas, beamforming technologies, or relay-assisted directional transmissions--with the drawback of having a constraint on the SNs position during the deployment, which is obviously not convenient when the secondary network is a MANET. A power control strategy serving as an alternative interference avoidance method has been presented in [15], which allows the secondary users to share the common spectrum used by primary users while not degrading the primary link's QoS, by not affecting its outage probability. However, this requires the secondary users to be able to frequently obtain the primary users' channel state information, which unfortunatly implies an online communication between them.

An interesting channel selection scheme under the interference temperature model has been presented in [16], where the interference is estimated in the frequency band of interest before SNs' transmission. However, SNs are assumed to know the exact waveform details and the modulation type of primary signal a priori, so they are able to separate out the primary signals from other interfering signals because of noise and other SNs. The interference estimation accuracy is also highly dependent on SNs distribution over the deployment site. In [17], the proposition of a common control channel design, to be used by both the secondary and primary networks in order to exchange information, is not applicable in our non-intrusive MANET deployment scheme. By having the location information of the secondary as well as the primary users in [18], an overlaying cognitive ad hoc network can concurrently transmit peer-to-peer data in the presence of an infrastructured-based connection in some region. However, it is still not applicable in our scheme because of our assumed PAs' location information inaccuracy for the MANET. The authors in [19] have aimed to maximize the throughput of SNs while keeping the interference temperature at PAs below a certain threshold, even without channel knowledge to the PAs. In fact, they study the optimal secondary-link beamforming pattern to steer interference away from PAs, which is unfortunatly too dependent on an accurate PAs' location information.

In this article, we now remove the need for the primary network to cater to the secondary network with a pilot signal and/or channel state information or details about the primary signal, so that the latter becomes totally non-intrusive, and also permits an arbitrary SNs deployment. To the best of our knowledge, nobody in the past has ever considered our main assumptions in the interference estimation of a secondary network towards a primary network: no online communication between both networks, coarse probabilistic estimate of PAs location obtained by the secondary network, and arbitrary deployment of the latter. For this reason, our simulation results presented in Section 5 cannot be compared with any other method from literature at this time, as our scheme is the first reference for this particular non-intrusive coexistence condition. We have already published some preliminary results of this work in [20], but this article now offers much more details on our proposed interference estimation technique, as well as a quite different and more efficient method to statistically justify the wireless coexistence approval. The following section explains how the results of a Monte Carlo simulation prior to the MANET deployment, provided that special coexistence requirements are communicated offline between both network managers, brings a novel interesting avenue for interference mitigation in this emerging open spectrum context.

3. System models

The communication model among SNs is exactly the same as reported in [21]. For the PAs, they are all assumed to have a unity gain and being omnidirectional for simplicity. In the remainder of this article, the set of all transmitting SNs is defined as S T , and the set of all PAs is defined as S P . For the worst case assessment, PAs are always considered to be in receiving mode. We assume all SNs to always know their exact location, by means of a GPS for instance. An SN's antenna beam is modeled as a circular sector since we assume the main lobe to be much more important than all the side lobes together as in [21].

Let G T (i) be the antenna gain of the i th transmitting SN with its beamwidth θ (i). Similarly, let G R (j) be the antenna gain of the j th receiving SN with its beamwidth θ(j). Let d (i,p) be the distance between the i th SN and p th PA, and let d0 be the far-field distance for the antenna of both types of transceiver. Our radio propagation model thus holds as long as d (i,p) ≥ d0, which is always respected in our simulations. We define α as the path loss exponent and C (i,p) as a zero mean Lognormal random variable, with a standard deviation σ C , representing the slow fading on the radio channel between i and p[22]. There is no need to consider fast fading since we assume it to be averaged in our model. This way of modeling the radio propagation is quite simple but does not have any impact on the usability of our interference estimation scheme explained subsequently. Indeed, any model could fit as long as the actual and estimated interference received at any PA are calculated accordingly.

The interference radius rINT (i,p) is defined as the distance from i, transmitting with power P T (i), for which p would receive the actual interference I R (i,p). If the antenna beamwidth and direction of the i th SN are such that its coverage area overlaps the location of the p th PA then we set rINT (i,p) = d (i,p), otherwise we set rINT (i,p) = ∞ for convenience. Let rINT,e(i,p) be the MANET estimate of rINT (i,p) which will be the subject of Section 4. I R (i,p) and its MANET estimate IR,e(i,p) are thus defined as
I R ( i , p ) P T ( i ) G T ( i ) r INT ( i , p ) - α C ( i , p ) , I R , e ( i , p ) P T ( i ) G T ( i ) r INT, e ( i , p ) - α .
(1)
Because of the transmitted power attenuation as a function of distance from an SN, the received power at any receiver (SN or PA) might be so small over a certain distance that it becomes irrelevant, even as interference. We thus define PMNZ as the minimum non-zero power threshold below which any lower power is considered to be null. Let the distance from the i th transmitting SN, for its attenuated power to reach PMNZ using P T (i) as its transmission power, be the radius r MNZ (i) ≥ d0. By neglecting the random slow fading in this particular case for such small power, we obtain
r MNZ ( i ) P T ( i ) G T ( i ) P MNZ α ,
(2)
which is obtained from an analogy to I R (i,p) in (1) with replacements:
I R ( i , p ) P MNZ , r INT ( i , p ) r MNZ ( i ) , C ( i , p ) 1 .
(3)

By letting the i th RCA be the radio coverage area of the i th transmitting SN, which is actually its transmission beam, rMNZ (i) is in fact the radius of the circular sector representing it, such that the interference from i is considered to be null outside its RCA.

A single SN of the MANET may generate interference to one or many PAs while transmitting towards other SNs. However, a PA cannot distinguish between individually received interference from transmitting SNs, as it only perceives an aggregate interference denoted as I A (p), and equivalently the MANET estimates of I A (p) is denoted as IA,e(p). As it becomes impossible for the MANET to exactly predict all radio propagation phenomena from SNs to PAs such as slow and fast fading, reflection, refraction, diffraction and so on [22], there is inevitably a difference or an error between IA,e(p) and I A (p) for all p S P . In our interference mitigation approach explained subsequently in 3-B, this fact is rather an advantage so it is more appropriate to talk of an aggregate interference offset on p, denoted as IA,o(p), instead of an aggregate interference error, since this difference can probabilistically be selected by both the primary and secondary networks as explained subsequently. Those interference notations are thus defined as
I A ( p ) h S T I R ( h , p ) , I A , e ( p ) h S T I R , e ( h , p ) , I A , o ( p ) I A , e ( p ) - I A ( p ) .
(4)

A. Probabilistic location of primary antennas

Many techniques can be found in literature for a cognitive radio network to approximate the location of the primary network antennas. For example, the authors in [23] have combined the number of source estimations provided by the MUSIC [24] algorithm to the MC [25] algorithm to ensure cognitive radio's knowledge on the location of primary and secondary users. However, there are no perfect techniques which would always ensure a precise enough location estimate. Radio channel conditions may greatly vary over short periods of time, mutual interference among nodes may disturb adaptation processes, etc. We thus assume the MANET to never know the exact location of the PAs, but to rather have a coarse probabilistic estimate. Location estimates, such as the expectation, are much more useful if they are complemented with some indication about their precision. In order to visualize the uncertainty associated with the location of each PA, we assume that we have a probability distribution describing the uncertainty about the actual location. This can be done by drawing an Uncertainty Area (UA) centered at the estimated location such that the size and orientation describe the uncertainty of the location estimate as well as possible [26].

A bivariate Gaussian random variable with mean μ x (p) and μ y (p), and standard deviation σ x (p) on the abscissa and σ y (p) on the ordinate, is used to model the MANET location estimate of the p th PA. This Gaussian distribution also has an inclination λ (p) of any angle. By defining ΩUC (p) as the Uncertainty Coefficient, we thus obtain for the p th PA an UA of elliptical shape centered at (μ x (p), μ y (p)) with semimajor and semiminor axes, respectively, defined as
A UC ( p ) Ω UC ( p ) σ x ( p ) , B U C ( p ) Ω UC ( p ) σ y ( p ) .
(5)
As explained in the following section, ΩUC (p) is used to choose the size of the p th UA, which is of key importance for the proposed interference mitigation scheme. A typical example of our non-intrusive underlay spectrum sharing context with an UA associated to every PA is presented in Figure 1, where it is shown that a PA might even be located outside of its UA if ΩUC (p) is not chosen sufficiently large.
Figure 1

Example of our non-intrusive underlay spectrum sharing context with two PAs and seven SNs; all PAs' actual location are unknown by the MANET as opposed to their UA.

B. Requirements for coexistence

Since we consider any online communication to be impossible between both networks, our scheme is based on the idea that, prior the MANET deployment in the same environment as the primary network, both of them must agree with the coexistence based on the results of an offline Monte Carlo simulation. This type of simulation method consists on independently repeating random experiments, from which statistical results are extracted. Those statistics are then used as a basis for decision-making regarding wireless coexistence. To this end though, a different coexistence requirement must be respected by each network, both related with IA,o(p) p S P .

Indeed, what will prevent the coexistence acceptance by the primary network is a threatful aggregate interference underestimation (strictly negative I A ,o (p)) from the MANET obtained by simulation, which would make the latter erroneously believe that it can use an inappropriate transmission power for its communications once deployed. On the other hand, what will prevent the coexistence acceptance by the MANET is a too great aggregate interference overestimation (strictly positive I A ,o (p)) that would affect its QoS, by forbidding it from choosing necessary transmission power among its SNs, even if the received interference at PAs may be far from being critical.

For the primary network requirement and for all p S P , we define IA,UM(p) as the aggregate interference Underestimation Margin of the p th PA, with ηUM (p) as the maximum acceptable value of the probability Pout,UM (p) for an Underestimation Margin outage event Eout,UM (p) to occur. The reason for not having IA,UM(p) and ηUM (p) as simply two constants, i.e. IA,UMand ηUM applicable to any PA, is to be more general and flexible. Indeed, the primary network might have a different interference constraint to be respected by each of its PAs. There are assorted examples of this possible differentiation necessity from a primary network, such as interference protection priority among PAs, type-specific traffic related to each PA, variable reception gain of some PAs, etc. For the secondary network requirement, we define IA,OMas the aggregate interference overestimation margin of all PAs, with ηOM as the maximum acceptable value of the probability Pout,OM (p) for an overestimation margin outage event Eout,OM (p) to occur. Since the secondary network is not concerned with the interference overestimation with respect to a particular PA, but rather to any of them, there is no need to have a distinct value of IA,OMand ηOM for each PA, like their counter parts IA,UM(p) and ηUM (p) explained previously. These two coexistence requirements are thus summarized as follows for all p S P :
E out,UM ( p ) I A , o ( p ) I A , UM ( p ) , P out,UM ( p ) E out,UM ( p ) η UM ( p )
(6)
and
E out,OM ( p ) I A , o ( p ) I A , OM , P out,OM ( p ) E out,OM ( p ) η OM .
(7)
By convention, each PA is considered separately, so that if any of both requirements is not respected by more than one PA, the number of outage events will simply equal the number of concerned PAs. For the p th PA, the events Eout,UM (p) and Eout,OM (p) are not jointly exhaustive since it is fortunately possible in a scenario that none of them occur. They are however mutually exclusive since both of them cannot occur simultaneously. They are not independent since, as they are both dependent on ΩUC (p), knowing that one of them occurs obviously affects the probability of the other to occur. In fact, as ΩUC (p) increases, Pout,UM (p) tends to decrease while Pout,OM (p) tends to increase, as explained in the next section and demonstrated by simulation in Section 5. All symbols presented in this section are finally summarized in Table 1, roughly ordered by appearance.
Table 1

Summary of model's symbols

S T :

Set of all transmitting SNs

S P :

Set of all PAs

i:

Any given transmitting SN (i S T )

j:

Any given receiving SN

p:

Any given PA (p S P )

G T (i):

i's antenna gain

G R (j):

j 's antenna gain

θ (i)/θ (j):

i's/j's beamwidth

d (i,p):

Distance between i and p

d0:

Far-field distance, d(i,p) ≥ d0

α:

Path loss exponent

C (i,p):

Random slow fading between i and p

σ C :

Slow fading standard deviation

P T (i):

i's transmission power

rINT (i,p):

Interference radius from i to p

rINT,e(i,p):

MANET estimate of rINT (i,p)

I R (i,p):

Received interference from i to p

IR,e(i,p):

MANET estimate of I R (i,p)

PMNZ:

Minimum non-zero power threshold

r MNZ (i):

Distance from i to reach P MNZ

I A (p):

p's aggregate interference

IA,e(p):

MANET estimate of I A (p)

IA,o(p):

p's aggregate interference offset

μ x (p):

MANET estimate of p's mean x location

μ y (p):

MANET estimate of p's mean y location

σ x (p):

MANET estimate of p's std x location

σ y (p):

MANET estimate of p's std y location

λ (p):

p's UA inclination

ΩUC (p):

p's Uncertainty coefficient

AUC (p):

p's UA semimajor axis

B UC (p):

p's UA semiminor axis

IA,UM(p):

I A (p)'s Underestimation margin

Eout,UM (p):

IA,UM(p)'s outage event

Pout,UM (p):

Occurrence probability of Eout,UM (p)

ηUM (p):

Max. acceptable value of Pout,UM (p)

IA,OM:

I A (SP)'s Overestimation margin

Eout,OM (p):

IA,OM's outage event for p

Pout,OM (p):

Occurrence probability of Eout,OM (p)

ηOM:

Max. acceptable value of Pout,OM (S P )

4. New interference estimation technique

The proposed non-intrusive interference mitigation approach, which we call Border-UA, intentionally tries to overestimate I R (i,p) for all i S T and p S P by calculating the estimated interference inside or at the edge of the UA surrounding p's mean location estimate, and the UA size of p is chosen with the parameter ΩUC (p). If i lies inside the UA of p, the MANET considers the interference that i causes to the same geographical point as i's own location for IR,e(i,p)'s value by setting rINT, e (i,p) = d0. On the other hand, if the i th SN lies outside the UA of p, the MANET considers the interference that i causes to the closest geographical point on the edge of this UA for IR,e(i,p)'s value. In the case where the RCA of i does not intersect with the UA of p, then IR,e(i,p) is considered to be null by simply setting rINT,e(i,p) = ∞. An example of this simple but efficient technique is shown in Figure 2, entirely based on the example of Figure 1, where every rINT,e(i,p) can also be compared with its counterpart rINT (i,p). The remainder of this section shows how to obtain rINT,e(i,p) and, once those radii are known, the previously described methodology can be applied to generate the upcoming simulation of Section 5.
Figure 2

Illustration of our Border-UA interference estimation technique, taken from the example of Figure 1, showing r INT ( i , p ) as well as rINT,e( i , p ) in order to respectively obtain I R ( i , p ) and IR,e( i , p ), i S T and p S P .

A. RCA's intersection with UA

The UA of the p th PA is modeled as an ellipse rotated by an angle ϕ E and then translated at coordinates (x E , y E ), with a semimajor axis of A E and a semiminor axis of B E , which can be parametrically expressed as follows [27]:
x ( t ) = x E + A E cos ( φ E ) - B E sin ( φ E ) , y ( t ) = y E + B E sin ( t ) cos ( φ E ) + A E cos ( t ) sin ( φ E ) , A E B E > 0 , - 18 0 t 18 0 .
(8)
One must be aware that the angle t is relative to the positive semimajor axis and on the ellipse space, which is different from the 2D Euclidean space, not only by a translation and rotation (because of x E , y E and ϕ E when different from zero), but also by a scale on both axes (because of A E and B E when different from one). For an external point to this ellipse with coordinates (x P ,y P ), let v ( t ) be a vector starting at (x P , y P ) and ending at (x (t), y (t)). We define t P as the angle of the external point on the ellipse space, which can be easily obtained. Let v N v ( t N ) be the vector normal to the ellipse which occurs at t = t N , and let v T 1 v ( t T 1 ) and v T 2 v ( t T 2 ) be the two vectors tangent to the ellipse which occur at t = t T 1 and t = t T 2 , respectively. By extruding a circular sector of angle ϕL,Rfrom the external point, with vectors u C , u R , , and u L starting at (x P , y P ) and ending at the center, the right extremity, and the left extremity of the sector edge, respectively, the RCA of i is modeled. We define the following angles on the Euclidean space:
φ N , T 1 v N , v T 1 , φ N , T 2 v N , v T 2 , φ R , N v R , v N , φ C , N 1 v C , v N 1 , φ L , N v L , v N .
(9)
Finally, in some circumstances (see Figure 3), we may need to use the vector w u L or w u R , ending at (x (t w ),y(t w )), which occurs at t = t w (thus w v ( t w ) ). Such an UA and RCA with the aforementioned parameters are depicted in Figure 4.
Figure 3

Flow diagram of the algorithm to set the RCA's radius r .

Figure 4

Visual representation of an SN's transmission RCA with respect to the UA of a PA.

The radius r of the RCA can be obtained by four different ways depending on the circumstances as shown by the flow diagram in Figure 3, which actually gives the value of rINT,e(i,p). Indeed, the model described above can be directly applied to our MANET and primary network with the following replacements:
x E , y E μ x ( p ) , μ y ( p ) , A E A UC ( p ) , B E B UC ( p ) , x p , y p x ( i ) , y ( i ) , φ L , R θ ( i ) , r r INT , e ( i , p ) .
(10)

Nonetheless, the parameters t N , t T 1 , t T 2 and t w need to be approximated in order to do so, which is explained next.

B. Iterative methods for parameters approximation

A vector starting at (x P ,y P ) and ending at (x(t),y(t)) perpendicular to the UA would result on having its length minimized. This is actually the case with v N for which v ( t ) has its global minimum at t = t N . Because of the non-linearity of v ( t ) , it becomes much more affordable to approximate t N by an iterative method rather than trying to get its exact value analytically [28]. Using the BFGS Quasi-Newton method with a mixed quadratic and cubic line search procedure [29], and starting this unconstrained nonlinear optimization with t P as the initial estimate, we attempt to find the minimum of v ( t ) to obtain an approximation of t N . It has to be noted that, depending on the circumstances, i.e., the location of the external point with respect to the UA as well as the value of the ellipse parameters, it may occur for v ( t ) to have two minima. For the one-minimum case, the convergence is guaranteed from the fact that it is impossible for t P to be located at the unique maximum. For the two-minima case, it is also impossible for t P to be located at one of both maxima, and will always be located on the side of both maxima leading to the global minimum, hence the convergence is also guaranteed.

For two vectors starting at (x P , y P ) and ending tangent to the UA on both sides of v N , two minima must be found for the function
f ( t ) = - v N v ( t ) v N v ( t ) ,
(11)

occurring at t = t T 1 and t = t T 2 . The function in (11) is actually the negative of the cosine of the angle between v N and v ( t ) , from the vector dot product equation, where we have added the negative sign in order to find two minima instead of two maxima. Since one of its maxima is located at t = t N which has previously been approximated, both minima are obviously located on both sides of it. Using the same iterative method as the one to approximate t N , we now find the two minima of f (t) with t N ± 1° as initial estimates. For the input parameters used in our simulation, the choice of these initial estimates ensures that both executions of the search procedure will always distinctly converge to both minima. However, the value of the initial estimates to guarantee convergence will depend on the typical scenario to consider as well as the required precision, but this minor issue is rather irrelevant with today's computing capabilities and precision.

An iterative approach is also required to approximate t w . For this purpose, we use an optimization algorithm based on a golden section search and parabolic interpolation [30] to find the minimum of the function
g ( t ) = - w v ( t ) w v ( t )
(12)

between bounds b1 and b2 (see Figure 3), which are used to prevent the algorithm from getting the wrong minimum, so that the convergence to the global minimum is guaranteed. Similarly as for f(t) in (11) described previously, the function g(t) in (12) is the negative of the cosine of the angle between w and v ( t ) from the vector dot product equation.

The presented approaches to approximate t N , t T 1 , t T 2 , and t w are all based on the search of a global minimum of a one-parameter nonlinear function, for which the initial estimate is judiciously chosen to guarantee convergence and correctness. However, one must be aware that the complexity and precision are directly related to the termination tolerance on both t and the function value, and the allowed maximum number of both iterations and function evaluations of the aforementioned iterative algorithms. Fortunately, because of the random nature of radio-wave propagation, the exactness of these values is not crucial, since a not so small difference between the exact and approximated values is very unlikely to influence the interference estimation.

5. Simulation

A Monte Carlo simulation with Matlab was performed to assess our Border-UA technique. The simulation is made of a large number of independently generated scenarios forming the samples from which relevant statistics are extracted. For each scenario, SNs as well as the estimated location of only one PA, i.e., the mean (μ x (p), μ y (p)), are randomly uniformly distributed on a 2D simulation area. A bivariate Gaussian distribution with means μ x (p) and μ y (p), and standard deviations σ x (p) and σ y (p) is then used for the actual location (in meters) of the unique PA, followed by an uniformly distributed inclination with (μ x (p), μ y (p)) as the rotation center. The resultant PAs actual location may lie outside the simulation area, but is still considered. Since we consider the worst case situation where all PAs are in receiving mode, the presence of one PA does not affect SNs or other PAs in any way, so all PAs can thus be treated independently and separately. Therefore, setting more than one PA per scenario would be useless as the obtained statistics from only one PA are the same for all other PAs. The primary network sets IA,UM(S P ) with ηUM (S P ) while the MANET sets IA,OMwith ηOM as their respective coexistence requirements.

For each scenario, IA,o(p) is calculated for each possible value of ΩUC (p) from a chosen relevant continuous interval. This results on a large amount of IA,o(p) values associated with each ΩUC (p), forming an Empirical Cumulative Distribution Function (ECDF). Such an ECDF is then separated into a partial ECDF for all IA,o(p) < 0, and a partial Empirical Complementary CDF (ECCDF) for all IA,o(p) > 0. The former is used by the primary network to assess the aggregate interference underestimation, whereas the latter is used by the MANET to assess the overestimation. It has to be noted that neither of both partial CDFs includes IA,o(p) = 0 since it only occurs when no RCA intersects the UA of p and actual location, so it is not of any help. The upcoming example represents a typical possible simulation from which the primary and secondary networks could justify their coexistence decision. One should note that, because of the uniqueness of our non-intrusive coexistence condition still not considered in literature up to now, our simulation results cannot be compared with any previous method, as already mentioned.

A. Results of a coexistence example

We consider a 1.0 km2 deployment site as a coexistence example, where the primary network is composed of 3 PAs respectively named "PA #1", "PA #2", and "PA #3" for S P = {1,2,3}, and the MANET is composed of 35 SNs. We use our previously developed Closest Successful Receiver to Random Transmitters (CSRRT) algorithm presented in [21] to establish the communication links among SNs in order to obtain S T . The simple but realistic resultant connectivity from this algorithm depends on the constant receiving SN noise power N R , the SINR threshold γSINR, the link factor ξ, and the same constant narrow beamwidth used by both transmitting and receiving SNs (ensuring a relatively high connectivity). All simulation input parameters are listed in Table 2.
Table 2

Simulation input parameters

Scenarios:

Area = 1.0 × 1.0 km2

Number of PAs = 3

Number of SNs = 35

Number of scenarios = 25000

σ x (p) ~ σ y (p) · U [1,4], p S P

σ y (p) ~ U [6,18],p S P

ΩUC (p) [0.0, 0.2,..., 5.0], p S P

Radio propagation:

α = 2.1

σ C = 0.2

d0 = 1.0 m

PMNZ = 10-15 W

Coexistence requirements

Primary network

IA,UM(1) = -10-6 W, ηUM (1) = 0.02

IA,UM(2) = -5 × 10-6 W, ηUM (2) = 0.008

IA,UM(3) = -10-5 W, ηUM (3) = 0.001

Secondary network

IA,OM= 5 × 10-5 W, ηOM = 0.15

CSRRT algorithm

N R = 5 × 10-15 W

γSINR = 13 dB

ξ = 1.25

θ(i)= θ (j) = 60°

G T (i) = 2π/θ (i), g R (j) = 2π/θ (j)

Those parameters are chosen so as to represent a MANET deployment with high node density, in a typical urban area. Such a cluttered RF environment gives rise to the relatively high imprecision on PAs location estimate by the MANET. In regard to the coexistence requirements, different IA,UM(p)'s and ηUM (p)'s value were attributed for each PA, with the objective of providing a better idea of the flexibility offered by our scheme. Meanwhile, IA,OM's and ηOM's values were simply set as if the MANET were not too demanding with respect to its own performance--for its deployment to be possible.

All simulation results are shown in Figures 5, 6, and 7. The five-number summaries of the random variable IA,o(p) for the underestimation and overestimation are presented in Figure 5a,b, respectively. This statistical summary, as a function of ΩUC (p), comprises the minimum value, the first quartile, the median, the third quartile and the maximum value. Still as a function of ΩUC (p), Figure 5c shows the occurrence probability of having an aggregate interference underestimation (IA,o(p) < 0), overestimation (IA,o(p) > 0) or a null offset (IA,o(p) = 0). For each scenario and a given value of ΩUC (p), exactly and only one of those three aforementioned possibilities occurs, since the simulation is actually performed with only one PA as explained previously.
Figure 5

Statistics of I A , o ( p ) from simulation: (a) five-number summary of underestimation, (b) five-number summary of overestimation, (c) occurrence probabilities.

Figure 6

Simulation results: (a) partial ECDF for the aggregate interference underestimation and showing the primary network requirements (IA,UM(S P ) and ηUM (S P )), (b) partial ECCDF for the aggregate interference overestimation and showing the MANET requirements (IA,OMand ηOM).

Figure 7

Simulation results: (a) Pout,UM (S P ) for the primary network decision on the minimal permitted value of ΩUC (S P ); (b) Pout,OM (S P ) for the MANET decision on the maximal permitted value of ΩUC (S P ).

It is important to note that, as shown in Figure 5c, the number of available samples (scenarios) is not constant as a function of ΩUC (p) in Figure 5a,b. When ΩUC (p) = 0.0, the underestimation and overestimation occurrence probabilities are about the same because p does not have an UA yet, and the null offset probability is at its maximum (although quite low) for the same reason. Therefore, as ΩUC (p) increases, the number of underestimation samples for Figure 5a decreases while the number of overestimation samples for Figure 5b increases. The five-number summaries of Figure 5a,b finally show that IA,o(p) clearly tends to statistically increase as ΩUC (p) increases, which is obviously expected.

The partial ECDF for the aggregate interference underestimation is presented in Figure 6a where the thick dashed lines represent the requirements of the primary network to be respected (IA,UM(S P ) and ηUM (S p )). The partial ECCDF for the aggregate interference overestimation is presented in Figure 6b, where the thick dashed lines represent the requirement of the MANET to be respected (IA,OMand ηOM). Figure 7a presents Pout,UM (S P ) as a function of ΩUC (S P ), where the thick dashed lines show the minimum value of ΩUC (S P ) for the primary network requirements to be respected. Figure 7b presents Pout,OM (S P ) as a function of ΩUC (S P ) where the black thick dashed lines show the maximum value of ΩUC (S P ) for the MANET requirement to be respected. One can also see from Figure 7b the gray thick dashed lines at the minimum value of ΩUC (S P ) taken from Figure 7a, so the interval of possible value of ΩUC (S P ) can be clearly seen for each PA in order for the coexistence to be accepted by both networks.

B. Discussion

Both Figures 6 and 7 are essential in the coexistence decision process after the Monte Carlo simulation has been completed. Notwithstanding the fact that Figure 7 is by far the most convenient between both figures to precisely determine the permitted ΩUC (S P )'s interval granted that IA,UM(S p ), ηUM (S P ), IA,OMand ηOM are fixed, Figure 6 gives a much better overview of the worthy value range of those coexistence requirement parameters. Indeed, an informal decision can easily be taken by both network managers by only taking a glance at Figure 6, which is not possible with Figure 7 as a degree of liberty is lost since IA,UM(S p ) and IA,OMare now implicit to the curves. It is clearly shown in Figure 7b that the coexistence is possible if ΩUC (1) [2.19, 3.25] for "PA #1", ΩUC (2) [0.9,3.25] for "PA #2" and ΩUC (3) [2.75, 3.25] for "PA #3". The optimal value for ΩUC (S P ) to choose among those intervals is however out of the scope of this article as it may depend on many factors. For instance, it could be settled that the primary network remains always privileged by choosing the maximum permitted value of ΩUC (S P ) so that its aggregate interference is minimized. Under other circumstances, some performance metrics could be accounted by both networks so that the value of ΩUC (S P ) is chosen such that an agreed Pareto optimum is obtained. Choosing the optimal ΩUC (S P ) might be the subject of our future research.

One should note that the presented simulation results strongly depend on our antenna and radio propagation models, the simulation area, the number of PAs and SNs as well as the algorithm used (CRSST) to establish communication links among SNs. Changing any of those attributes could give results at a rather different scale, but the main trends would always be the same. Even if modeling smart-antenna radiation-beam patterns with circular sectors might seem too simplistic, real beam patterns can actually be precisely modeled by many adjacent circular sectors, so our scheme is thus fully applicable for any model to reach the desired real-world fidelity.

6. Conclusion

A novel and very promising interference mitigation approach has been described in this article, which greatly takes advantage of the use of smart antennas by secondary network nodes when arbitrarily deployed in the same area as primary network antennas. Our scheme is especially designed to cope with the very poor or non-existent online communication between primary and secondary networks, which is highly prone to lead to an inaccurate probabilistic location estimate of each PA by the SNs. By selecting the appropriate size of an UA surrounding the estimated location of each PA, the trade-off between aggregate interference underestimation and overestimation can statistically be tuned by a Monte Carlo simulation prior the secondary network deployment, provided that wireless coexistence requirements are communicated offline between both networks.

Ensuring non-intrusive integration of a MANET in the same spatial and spectral environment as a primary network, by assuming no online communication between them, undoubtedly makes any coexistence adaptation quite tedious by both parties. Without any feedback from the concurrent network, the other one will not be able to reach its quasi-optimal performance, and vice versa. Nevertheless, if each network keeps a history of its activity and QoS-related metrics over time, a periodic offline feedback is still possible between both network managers, and coexistence requirements updated accordingly. Such an offline adaptation might be really valuable in the situations explained in [31] where malicious radio nodes (as enemies from a third network, for instance) try to spoof the online communicated feedback between the secondary and primary networks, in order for the intelligent adaptive capabilities of the former to unfortunately play against itself.

Our scheme could even be employed without any requirement communicated offline between networks, as for military applications. The secondary network requirement would then become a QoS constraint, and the primary network requirement would become an interference constraint (for the secondary network not to be detected due to its own transmissions). Determining the optimal ΩUC (p), instead of an acceptable interval, might even be done by online adaptation in our future study, for which many original approaches are yet to be discovered. Using the same coexistence constraints as mentioned in this article, but by providing even greater values for ΩUC (S P )'s upper and lower bounds, is of real interest and also part of our future study. On the one hand, the greater is the UAs size of a PA for fixed coexistence constraints, the greater is the probability of this PA to be located inside of its UA, and hence a better interference protection is permitted. On the other hand, if one assumes the primary network to be also composed of primary users receiving data from these PAs, as for the upcoming IEEE 802.22 WRAN standard for the digital TV Broadcast spectrum sharing [32], these primary users will also benefit from a better interference protection if their PAs use a greater UAs size.

Declarations

Authors’ Affiliations

(1)
INRS-EMT, Place Bonaventure
(2)
LRTCS-UQAT
(3)
Prompt Inc.

References

  1. Thoppian M, Venkatesan S, Prakash R, Chandrasekaran R: MAC-layer scheduling in cognitive radio based multi-hop wireless networks. IEEE Proceedings of the 2006 International Symposium on World of Wireless, Mobile and Multimedia Network 2006, 191-202.View ArticleGoogle Scholar
  2. McHenry M: Spectrum white space measurements, Presented to New America Foundation Broadband Forum; Measurements by Shared Spectrum Company. 2003.Google Scholar
  3. Zhao Q, Tong L, Swami A, Chen Y: Decentralized cognitive MAC for opportunistic spectrum access in ad hoc networks: a POMDP framework. IEEE J Sel Areas Commun 2007, 25(3):589-600.View ArticleGoogle Scholar
  4. Clancy T: Formalizing the interference temperature model. Wiley J Wirel Commun Mob Comput 2007, 7(9):1077-1086. 10.1002/wcm.482View ArticleGoogle Scholar
  5. Haykin S: Cognitive radio: brain-empowered wireless communications. IEEE J Sel Areas Commun (invited paper) 2005, 23(2):201-220.View ArticleGoogle Scholar
  6. FCC Notice of Inquiry and Notice of Proposed Rule Making, In the matter of establishment of an interference temperature metric to quantify and manage interference and to expand available unlicensed operation in certain fixed, mobile and satellite frequency bands, Et Docket No. 03-237 2003.Google Scholar
  7. Sharma M, Sahoo A, Nayak KD: Channel modeling based on interference temperature in underlay cognitive wireless networks. In IEEE International Symposium on Wireless Communication Systems (ISWCS). Reykjavik, Iceland; 2008:224-228.Google Scholar
  8. Chen T, Zhang H, Kartz M: CogMesh: cognitive wireless mesh networks. In Proceedings of IEEE Globecom 2008 (Workshop on Wireless Mesh and Sensor Networks). New Orleans, LA, USA; 2008.Google Scholar
  9. Kim DI, Le LB, Hossain E: Joint rate and power allocation for cognitive radios in dynamic spectrum access environment. IEEE Trans Wirel Commun 2008, 7(12):5517-5527.View ArticleGoogle Scholar
  10. Huang S, Ding Z, Liu X: Non-intrusive cognitive radio networks based on smart antenna technology. In IEEE Global Telecommunications Conference (GLOBECOM). Washington, DC, USA; 2007:4862-4867.Google Scholar
  11. Hanif MF, Smith PJ: On the statistics of cognitive radio capacity in shadowing and fast fading environments. IEEE Trans Wirel Commun 2010, 9(2):844-852.View ArticleGoogle Scholar
  12. Yiu S, Vu M, Tarokh V: Interference and noise reduction by beamforming in cognitive networks. IEEE Trans Commun 2009, 57(10):3144-3153.View ArticleGoogle Scholar
  13. Zhao G, Ma J, Li GY, Wu T, Kwon YH, Soong A, Yang C-Y: Spatial spectrum holes for cognitive radio with relay-assisted directional transmission. IEEE Trans Wirel Commun 2009, 8(10):5270-5279.View ArticleGoogle Scholar
  14. Vu M, Devroye N, Tarokh V: On the primary exclusive region of cognitive networks. IEEE Trans Wirel Commun 2009, 8(7):3380-3385.View ArticleGoogle Scholar
  15. Chen Y, Yu G, Zhang Z, Chen H, Qiu P: On cognitive radio networks with opportunistic power control strategies in fading channels. IEEE Trans Wirel Commun 2008, 7(7):2752-2761.View ArticleGoogle Scholar
  16. Sharma M, Sahoo A, Nayak KD: Channel selection under interference temperature model in multi-hop cognitive mesh networks. In IEEE 2nd International symposium on New Frontiers in Dynamic Spectrum Access Networks. Dublin, Ireland; 2007:133-136.View ArticleGoogle Scholar
  17. Chowdhury KR, Akyildiz IF: OFDM-based common control channel design for cognitive radio ad hoc networks. IEEE Trans Mob Comput 2011, 10(2):228-238.View ArticleGoogle Scholar
  18. Wang L-C, Chen A: Effects of location awareness on concurrent transmissions for cognitive ad hoc networks overlaying infrastructure-based systems. IEEE Trans Mob Comput 2009, 8(5):577-589.View ArticleGoogle Scholar
  19. Zhang YJ, So AM-C: Optimal spectrum sharing in MIMO cognitive radio networks via semidefinite programming. IEEE J Sel Areas Commun 2011, 29(2):362-373.View ArticleGoogle Scholar
  20. Boutin M, Despins C, Denidni T: Interference protection on legacy devices with cognitive radio using smart antennas. In IEEE 70th Vehicular Technology Conference. Anchorage, Alaska, USA; 2009.Google Scholar
  21. Boutin M, Despins C, Denidni T, Affes S: A novel interference safety margin for cognitive radio MANET using smart antennas. Special Issue on Wireless Communication on Underground and Confined Areas. J Commun 2009, 4(4):257-266.Google Scholar
  22. Boutin M, Benzakour A, Despins CL, Affes S: Radio wave characterization and modeling in underground mine tunnels. IEEE Trans Antenn Propag 2008, 56(2):540-549.View ArticleGoogle Scholar
  23. Duval O, Punchihewa A, Gagnon F, Despins C, Bhargava VK: Blind multi-sources detection and localization for cognitive radio. In IEEE Global Telecommunications Conference (GLOBECOM). New Orleans, LA, USA; 2008.Google Scholar
  24. Godara LC: Smart Antennas. CRC Press; 2004.View ArticleGoogle Scholar
  25. Punchihewa A, Dobre OA, Rajan S, Inkol R: Cyclostationarity-based algorithm for blind recognition of OFDM and single carrier linear digital modulations. In IEEE 18th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC). Athens, Greece; 2007.Google Scholar
  26. Kontkanen P, Myllymäki P, Roos T, Terri H, Valtonen K, Wettig H: Topics in probabilistic location estimation in wireless networks. In IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC). Volume 2. Barcelona, Spain; 2004:1052-1056.Google Scholar
  27. Miller CD, Lial ML, Schneider DI: Fundamentals of College Algebra. 3rd edition. Scott Foresman/Little; 1990.Google Scholar
  28. Ahn SJ, Rauh W, Recknagel M: Ellipse fitting and parameter assessment of circular object targets for robot vision, in. In IEEE/RSJ Proceedings, International Conference on Intelligent Robots and Systems (IROS). Volume 1. Kyongju, South Korea; 1999:525-530.Google Scholar
  29. Fletcher R: Practical Methods of Optimization, Vol 1 Unconstrained Optimization. Wiley; 1980.Google Scholar
  30. Brent RP: Algorithms for Minimization Without Derivatives. Prentice-Hall, Englewood Cliffs, NJ; 1973.Google Scholar
  31. Clancy TC, Goergen N: Security in cognitive radio networks: threats and mitigation, in. In IEEE 3rd International Conference on Cognitive Radio Oriented Wireless Networks and Communications (CrownCom). Singapore, Singapore; 2008.Google Scholar
  32. Stevenson C, Chouinard G, Zhongding L, Wendong H, Shellhammer S, Caldwell W: IEEE 802.22: the first cognitive radio wireless regional area network standard. IEEE Commun Mag 2009, 47(1):130-138.View ArticleGoogle Scholar

Copyright

© Boutin et al; licensee Springer. 2011

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.