# Laplace Functional Ordering of Point Processes in Large-Scale Wireless Networks

Authors: Junghoon Lee; Cihan Tepedelenlioğlu
Journal: Wireless Communications and Mobile Computing
 (2018)

---

## Abstract

Stochastic orders on point processes are partial orders which capture notions like being larger or more variable. Laplace functional ordering of point processes is a useful stochastic order for comparing spatial deployments of wireless networks. It is shown that the ordering of point processes is preserved under independent operations such as marking, thinning, clustering, superposition, and random translation. Laplace functional ordering can be used to establish comparisons of several performance metrics such as coverage probability, achievable rate, and resource allocation even when closed form expressions of such metrics are unavailable. Applications in several network scenarios are also provided where tradeoffs between coverage and interference as well as fairness and peakyness are studied. Monte-Carlo simulations are used to supplement our analytical results.


---

## Body

## 1. Introduction

Point processes have been used to describe spatial distribution of nodes in wireless networks. Examples include randomly distributed nodes in wireless sensor networks or ad hoc networks [1–4] and the spatial distributions for base stations and mobile users in cellular networks [5–10]. In the case of cognitive radio networks, locations of primary and secondary users have been modeled as point processes [11–14]. Random translations of point processes have been used for modeling of mobility of networks in [15]. Stationary Poisson processes provide a tractable framework, but suffer from notorious modeling issues in matching real network distributions. Stochastic ordering of point processes provides an ideal framework for comparing two deployment/usage scenarios even in cases where the performance metrics cannot be computed in closed form. These partial orders capture intuitive notions like one point process being more dense or more variable. Existing works on point process modeling for wireless networks have paid little attention to how two intractable scenarios can be nevertheless compared to aid in system optimization.Recently stochastic ordering theory has been used for performance comparison in wireless networks which are modeled as point processes [16–20]. Directionally convex (DCX) ordering of point processes and its integral shot noise fields have been studied in [16]. The work has been extended to the clustering comparison of point processes with various weaker tools, including void probabilities and moment measures, than DCX ordering in [17]. In [18], usual stochastic ordering of random variables capturing carrier-to-interference ratio has been established in cellular systems. Ordering results for coverage probability and per user rate have been shown in multiantenna heterogeneous cellular networks [19]. In [20], Laplace functional (LF) ordering of point processes has been introduced and used to study interference distributions in wireless networks. Several examples of the LF ordering of specific point processes have been also introduced in [20], including stationary Poisson, mixed Poisson, Poisson cluster, and binomial point processes.While limited examples of the LF ordering have been provided in [20], in this paper we apply the LF ordering concept to several general classes of point processes such as Cox, homogeneous independent cluster, perturbed lattice, and mixed binomial point processes which have been used to describe distributed nodes of wireless systems in the literature. We also investigate the preservation properties of the LF ordering of point processes with respect to independent operations such as marking, thinning, random translation, and superposition. We prove that the LF ordering of original point processes still holds after applying these operations on the point processes. To the best of our knowledge, there is no study on LF ordering of general classes of point processes and their preservation properties in the literature. Through the preservation properties of LF ordering with respect to independent operations on a point process such as marking, thinning, random translation, and superposition which is done in our manuscript, we can consider several effects of real systems such as propagation effects over wireless channels, multiple access schemes, heterogeneous network scenarios, and mobile networks and compare performances without having to obtain closed form results for a wide range of performance metrics such as coverage probability, achievable rate, and resource allocation under these real system effects. In addition to the performance comparison, the stochastic ordering of point processes provides insights into the system design and evaluation such as network deployment and user selection schemes as we summarize in this paper.The paper is organized as follows: In Section2, we introduce mathematical preliminaries. Section 3 introduces ordering of point processes. In Section 4, we show the preservation properties of LF ordering. Sections 5.1 and 5.2 introduce applications of stochastic ordering of point processes in wireless networks. We also elaborate the qualitative insights of the stochastic ordering of point processes on the system design and evaluation in Section 5.3. Section 6 presents simulations to corroborate our claims. Finally, the paper is summarized in Section 7.


## 2. Mathematical Preliminaries

### 2.1. Stochastic Ordering of Random Variables

Before introducing ordering of point processes, we briefly review some common stochastic orders between random variables, which can be found in [21, 22].


#### 2.1.1. Usual Stochastic Ordering

LetX and Y be two random variables (RVs) such that(1)
P
X
>
x
≤
P
Y
>
x
,
-
∞
<
x
<
∞
.Then X is said to be smaller than Y in theusual stochastic order (denoted by X
≤
s
t
Y). Roughly speaking, (1) says that X is less likely than Y to take on large values. To see the interpretation of this in the context of wireless communications, when X and Y are distributions of instantaneous SNRs due to fading, (1) is a comparison of outage probabilities. Since X
,
Y are positive in this case, x
∈
R
+ is sufficient in (1).


#### 2.1.2. Laplace Transform Ordering

LetX and Y be two nonnegative RVs such that(2)
L
X
s
=
E
e
x
p
-
s
X
≥
E
e
x
p
-
s
Y
=
L
Y
s
for
s
>
0
.Then X is said to be smaller than Y in theLaplace transform (LT)order (denoted by X
≤
L
t
Y). For example, when X and Y are the instantaneous SNR distributions of a fading channel, (2) can be interpreted as a comparison of average bit error rates for exponentially decaying instantaneous error rates (as in the case for differential-PSK (DPSK) modulation and Chernoff bounds for other modulations) [23]. The LT order X
≤
L
t
Y is equivalent to(3)
E
l
X
≥
E
l
Y
,for allcompletely monotonic (c.m.) functions l
(
·
) [22, pp. 96]. By definition, the derivatives of a c.m. function l
(
x
) alternate in sign: (
-
1
)
n
d
n
l
(
x
)
/
d
x
n
≥
0, for n
=
0,1
,
2
,
…, and x
≥
0. An equivalent definition is that c.m. functions are positive mixtures of decaying exponentials [22]. A similar result to (3) with a reversal in the inequality states that(4)
X
≤
L
t
Y
⇔
E
l
X
≤
E
l
Y
,for all l
(
·
) that have a completely monotonic derivative (c.m.d.). Finally, note that X
≤
s
t
Y
⇒
X
≤
L
t
Y. This can be shown by invoking the fact that X
≤
s
t
Y is equivalent to E
[
l
(
X
)
]
≤
E
[
l
(
Y
)
] whenever l
(
·
) is an increasing function [22] and that c.m.d. functions in (4) are increasing.


### 2.2. Point Processes and Random Measures

Point processes have been used to model large-scale networks [1, 2, 13, 24–29]. Since wireless nodes are usually not colocated, our focus is onsimple point processes, where only one point can exist at a given location. In addition, we assume the point processes are locally finite; i.e., there are finitely many points in any bounded set. Unlike [20], stationary and isotropic properties are not necessary in this paper. In what follows, we introduce some fundamental notions that will be useful.


#### 2.2.1. Campbell’s Theorem

It is often necessary to evaluate the expected sum of a function evaluated at the point processΦ. Campbell’s theorem helps in evaluating such expectations. For any nonnegative measurable function u which runs over the set U of all nonnegative functions on R
d,(5)
E
∑
x
∈
Φ
u
x
=
∫
R
d
u
x
Λ
d
x
.The intensity measure Λ of Φ in (5) is a characteristic analogous to the mean of a real-valued random variable and defined as Λ
(
B
)
=
E
Φ
(
B
) for bounded subsets B
⊂
R
d. Thus, Λ
(
B
) is the mean number of points in B. If Φ is stationary, then the intensity measure simplifies as Λ
(
B
)
=
λ
B for some nonnegative constant λ, which is called the intensity of Φ, where B denotes the d dimensional volume of B. For stationary point processes, the right side in (5) is equal to λ
∫
R
d
u
(
x
)
d
x. Therefore, any two stationary point processes with the same intensity lead to equal average sum of a function (when the mean value exists).A random measureΨ is a function from Borel sets in R
d to random variables in R
+. TheLaplace functional
L of random measure Ψ is defined by the following formula(6)
L
Ψ
u
≔
E
e
-
∫
R
d
u
x
Ψ
d
x
.The Laplace functional completely characterizes the distribution of the random measure [25]. A point process Φ is a special case of a random measure Ψ where the measure takes on values in the nonnegative integer random variables. In the case of the Laplace functional of a point process, ∫
R
d
u
(
x
)
Φ
(
d
x
) can be written as ∑
x
∈
Φ
u
(
x
) in (6). As an important example, the Laplace functional L of Poisson point process of intensity measure Λ is(7)
L
Φ
u
=
e
x
p
-
∫
R
d
1
-
exp
⁡
-
u
x
Λ
d
x
.If the Poisson point process is stationary, the Laplace functional simplifies with Λ
(
d
x
)
=
λ
d
x.


#### 2.2.2. Laplace Functional Ordering

In this section, we introduce the Laplace functional stochastic order between random measures which can also be used to order point processes.Definition 1.
LetΨ
1 and Ψ
2 be two random measures such that(8)
L
Ψ
1
u
=
E
e
-
∫
R
d
u
x
Ψ
1
d
x
≥
E
e
-
∫
R
d
u
x
Ψ
2
d
x
=
L
Ψ
2
uwhere u
(
·
) runs over the set U of all nonnegative functions on R
d. Then Ψ
1 is said to be smaller than Ψ
2 in the Laplace functional (LF) order (denoted by Ψ
1
≤
L
f
Ψ
2).In this paper, we focus on the LF order of point processes unless otherwise specified. Note that the LT ordering in (2) is for RVs, whereas the LF ordering in (8) is for point processes or random measures. They can be connected in the following way:(9)
Φ
1
≤
L
f
Φ
2
⇔
∑
x
∈
Φ
1
u
x
≤
L
t
∑
x
∈
Φ
2
u
x
,
∀
u
∈
U
.Hence, it is possible to think of LF ordering of point processes as the LT ordering of their aggregate processes. Intuitively, the LF ordering of point processes can be interpreted as the LT ordering of their aggregate interferences. The Laplace transform of interference is particularly convenient for the determination of outage probabilities under certain fading distributions (e.g., Rayleigh) [30] and is also useful in performance comparison. The LF ordering of point processes also can be translated into the ordering of coverage probabilities and spatial coverage which will be discussed in detail in Section 5. The probability generating functional is another mathematical tool for studying point processes [1]. The probability generating functional will provide the same results in our scenarios. However, we will focus on the Laplace functional of point process in our study since it is easy to relate the Laplace functional to interference metrics as mentioned above.


#### 2.2.3. Voronoi Cell and Tessellation

The Voronoi cellV
(
x
) of a point x of a general point process Φ
⊂
R
d consists of those locations of R
d whose distance to x is not greater than their distance to any other point in Φ; i.e.,(10)
V
x
≔
y
∈
R
d
:
x
-
y
≤
z
-
y
∀
z
∈
Φ
∖
x
.The Voronoi tessellation (or Voronoi diagram) is decomposition of the space into the Voronoi cells of a general point process.


## 2.1. Stochastic Ordering of Random Variables

Before introducing ordering of point processes, we briefly review some common stochastic orders between random variables, which can be found in [21, 22].


### 2.1.1. Usual Stochastic Ordering

LetX and Y be two random variables (RVs) such that(1)
P
X
>
x
≤
P
Y
>
x
,
-
∞
<
x
<
∞
.Then X is said to be smaller than Y in theusual stochastic order (denoted by X
≤
s
t
Y). Roughly speaking, (1) says that X is less likely than Y to take on large values. To see the interpretation of this in the context of wireless communications, when X and Y are distributions of instantaneous SNRs due to fading, (1) is a comparison of outage probabilities. Since X
,
Y are positive in this case, x
∈
R
+ is sufficient in (1).


### 2.1.2. Laplace Transform Ordering

LetX and Y be two nonnegative RVs such that(2)
L
X
s
=
E
e
x
p
-
s
X
≥
E
e
x
p
-
s
Y
=
L
Y
s
for
s
>
0
.Then X is said to be smaller than Y in theLaplace transform (LT)order (denoted by X
≤
L
t
Y). For example, when X and Y are the instantaneous SNR distributions of a fading channel, (2) can be interpreted as a comparison of average bit error rates for exponentially decaying instantaneous error rates (as in the case for differential-PSK (DPSK) modulation and Chernoff bounds for other modulations) [23]. The LT order X
≤
L
t
Y is equivalent to(3)
E
l
X
≥
E
l
Y
,for allcompletely monotonic (c.m.) functions l
(
·
) [22, pp. 96]. By definition, the derivatives of a c.m. function l
(
x
) alternate in sign: (
-
1
)
n
d
n
l
(
x
)
/
d
x
n
≥
0, for n
=
0,1
,
2
,
…, and x
≥
0. An equivalent definition is that c.m. functions are positive mixtures of decaying exponentials [22]. A similar result to (3) with a reversal in the inequality states that(4)
X
≤
L
t
Y
⇔
E
l
X
≤
E
l
Y
,for all l
(
·
) that have a completely monotonic derivative (c.m.d.). Finally, note that X
≤
s
t
Y
⇒
X
≤
L
t
Y. This can be shown by invoking the fact that X
≤
s
t
Y is equivalent to E
[
l
(
X
)
]
≤
E
[
l
(
Y
)
] whenever l
(
·
) is an increasing function [22] and that c.m.d. functions in (4) are increasing.


## 2.1.1. Usual Stochastic Ordering

LetX and Y be two random variables (RVs) such that(1)
P
X
>
x
≤
P
Y
>
x
,
-
∞
<
x
<
∞
.Then X is said to be smaller than Y in theusual stochastic order (denoted by X
≤
s
t
Y). Roughly speaking, (1) says that X is less likely than Y to take on large values. To see the interpretation of this in the context of wireless communications, when X and Y are distributions of instantaneous SNRs due to fading, (1) is a comparison of outage probabilities. Since X
,
Y are positive in this case, x
∈
R
+ is sufficient in (1).


## 2.1.2. Laplace Transform Ordering

LetX and Y be two nonnegative RVs such that(2)
L
X
s
=
E
e
x
p
-
s
X
≥
E
e
x
p
-
s
Y
=
L
Y
s
for
s
>
0
.Then X is said to be smaller than Y in theLaplace transform (LT)order (denoted by X
≤
L
t
Y). For example, when X and Y are the instantaneous SNR distributions of a fading channel, (2) can be interpreted as a comparison of average bit error rates for exponentially decaying instantaneous error rates (as in the case for differential-PSK (DPSK) modulation and Chernoff bounds for other modulations) [23]. The LT order X
≤
L
t
Y is equivalent to(3)
E
l
X
≥
E
l
Y
,for allcompletely monotonic (c.m.) functions l
(
·
) [22, pp. 96]. By definition, the derivatives of a c.m. function l
(
x
) alternate in sign: (
-
1
)
n
d
n
l
(
x
)
/
d
x
n
≥
0, for n
=
0,1
,
2
,
…, and x
≥
0. An equivalent definition is that c.m. functions are positive mixtures of decaying exponentials [22]. A similar result to (3) with a reversal in the inequality states that(4)
X
≤
L
t
Y
⇔
E
l
X
≤
E
l
Y
,for all l
(
·
) that have a completely monotonic derivative (c.m.d.). Finally, note that X
≤
s
t
Y
⇒
X
≤
L
t
Y. This can be shown by invoking the fact that X
≤
s
t
Y is equivalent to E
[
l
(
X
)
]
≤
E
[
l
(
Y
)
] whenever l
(
·
) is an increasing function [22] and that c.m.d. functions in (4) are increasing.


## 2.2. Point Processes and Random Measures

Point processes have been used to model large-scale networks [1, 2, 13, 24–29]. Since wireless nodes are usually not colocated, our focus is onsimple point processes, where only one point can exist at a given location. In addition, we assume the point processes are locally finite; i.e., there are finitely many points in any bounded set. Unlike [20], stationary and isotropic properties are not necessary in this paper. In what follows, we introduce some fundamental notions that will be useful.


### 2.2.1. Campbell’s Theorem

It is often necessary to evaluate the expected sum of a function evaluated at the point processΦ. Campbell’s theorem helps in evaluating such expectations. For any nonnegative measurable function u which runs over the set U of all nonnegative functions on R
d,(5)
E
∑
x
∈
Φ
u
x
=
∫
R
d
u
x
Λ
d
x
.The intensity measure Λ of Φ in (5) is a characteristic analogous to the mean of a real-valued random variable and defined as Λ
(
B
)
=
E
Φ
(
B
) for bounded subsets B
⊂
R
d. Thus, Λ
(
B
) is the mean number of points in B. If Φ is stationary, then the intensity measure simplifies as Λ
(
B
)
=
λ
B for some nonnegative constant λ, which is called the intensity of Φ, where B denotes the d dimensional volume of B. For stationary point processes, the right side in (5) is equal to λ
∫
R
d
u
(
x
)
d
x. Therefore, any two stationary point processes with the same intensity lead to equal average sum of a function (when the mean value exists).A random measureΨ is a function from Borel sets in R
d to random variables in R
+. TheLaplace functional
L of random measure Ψ is defined by the following formula(6)
L
Ψ
u
≔
E
e
-
∫
R
d
u
x
Ψ
d
x
.The Laplace functional completely characterizes the distribution of the random measure [25]. A point process Φ is a special case of a random measure Ψ where the measure takes on values in the nonnegative integer random variables. In the case of the Laplace functional of a point process, ∫
R
d
u
(
x
)
Φ
(
d
x
) can be written as ∑
x
∈
Φ
u
(
x
) in (6). As an important example, the Laplace functional L of Poisson point process of intensity measure Λ is(7)
L
Φ
u
=
e
x
p
-
∫
R
d
1
-
exp
⁡
-
u
x
Λ
d
x
.If the Poisson point process is stationary, the Laplace functional simplifies with Λ
(
d
x
)
=
λ
d
x.


### 2.2.2. Laplace Functional Ordering

In this section, we introduce the Laplace functional stochastic order between random measures which can also be used to order point processes.Definition 1.
LetΨ
1 and Ψ
2 be two random measures such that(8)
L
Ψ
1
u
=
E
e
-
∫
R
d
u
x
Ψ
1
d
x
≥
E
e
-
∫
R
d
u
x
Ψ
2
d
x
=
L
Ψ
2
uwhere u
(
·
) runs over the set U of all nonnegative functions on R
d. Then Ψ
1 is said to be smaller than Ψ
2 in the Laplace functional (LF) order (denoted by Ψ
1
≤
L
f
Ψ
2).In this paper, we focus on the LF order of point processes unless otherwise specified. Note that the LT ordering in (2) is for RVs, whereas the LF ordering in (8) is for point processes or random measures. They can be connected in the following way:(9)
Φ
1
≤
L
f
Φ
2
⇔
∑
x
∈
Φ
1
u
x
≤
L
t
∑
x
∈
Φ
2
u
x
,
∀
u
∈
U
.Hence, it is possible to think of LF ordering of point processes as the LT ordering of their aggregate processes. Intuitively, the LF ordering of point processes can be interpreted as the LT ordering of their aggregate interferences. The Laplace transform of interference is particularly convenient for the determination of outage probabilities under certain fading distributions (e.g., Rayleigh) [30] and is also useful in performance comparison. The LF ordering of point processes also can be translated into the ordering of coverage probabilities and spatial coverage which will be discussed in detail in Section 5. The probability generating functional is another mathematical tool for studying point processes [1]. The probability generating functional will provide the same results in our scenarios. However, we will focus on the Laplace functional of point process in our study since it is easy to relate the Laplace functional to interference metrics as mentioned above.


### 2.2.3. Voronoi Cell and Tessellation

The Voronoi cellV
(
x
) of a point x of a general point process Φ
⊂
R
d consists of those locations of R
d whose distance to x is not greater than their distance to any other point in Φ; i.e.,(10)
V
x
≔
y
∈
R
d
:
x
-
y
≤
z
-
y
∀
z
∈
Φ
∖
x
.The Voronoi tessellation (or Voronoi diagram) is decomposition of the space into the Voronoi cells of a general point process.


## 2.2.1. Campbell’s Theorem

It is often necessary to evaluate the expected sum of a function evaluated at the point processΦ. Campbell’s theorem helps in evaluating such expectations. For any nonnegative measurable function u which runs over the set U of all nonnegative functions on R
d,(5)
E
∑
x
∈
Φ
u
x
=
∫
R
d
u
x
Λ
d
x
.The intensity measure Λ of Φ in (5) is a characteristic analogous to the mean of a real-valued random variable and defined as Λ
(
B
)
=
E
Φ
(
B
) for bounded subsets B
⊂
R
d. Thus, Λ
(
B
) is the mean number of points in B. If Φ is stationary, then the intensity measure simplifies as Λ
(
B
)
=
λ
B for some nonnegative constant λ, which is called the intensity of Φ, where B denotes the d dimensional volume of B. For stationary point processes, the right side in (5) is equal to λ
∫
R
d
u
(
x
)
d
x. Therefore, any two stationary point processes with the same intensity lead to equal average sum of a function (when the mean value exists).A random measureΨ is a function from Borel sets in R
d to random variables in R
+. TheLaplace functional
L of random measure Ψ is defined by the following formula(6)
L
Ψ
u
≔
E
e
-
∫
R
d
u
x
Ψ
d
x
.The Laplace functional completely characterizes the distribution of the random measure [25]. A point process Φ is a special case of a random measure Ψ where the measure takes on values in the nonnegative integer random variables. In the case of the Laplace functional of a point process, ∫
R
d
u
(
x
)
Φ
(
d
x
) can be written as ∑
x
∈
Φ
u
(
x
) in (6). As an important example, the Laplace functional L of Poisson point process of intensity measure Λ is(7)
L
Φ
u
=
e
x
p
-
∫
R
d
1
-
exp
⁡
-
u
x
Λ
d
x
.If the Poisson point process is stationary, the Laplace functional simplifies with Λ
(
d
x
)
=
λ
d
x.


## 2.2.2. Laplace Functional Ordering

In this section, we introduce the Laplace functional stochastic order between random measures which can also be used to order point processes.Definition 1.
LetΨ
1 and Ψ
2 be two random measures such that(8)
L
Ψ
1
u
=
E
e
-
∫
R
d
u
x
Ψ
1
d
x
≥
E
e
-
∫
R
d
u
x
Ψ
2
d
x
=
L
Ψ
2
uwhere u
(
·
) runs over the set U of all nonnegative functions on R
d. Then Ψ
1 is said to be smaller than Ψ
2 in the Laplace functional (LF) order (denoted by Ψ
1
≤
L
f
Ψ
2).In this paper, we focus on the LF order of point processes unless otherwise specified. Note that the LT ordering in (2) is for RVs, whereas the LF ordering in (8) is for point processes or random measures. They can be connected in the following way:(9)
Φ
1
≤
L
f
Φ
2
⇔
∑
x
∈
Φ
1
u
x
≤
L
t
∑
x
∈
Φ
2
u
x
,
∀
u
∈
U
.Hence, it is possible to think of LF ordering of point processes as the LT ordering of their aggregate processes. Intuitively, the LF ordering of point processes can be interpreted as the LT ordering of their aggregate interferences. The Laplace transform of interference is particularly convenient for the determination of outage probabilities under certain fading distributions (e.g., Rayleigh) [30] and is also useful in performance comparison. The LF ordering of point processes also can be translated into the ordering of coverage probabilities and spatial coverage which will be discussed in detail in Section 5. The probability generating functional is another mathematical tool for studying point processes [1]. The probability generating functional will provide the same results in our scenarios. However, we will focus on the Laplace functional of point process in our study since it is easy to relate the Laplace functional to interference metrics as mentioned above.


## 2.2.3. Voronoi Cell and Tessellation

The Voronoi cellV
(
x
) of a point x of a general point process Φ
⊂
R
d consists of those locations of R
d whose distance to x is not greater than their distance to any other point in Φ; i.e.,(10)
V
x
≔
y
∈
R
d
:
x
-
y
≤
z
-
y
∀
z
∈
Φ
∖
x
.The Voronoi tessellation (or Voronoi diagram) is decomposition of the space into the Voronoi cells of a general point process.


## 3. Ordering of General Classes of Point Processes

The examples for LF orderings of some specific point processes have been provided in [20]. In this section, we introduce the LF ordering of general classes of point processes.


### 3.1. Cox Processes

A generalization of the Poisson process is to allow for the intensity measure itself being random. The resulting process is then Poisson conditional on the intensity measure. Such processes are calleddoubly stochastic Poisson processes orCox processes. Consider a random measure Ψ on R
d. Assume that, for each realization Ψ
=
Λ, an independent Poisson point process Φ of intensity measure Λ is given. The random measure Ψ is called the driving measure for a Cox process. The LF ordering of Cox processes depends on their driving random measures.Theorem 2.
LetΦ
1 and Φ
2 be two Cox processes with driving random measures Ψ
1 and Ψ
2, respectively. If Ψ
1
≤
L
f
Ψ
2, then Φ
1
≤
L
f
Φ
2.Proof.
The proof is given in AppendixA.The mixed Poisson process is a simple instance of a Cox process, where the random measureΨ is described by a positive random constant X so that Ψ
(
B
)
=
X
|
B
|. Since the Laplace functional of the mixed Poisson process can be expressed as L
Φ
(
u
)
=
E
X
e
x
p
-
X
∫
R
d
1
-
e
x
p
-
u
x
d
x, using (7), and because ∫
R
d
1
-
e
x
p
-
u
x
d
x
≥
0 and the c.m. property of e
x
p
(
-
a
x
)
,
a
≥
0, the LF ordering of mixed Poisson processes has the following relationship: if X
1
≤
L
t
X
2, then Φ
1
≤
L
f
Φ
2.


### 3.2. Homogeneous Independent Cluster Processes

A general cluster process is generated by taking a parent point process and daughter point processes, one per parent, and translating the daughter processes to the position of their parent. The cluster process is then the union of all the daughter points. Denote the parent point process byΦ
p
=
{
x
1
,
x
2
,
…
}, and let n
∈
N
∪
{
∞
} be the number of parent points. Further let {
Φ
i
}
,
i
∈
N, be a family of finite points sets, the untranslated clusters or daughter processes. The cluster process is then the union of the translated clusters:(11)
Φ
≔
⋃
i
=
1
n
Φ
i
+
x
i
.If the parent process is a lattice, the process is called alattice cluster process. Analogously, if the parent process is a Poisson point process, the resulting process is aPoisson cluster process.If the parent process is stationary and the daughter processes{
Φ
i
}
i are finite point sets which are independent of each other, are independent of Φ
p, and have the same distribution, the procedure is calledhomogeneous independent clustering. In this case, only the statistics of one cluster need to be specified, which is usually done by referring to therepresentative cluster, denoted by Φ
0 which is distributed the same as any Φ
i
,
i
∈
N. In this class of point processes, the LF ordering depends on the parent process Φ
p and the representative process Φ
0 as follows.Theorem 3.
LetΦ
1 and Φ
2 be two homogeneous independent cluster processes having representative clusters Φ
0
1 and Φ
0
2, respectively. Also, let Φ
p
1 and Φ
p
2 be the parent point processes of two homogeneous independent cluster processes Φ
1 and Φ
2, respectively. If Φ
p
1
≤
L
f
Φ
p
2 and Φ
0
1
≤
L
f
Φ
0
2, then Φ
1
≤
L
f
Φ
2.Proof.
The proof is given in AppendixB.


### 3.3. Perturbed Lattice Processes with Replicating Points

Lattices are deterministic point processes defined as(12)
L
≔
u
∈
Z
d
:
G
u
,where G
∈
R
d
×
d is a matrix with d
e
t
G
≠
0, the so-called generator matrix. The volume of each Voronoi cell is V
=
|
d
e
t
G
| and the intensity of the lattice is λ
=
1
/
V [31]. The perturbed lattice process is a lattice cluster process. Denote the lattice point process by L
=
{
x
1
,
x
2
,
…
}, and let n
∈
N
∪
{
∞
} be the number of lattice points. Further let {
Φ
i
}
,
i
∈
N, be untranslated clusters. In each cluster, the number of daughter points are a random variable X, independent of each other and identically distributed. Moreover, these points are distributed by some given spatial distribution. The entire process is then the union of the translated clusters as in (11). If the replicating points are uniformly distributed in the Voronoi cell of the original lattice, the resulting point process is a stationary point process and called auniformly perturbed lattice process. If, moreover, the numbers of replicas X are Poisson random variables, the resulting process is a stationary Poisson point process [32]. Now, we can define the following LF ordering of such point processes.Theorem 4.
LetΦ
1 and Φ
2 be two uniformly perturbed lattice processes with numbers of replicas being nonnegative integer valued random variables X
1 and X
2, respectively, and with the same mean E
[
X
1
]
=
E
[
X
2
]
=
1. If X
1
≤
L
t
X
2, then Φ
1
≤
L
f
Φ
2.Proof.
The proof is given in AppendixC.Based on Theorem 5.A.21 in [21], thesmallest andbiggest LT ordered random variables can be defined as follows: Let Y be a random variable such that P
{
Y
=
0
}
=
1
-
P
{
Y
=
2
}
=
1
/
2 and let Z be a random variable degenerate at 1. Let X be a nonnegative random variable with mean 1. Then(13)
Y
≤
L
t
X
≤
L
t
Z
.From Theorem 4 and (13), the uniformly perturbed lattice processes with replicating points with nonnegative integer valued distribution Y and Z will be thesmallest andbiggest LF ordered point processes, respectively, among uniformly perturbed lattice processes with the same average number of points. The smallest LF ordered uniformly perturbed lattice process exhibits clustering since some Voronoi cells have 2 points but other cells do not have any point. This observation is in line with the intuition that clustering diminishes point processes in the LF order.


### 3.4. Mixed Binomial Point Processes

In binomial point processes, there are a total of fixedN points uniformly distributed in a bounded set B
∈
R
d. The density of the process is given by λ
=
N
/
B where B is the volume of B. If the number of points N is random, the point process is called a mixed binomial point process. As an example, with Poisson distributed N, the point process is called a finite Poisson point process. The intensity measure of mixed binomial point processes is Λ
(
B
)
=
λ
B. In these point processes, one can show the following.Theorem 5.
LetΦ
1 and Φ
2 be two mixed binomial point process with nonnegative integer valued random distribution N
1 and N
2, respectively. If N
1
≤
L
t
N
2, then Φ
1
≤
L
f
Φ
2.Proof.
The proof is given in AppendixD.Similar to Theorem4, Theorem 5 enables LF ordering of two point processes whenever an associated discrete random variable is LT ordered.


## 3.1. Cox Processes

A generalization of the Poisson process is to allow for the intensity measure itself being random. The resulting process is then Poisson conditional on the intensity measure. Such processes are calleddoubly stochastic Poisson processes orCox processes. Consider a random measure Ψ on R
d. Assume that, for each realization Ψ
=
Λ, an independent Poisson point process Φ of intensity measure Λ is given. The random measure Ψ is called the driving measure for a Cox process. The LF ordering of Cox processes depends on their driving random measures.Theorem 2.
LetΦ
1 and Φ
2 be two Cox processes with driving random measures Ψ
1 and Ψ
2, respectively. If Ψ
1
≤
L
f
Ψ
2, then Φ
1
≤
L
f
Φ
2.Proof.
The proof is given in AppendixA.The mixed Poisson process is a simple instance of a Cox process, where the random measureΨ is described by a positive random constant X so that Ψ
(
B
)
=
X
|
B
|. Since the Laplace functional of the mixed Poisson process can be expressed as L
Φ
(
u
)
=
E
X
e
x
p
-
X
∫
R
d
1
-
e
x
p
-
u
x
d
x, using (7), and because ∫
R
d
1
-
e
x
p
-
u
x
d
x
≥
0 and the c.m. property of e
x
p
(
-
a
x
)
,
a
≥
0, the LF ordering of mixed Poisson processes has the following relationship: if X
1
≤
L
t
X
2, then Φ
1
≤
L
f
Φ
2.


## 3.2. Homogeneous Independent Cluster Processes

A general cluster process is generated by taking a parent point process and daughter point processes, one per parent, and translating the daughter processes to the position of their parent. The cluster process is then the union of all the daughter points. Denote the parent point process byΦ
p
=
{
x
1
,
x
2
,
…
}, and let n
∈
N
∪
{
∞
} be the number of parent points. Further let {
Φ
i
}
,
i
∈
N, be a family of finite points sets, the untranslated clusters or daughter processes. The cluster process is then the union of the translated clusters:(11)
Φ
≔
⋃
i
=
1
n
Φ
i
+
x
i
.If the parent process is a lattice, the process is called alattice cluster process. Analogously, if the parent process is a Poisson point process, the resulting process is aPoisson cluster process.If the parent process is stationary and the daughter processes{
Φ
i
}
i are finite point sets which are independent of each other, are independent of Φ
p, and have the same distribution, the procedure is calledhomogeneous independent clustering. In this case, only the statistics of one cluster need to be specified, which is usually done by referring to therepresentative cluster, denoted by Φ
0 which is distributed the same as any Φ
i
,
i
∈
N. In this class of point processes, the LF ordering depends on the parent process Φ
p and the representative process Φ
0 as follows.Theorem 3.
LetΦ
1 and Φ
2 be two homogeneous independent cluster processes having representative clusters Φ
0
1 and Φ
0
2, respectively. Also, let Φ
p
1 and Φ
p
2 be the parent point processes of two homogeneous independent cluster processes Φ
1 and Φ
2, respectively. If Φ
p
1
≤
L
f
Φ
p
2 and Φ
0
1
≤
L
f
Φ
0
2, then Φ
1
≤
L
f
Φ
2.Proof.
The proof is given in AppendixB.


## 3.3. Perturbed Lattice Processes with Replicating Points

Lattices are deterministic point processes defined as(12)
L
≔
u
∈
Z
d
:
G
u
,where G
∈
R
d
×
d is a matrix with d
e
t
G
≠
0, the so-called generator matrix. The volume of each Voronoi cell is V
=
|
d
e
t
G
| and the intensity of the lattice is λ
=
1
/
V [31]. The perturbed lattice process is a lattice cluster process. Denote the lattice point process by L
=
{
x
1
,
x
2
,
…
}, and let n
∈
N
∪
{
∞
} be the number of lattice points. Further let {
Φ
i
}
,
i
∈
N, be untranslated clusters. In each cluster, the number of daughter points are a random variable X, independent of each other and identically distributed. Moreover, these points are distributed by some given spatial distribution. The entire process is then the union of the translated clusters as in (11). If the replicating points are uniformly distributed in the Voronoi cell of the original lattice, the resulting point process is a stationary point process and called auniformly perturbed lattice process. If, moreover, the numbers of replicas X are Poisson random variables, the resulting process is a stationary Poisson point process [32]. Now, we can define the following LF ordering of such point processes.Theorem 4.
LetΦ
1 and Φ
2 be two uniformly perturbed lattice processes with numbers of replicas being nonnegative integer valued random variables X
1 and X
2, respectively, and with the same mean E
[
X
1
]
=
E
[
X
2
]
=
1. If X
1
≤
L
t
X
2, then Φ
1
≤
L
f
Φ
2.Proof.
The proof is given in AppendixC.Based on Theorem 5.A.21 in [21], thesmallest andbiggest LT ordered random variables can be defined as follows: Let Y be a random variable such that P
{
Y
=
0
}
=
1
-
P
{
Y
=
2
}
=
1
/
2 and let Z be a random variable degenerate at 1. Let X be a nonnegative random variable with mean 1. Then(13)
Y
≤
L
t
X
≤
L
t
Z
.From Theorem 4 and (13), the uniformly perturbed lattice processes with replicating points with nonnegative integer valued distribution Y and Z will be thesmallest andbiggest LF ordered point processes, respectively, among uniformly perturbed lattice processes with the same average number of points. The smallest LF ordered uniformly perturbed lattice process exhibits clustering since some Voronoi cells have 2 points but other cells do not have any point. This observation is in line with the intuition that clustering diminishes point processes in the LF order.


## 3.4. Mixed Binomial Point Processes

In binomial point processes, there are a total of fixedN points uniformly distributed in a bounded set B
∈
R
d. The density of the process is given by λ
=
N
/
B where B is the volume of B. If the number of points N is random, the point process is called a mixed binomial point process. As an example, with Poisson distributed N, the point process is called a finite Poisson point process. The intensity measure of mixed binomial point processes is Λ
(
B
)
=
λ
B. In these point processes, one can show the following.Theorem 5.
LetΦ
1 and Φ
2 be two mixed binomial point process with nonnegative integer valued random distribution N
1 and N
2, respectively. If N
1
≤
L
t
N
2, then Φ
1
≤
L
f
Φ
2.Proof.
The proof is given in AppendixD.Similar to Theorem4, Theorem 5 enables LF ordering of two point processes whenever an associated discrete random variable is LT ordered.


## 4. Preservation of Stochastic Ordering of Point Processes

In what follows, we will show that the LF ordering between two point processes is preserved after applying independent operations on point processes such as marking, thinning, random translation, and superposition of point processes.


### 4.1. Marking

Consider thed dimensional Euclidean space R
d, d
≥
1, as the state space of the point process. Consider a second space R
l, called the space of marks. A marked point process Φ
~ on R
d
×
R
l (with points in R
d and marks in R
l) is a locally finite, random set of points on R
d, with some random vector in R
l attached to each point. A marked point process is said to be independently marked if, given the locations of the points in Φ, the marks are mutually independent random vectors in R
l, and if the conditional distribution of the mark m
x of a point x
∈
Φ depends only on the location of the point x it is attached to.Lemma 6.
LetΦ
1 and Φ
2 be two point processes in R
d. Also let Φ
~
1 and Φ
~
2 be independently marked point processes with marks m
x with identical distribution in R
l. If Φ
1
≤
L
f
Φ
2, then Φ
~
1
≤
L
f
Φ
~
2.Proof.
The proof is given in AppendixE.


### 4.2. Thinning

A thinning operation uses a rule to delete points of a basic processΦ, thus yielding thethinned point process
Φ
t
h, which can be considered as a subset of Φ. The simplest thinning is p
-thinning: each point of Φ has probability 1
-
p of suffering deletion, and its deletion is independent of locations and possible deletions of any other points of Φ. A natural generalization allows the retention probability p to depend on the location x of the point. A deterministic function p
(
x
) is given on R
d, with 0
≤
p
(
x
)
≤
1. A point x in Φ is deleted with probability 1
-
p
(
x
) and again its deletion is independent of locations and possible deletions of any other points. The generalized operation is called p
(
x
)
-thinning. In a further generalization the function p is itself random. Formally, a random field π
=
{
0
≤
π
(
x
)
≤
1
:
x
∈
R
d
} is given which is independent of Φ. A realization φ
t
h of the thinned process Φ
t
h is constructed by taking a realization φ of Φ and applying p
(
x
)-thinning to φ, using for p
(
x
) a sample {
p
(
x
)
:
x
∈
R
d
} of the random field π. Given π
(
x
)
=
p
(
x
) and given Φ
=
φ, the probability of x in Φ also belonging to Φ
t
h is p
(
x
). As long as an independent thinning operation regardless of p
,
p
(
x
), and π
(
x
) is applied on point processes, the LF ordering of the original pair of point processes is retained.Lemma 7.
LetΦ
1 and Φ
2 be two point processes in R
d, and let Φ
t
h
,
1 and Φ
t
h
,
2 be independently thinned point processes both with any identical independent thinning operation which could be either p
,
p
(
x
), or π
(
x
)-thinning on both Φ
1 and Φ
2. If Φ
1
≤
L
f
Φ
2, then Φ
t
h
,
1
≤
L
f
Φ
t
h
,
2.Proof.
The proof is given in AppendixF.Since the thinned point processΦ
t
h is a locally finite random set of points on R
d, with a binary random variable in R
+ attached to each point, independent thinning can be considered as the independent marking operation on a point process as discussed in the previous section.


### 4.3. Random Translation

In this section, the stochastic operation that we consider is random translation. Each pointx in the realization of some initial point process Φ is shifted independently of its neighbors through a random vector t
x in R
d where {
t
x
}
x are independent of each other and the conditional distribution of a random vector t
x of a point x
∈
Φ depends only on the location of the point x. The resulting process is Φ
r
t
≔
{
x
+
t
x
:
x
∈
Φ
}. The random translation preserves the LF ordering of point process as follows.Lemma 8.
LetΦ
1 and Φ
2 be two point processes in R
d, and let Φ
r
t
,
1 and Φ
r
t
,
2 be the translated point processes with common distribution for the translation t
x. If Φ
1
≤
L
f
Φ
2, then Φ
r
t
,
1
≤
L
f
Φ
r
t
,
2.Proof.
The proof is given in AppendixG.Similar to the independent thinning operation, since the random translated point processΦ
r
t is a locally finite random set of points on R
d, with some random vector in R
d attached to each point, the random translation can be considered as the independent marking operation on a point process.


### 4.4. Superposition

LetΦ
1 and Φ
2 be two point processes. Consider the union(14)
Φ
=
Φ
1
∪
Φ
2
.Suppose that with probability one the point sets Φ
1 and Φ
2 do not overlap. The set-theoretic union then coincides with the superposition operation of general point process theory. The superposition preserves the LF ordering of point processes as follows.Lemma 9.
LetΦ
1
,
i and Φ
2
,
i
,
i
=
1
,
…
,
M be mutually independent point processes and Φ
1
=
⋃
i
=
1
M
Φ
1
,
i and Φ
2
=
⋃
i
=
1
M
Φ
2
,
i be the superposition of point processes. If Φ
1
,
i
≤
L
f
Φ
2
,
i for i
=
1
,
…
,
M, then Φ
1
≤
L
f
Φ
2.Proof.
The proof is given in AppendixH.


## 4.1. Marking

Consider thed dimensional Euclidean space R
d, d
≥
1, as the state space of the point process. Consider a second space R
l, called the space of marks. A marked point process Φ
~ on R
d
×
R
l (with points in R
d and marks in R
l) is a locally finite, random set of points on R
d, with some random vector in R
l attached to each point. A marked point process is said to be independently marked if, given the locations of the points in Φ, the marks are mutually independent random vectors in R
l, and if the conditional distribution of the mark m
x of a point x
∈
Φ depends only on the location of the point x it is attached to.Lemma 6.
LetΦ
1 and Φ
2 be two point processes in R
d. Also let Φ
~
1 and Φ
~
2 be independently marked point processes with marks m
x with identical distribution in R
l. If Φ
1
≤
L
f
Φ
2, then Φ
~
1
≤
L
f
Φ
~
2.Proof.
The proof is given in AppendixE.


## 4.2. Thinning

A thinning operation uses a rule to delete points of a basic processΦ, thus yielding thethinned point process
Φ
t
h, which can be considered as a subset of Φ. The simplest thinning is p
-thinning: each point of Φ has probability 1
-
p of suffering deletion, and its deletion is independent of locations and possible deletions of any other points of Φ. A natural generalization allows the retention probability p to depend on the location x of the point. A deterministic function p
(
x
) is given on R
d, with 0
≤
p
(
x
)
≤
1. A point x in Φ is deleted with probability 1
-
p
(
x
) and again its deletion is independent of locations and possible deletions of any other points. The generalized operation is called p
(
x
)
-thinning. In a further generalization the function p is itself random. Formally, a random field π
=
{
0
≤
π
(
x
)
≤
1
:
x
∈
R
d
} is given which is independent of Φ. A realization φ
t
h of the thinned process Φ
t
h is constructed by taking a realization φ of Φ and applying p
(
x
)-thinning to φ, using for p
(
x
) a sample {
p
(
x
)
:
x
∈
R
d
} of the random field π. Given π
(
x
)
=
p
(
x
) and given Φ
=
φ, the probability of x in Φ also belonging to Φ
t
h is p
(
x
). As long as an independent thinning operation regardless of p
,
p
(
x
), and π
(
x
) is applied on point processes, the LF ordering of the original pair of point processes is retained.Lemma 7.
LetΦ
1 and Φ
2 be two point processes in R
d, and let Φ
t
h
,
1 and Φ
t
h
,
2 be independently thinned point processes both with any identical independent thinning operation which could be either p
,
p
(
x
), or π
(
x
)-thinning on both Φ
1 and Φ
2. If Φ
1
≤
L
f
Φ
2, then Φ
t
h
,
1
≤
L
f
Φ
t
h
,
2.Proof.
The proof is given in AppendixF.Since the thinned point processΦ
t
h is a locally finite random set of points on R
d, with a binary random variable in R
+ attached to each point, independent thinning can be considered as the independent marking operation on a point process as discussed in the previous section.


## 4.3. Random Translation

In this section, the stochastic operation that we consider is random translation. Each pointx in the realization of some initial point process Φ is shifted independently of its neighbors through a random vector t
x in R
d where {
t
x
}
x are independent of each other and the conditional distribution of a random vector t
x of a point x
∈
Φ depends only on the location of the point x. The resulting process is Φ
r
t
≔
{
x
+
t
x
:
x
∈
Φ
}. The random translation preserves the LF ordering of point process as follows.Lemma 8.
LetΦ
1 and Φ
2 be two point processes in R
d, and let Φ
r
t
,
1 and Φ
r
t
,
2 be the translated point processes with common distribution for the translation t
x. If Φ
1
≤
L
f
Φ
2, then Φ
r
t
,
1
≤
L
f
Φ
r
t
,
2.Proof.
The proof is given in AppendixG.Similar to the independent thinning operation, since the random translated point processΦ
r
t is a locally finite random set of points on R
d, with some random vector in R
d attached to each point, the random translation can be considered as the independent marking operation on a point process.


## 4.4. Superposition

LetΦ
1 and Φ
2 be two point processes. Consider the union(14)
Φ
=
Φ
1
∪
Φ
2
.Suppose that with probability one the point sets Φ
1 and Φ
2 do not overlap. The set-theoretic union then coincides with the superposition operation of general point process theory. The superposition preserves the LF ordering of point processes as follows.Lemma 9.
LetΦ
1
,
i and Φ
2
,
i
,
i
=
1
,
…
,
M be mutually independent point processes and Φ
1
=
⋃
i
=
1
M
Φ
1
,
i and Φ
2
=
⋃
i
=
1
M
Φ
2
,
i be the superposition of point processes. If Φ
1
,
i
≤
L
f
Φ
2
,
i for i
=
1
,
…
,
M, then Φ
1
≤
L
f
Φ
2.Proof.
The proof is given in AppendixH.


## 5. Applications to Wireless Networks

In the following discussion, we will consider the applications of stochastic orders to wireless network systems.


### 5.1. Cellular Networks

In this section, the comparisons of performance metrics will be derived based on the LF ordering of point processes for spatial deployments of base stations (BSs) and mobile stations (MSs).


#### 5.1.1. System Model

We consider the downlink cellular network model consisting of BSs arranged according to some point processΦ
B in the Euclidean plane. For the deployment of BSs, a deterministic network such as lattice points or stochastic network such as a Poisson point process may be considered. Consider an independent collection of MSs, located according to some point process Φ
M which is independent of Φ
B. Figure 1 shows an example of cellular network consisting of stationary Poisson point processes with different intensities for BSs and MSs, respectively. For a traditional cellular network, assume that each user associates with the closest BS, which would suffer the least path-loss during wireless transmission. It is also assumed that the association between a BS and a MS is carried out in a large time scale compared to the coherence time of the channel. The cell boundaries are defined through the Voronoi tessellation of the BS process. Our goal is to compare performance metrics such as total cell coverage probability through stochastic ordering tools. The spatial coverage of cellular networks is also compared based on the LF order of the BS point processes.Figure 1
Illustration of a cellular network. The triangles represent base stations which form a stationary Poisson point processΦ
B with intensity λ
B
=
0.1 and the dots represent users which also form a stationary Poisson point process Φ
M with intensity λ
M
=
1.0.In order for the total cell coverage probability to be compared, the signal to interference plus noise ratio (SINR) of a user atx
∈
Φ
M should be quantified. The effective channel power between a user x and its associated typical BS B
0 is h
S
(
x
), which is a nonnegative RV. The SINR with additive noise power σ
2 is given by(15)
S
I
N
R
x
=
h
S
x
g
x
σ
2
+
I
x
,where g
(
·
)
:
R
+
→
R
+ is the path-loss function which is a continuous, positive, nonincreasing function of the Euclidean distance x from the user located at x to the typical BS B
0. The following is an example of a path-loss model [1, 26, 33, 34]:(16)
g
x
=
a
+
b
x
δ
-
1for some b
>
0, δ
>
d and a
∈
{
0,1
}, where δ is called the path-loss exponent, a determines whether the path-loss model belongs to a singular path-loss model (a
=
0) or a nonsingular path-loss model (a
=
1), and b is a compensation parameter to keep the total received power normalized regardless of the values of path-loss exponent. In (15), I
(
x
) is the accumulated interference power at a user located at x given by(17)
I
x
=
∑
y
∈
Φ
B
∖
B
0
h
I
y
g
y
-
xwhere Φ
B denotes the set of all BSs which is modeled as a point process and h
I
(
y
) is a positive random variable capturing the (power) fading coefficient between a user x and the y
t
h interfering BS. Moreover, h
I
(
y
) are i.i.d. random variables and independent of Φ
M and Φ
B.


#### 5.1.2. Ordering of Performance Metrics in a Cellular Network

In the following discussion, we will introduce performance metrics involving the stochastic ordering of aggregate process in the cellC
0 which is associated with the BS B
0. By studying spatial character of networks and investigating the spatial distributions of mobile users, we can compare system performances using stochastic ordering approach without actual system performance evaluation. In addition, the preservation properties of the LF order in Lemmas 6–9 guarantee that the performance comparison results based on the LF ordering of point processes are not changed with respect to any identical independent random operation on Φ
M or Φ
B such as marking, thinning, translation, and superposition.(a) Total Cell Coverage Probability. In multicast/broadcast scenarios, multiple users receive a common signal from their associated BS. Therefore, the probability that SINRs of all served users are greater than a minimum threshold T is an important measure to ensure the signal reception quality of every user and it is calledtotal cell coverage probability. This metric can be ordered, if the underlying point processes are LF ordered.Theorem 10.
LetΦ
B be an arbitrary fixed BS deployment. Also, let Φ
M
1 and Φ
M
2 be two point processes for MS deployments, and let x
1
1
,
…
,
x
N
1
1
∈
Φ
M
1
∩
C
0 and x
1
2
,
…
,
x
N
2
2
∈
Φ
M
2
∩
C
0 be two user location sets belonging to the typical Voronoi cell C
0. N
1 and N
2 are random variables that are functions of Φ
M
1 and Φ
M
2, respectively. Let {
h
S
(
x
)
}
,
x
∈
(
Φ
M
1
∪
Φ
M
2
)
∩
C
0 in (15) be exponentially distributed independent RVs, and let {
h
I
(
y
)
}
,
y
∈
Φ
B in (17) be independent RVs that are also independent of {
h
S
(
x
)
}, Φ
M
1, and Φ
M
2. If Φ
M
1
≤
L
f
Φ
M
2, then for T
>
0
(18)
P
S
I
N
R
x
1
1
≥
T
,
…
,
S
I
N
R
x
N
1
1
≥
T
≥
P
S
I
N
R
x
1
2
≥
T
,
…
,
S
I
N
R
x
N
2
2
≥
Twhere P
· is over all RVs, h
S
(
x
), h
I
(
y
), Φ
M
1, and Φ
M
2.Proof.
The proof is given in AppendixI.Note that Theorem10 holds for any arbitrary Φ
B as long as it is identical under both scenarios. Equation (18) shows that LF ordering of user point processes implies ordering of the multivariate complementary cumulative distribution functions (CCDFs) of the SINRs.(b) Network Spatial Coverage. The network spatial coverage is an important performance metric to design BS deployment in cellular networks. We assume that BSs are distributed by a point process Φ
B and each BS has a fixed radius of coverage R. Denote the random number of BSs covering a fixed location y by(19)
S
y
=
∑
x
∈
Φ
B
1
y
∈
B
x
R
,where B
x
(
R
) is a d-dimensional ball of radius R centered at the point x. Denote the probability generating function of the random number of BSs covering location y by G
(
t
)
=
E
[
t
S
(
y
)
]
,
0
≤
t
≤
1. Since 0
≤
t
≤
1, t
z is a c.m. function with z. Note that 1
-
G
(
0
) represents the probability whether the location y is covered by at least one BS from the definition of the probability generation function. Thus, if Φ
B
1
≤
L
f
Φ
B
2, then G
1
(
t
)
≥
G
2
(
t
) from the property of LT ordering in (3) and consequently 1
-
G
1
(
0
)
≤
1
-
G
2
(
0
). This means the probability that any arbitrary point y in R
d is covered by at least one BS with the cell deployment by Φ
B
1 is always less than the probability with Φ
B
2. Due to random effects of real systems such as shadowing, different transmission power per each BS, and obstacles, the range of coverage R can be a nonnegative random variable. Since the random range of coverage R can be considered as independent marking m
=
R in Section 4.1, the ordering of spatial coverage probabilities still holds from Lemma 6 under the assumption that the random range of coverage R is independent of the BS deployment Φ
B. The ordering of spatial coverage probabilities also holds with random ellipse or square instead of a ball B
x
(
R
) from Lemma 6.With performance metrics such as network spatial coverage and network interference, our study can provide design guidelines for network deployment to increase spatial coverage of networks or provide less interference from networks. As an example, consider the effects of clustering as in Section3.2. In the case that the daughter clusters are assumed to be Poisson, the clustering of nodes diminishes a point process in the LF order. From an interference point of view, the clustering of interfering nodes causes less interference in the LT order between interference distributions. This translates into an increased coverage probability and improved capacity for the system. However, the clustering of nodes also causes less spatial coverage. Therefore, the proper point process for network deployment should be studied for balancing between interference and spatial coverage.


### 5.2. Cognitive Networks

In the following discussion, we will consider the applications of stochastic orders to cognitive network systems where there is an increasing interest in developing efficient methods for spectrum management and sharing.


#### 5.2.1. System Model

Let us consider an underlay cognitive radio network which contains a primary user (PU) and many secondary users (SUs) with an average interference power constraintΓ
I. The PU is located at the origin. The L SUs are uniformly randomly located in a certain area B
⊂
R
d [35–37]. It is assumed that there is a BS to coordinate the SUs’ transmission. In order to satisfy the interference constraint, the BS selects only N active number of users out of L total users through user selection schemes and the selected active SUs are allowed to transmit their signals to the BS. User selection creates a thinned point process Φ
S
U
,
t
h for the active SUs which has uniformly distributed N points over the area B. The resulting thinned point process can be considered as a mixed binomial point process as in Section 3.4. The system model of the cognitive radio network is illustrated in Figure 2. Under the system model, based on Theorem 5, one can design user selection schemes which guarantee the same average interference power from the active SUs to the PU and the same average sum rate for the active SUs. On the other hand, thedistribution of the instantaneous interferences from the active SUs to the PU is such that they are LT ordered and cause ordered performance metrics such as a coverage probability and an achievable rate of the PU according to the user selection schemes. In other words, the smaller LT ordered interference distribution guarantees the better coverage probability and achievable rate of the PU. We now discuss these in detail.Figure 2
Illustration of a cognitive network.(a) Average Interference Power Constraint. The instantaneous aggregate interference from the active SUs to the PU can be expressed as(20)
I
S
U
=
∑
x
∈
Φ
S
U
,
t
h
h
I
x
g
x
,where Φ
S
U
,
t
h is a point process for the active SUs and h
I
(
x
) is a positive random variable capturing the (power) fading coefficient between an active SU located at x and the PU. From Campbell’s theorem, the average of aggregate interference from the active SUs, E
[
I
S
U
], is the same as long as the average number of the active SUs is fixed to μ
=
E
[
N
] regardless of the distribution for N (for a proof, please see Appendix J). Therefore, we need to select μ in order to satisfy the average interference power constraint E
[
I
S
U
]
≤
Γ
I.(b) Average Sum Rate. On the other hand, if there is no interference between the active SUs by adopting code-division multiple access (CDMA), the instantaneous sum of achievable rates of the active SUs, C
S
U, is also random and can be expressed as(21)
C
S
U
z
=
∑
x
∈
Φ
S
U
,
t
h
l
o
g
1
+
h
S
x
g
x
-
z
σ
2
+
I
P
x
,where h
S
(
x
) is an effective fading channel between an active SU located at x and the BS for SUs located at z, I
P
(
x
)
=
h
I
(
x
)
g
(
x
) is the interference power from the PU to the SU located at x, and σ
2 is an additive noise power. From Campbell’s theorem, the average of sum of achievable rates of active SUs, E
[
C
S
U
(
z
)
], is the same regardless of the point processes for the active SUs as long as the average number of the active SUs is equal to μ
=
E
[
N
] (proof is the same as the average interference case in Appendix J with a different function).


#### 5.2.2. Randomized User Selection Scheme for Secondary Users

We now discuss different ways to perform randomized user selection which corresponds to different ways of thinning the SU point process. One can apply the stochastic ordering tool to design user selection schemes based on Theorem5 which produce mixed binomial point processes for active SUs. Given μ
=
E
[
N
] which satisfies the interference constraint E
[
I
S
U
]
≤
Γ
I, the smaller LT ordered random number of active SUs N provides the smaller LF ordered point process Φ
S
U
,
t
h; that is, N
1
≤
L
t
N
2
⇒
Φ
S
U
,
t
h
1
≤
L
f
Φ
S
U
,
t
h
2 from Theorem 5. Consequently, the resulting mixed binomial point processes cause LT ordered aggregate interferences to the PU, I
S
U
1
≤
L
t
I
S
U
2. The LT ordered aggregate interferences from the active SUs to the PU yield ordered performance metrics for the PU such as a coverage probability and an achievable rate due to the LT ordered interferences and the coverage probability and the achievable rate having c.m. property with respect to the interferences [20]. On the other hand, the average sum of achievable rates of the active SUs and the average of interference power remain the same, E
[
C
S
U
1
]
=
E
[
C
S
U
2
] and E
[
I
S
U
1
]
=
E
[
I
S
U
2
] as discussed in Sections 5.2.1(a) and 5.2.1(b).We now give examples of a user selection scheme using the stochastic ordering approach. If the active SUs are chosen amongL total SUs with a probability p independently, the number of active SUs is a binomial random variable, N
B. The number of active SUs can follow discrete distributions other than binomial if different modes of operation are adopted. For another example, if the SUs are selected before a predetermined failure numbers r with a probability p occuring, then the number of selected active SUs follows a negative binomial distribution with parameter r and p denoted as N
N
B. Since N
N
B
≤
L
t
N
B [38], Φ
N
B
≤
L
f
Φ
B from Theorem 5. Therefore, the aggregate interferences from the active SUs are LT ordered I
N
B
≤
L
t
I
B, while E
[
C
N
B
]
=
E
[
C
B
] and E
[
I
N
B
]
=
E
[
I
B
]
≤
Γ
I. For these operations, the BS for SUs only needs to know the number of total SUs L and the average number of active SUs μ.From the discussion in Sections5.2.1(a) and 5.2.1(b), it is noted that the smaller LT ordered random number of active SUs N causes less interference to the PU, while the average interference E
[
I
S
U
] and average sum rate E
[
C
S
U
] are the same. From Theorem 5.A.21 in [21] and the discussion in Section 3.3, the smallest LT ordered random number N
m
i
n is P
{
N
=
0
}
=
1
-
P
{
N
=
2
μ
}
=
1
/
2 and the biggest N
m
a
x is the fixed N
=
μ. Even though the N
m
i
n causes the smallest LT ordered interference to the PU, when N
=
2
μ, it causes large instantaneous interference to the PU at this moment. Otherwise, the N
m
a
x provides balanced traffic from the active SUs since the fixed number of random set of users μ is always selected. However, it causes the bigger LT ordered interference to the PU than any other distributions for active random SUs N. Therefore, the proper distribution for random number of active SUs should be studied for balancing peakyness of instantaneous interference power and fairness of active SUs’ traffic.


### 5.3. Discussion and Tradeoffs

#### 5.3.1. Coverage versus Interference

As shown in the previous sections, the stochastic ordering of point processes can be applied to performance comparison and system design. Since the performance metrics depend on the stochastic ordering of point processes for spatial distribution of nodes, we can study spatial character of networks and investigate the spatial distributions of transmitting nodes in order to evaluate system performances using stochastic ordering approach. Then our investigations can be applied to the comparison of performance metrics such as number of served users and total cell coverage probability without having closed form expressions for the metrics. With performance metrics such as network spatial coverage and network interference [20], our study can provide design guidelines for network deployment to increase spatial coverage of networks or provide less interference from networks. As an example, consider the effects of clustering. The clustering of nodes reduces a point process in the LF order. From an interference point of view, the clustering of interfering nodes causes less interference in the LT order between interference distributions. This translates into an increased coverage probability and improved capacity for the system [20]. However, the clustering of nodes also causes less spatial coverage. Therefore, the proper point process for network deployment should be studied for balancing between interference and spatial coverage.


#### 5.3.2. Burstiness versus Fairness

The stochastic ordering approach can also be applied to design user selection schemes for SUs in cognitive networks which satisfy the constraints of the system. Under the system setup described in Section5.2, the smaller LT ordered active SUs N causes less interference to the PU, while the average interference E
[
I
S
U
] and average sum rate E
[
C
S
U
] are the same. From Theorem 5.A.21 in [21] and the discussion in Section 3.3, the smallest and biggest LT ordered N can be obtained as follows:(22)
N
m
i
n
≤
L
t
N
≤
L
t
N
m
i
n
,where N is any nonnegative integer random variable, N
m
i
n is P
{
N
=
0
}
=
1
-
P
{
N
=
2
μ
}
=
1
/
2, and N
m
a
x is the fixed N
=
μ. Even though the smallest LT ordered random number N causes the smallest LT ordered interference to the PU, it causes more bursty traffic from the active SUs and more instantaneous interference when N
=
2
μ. Otherwise, the biggest LT ordered N provides balanced traffic from the active SUs since the fixed number of random set of users μ is always selected. However, it causes the bigger LT ordered interference to the PU than any other distributions for active random SUs N. Therefore, the proper distribution for active random SUs should be studied for balancing burstiness of interference and fairness of active SUs’ traffic.


#### 5.3.3. Random Effects

The system performances do depend on not only spatial deployment of a network, but also random effects of real systems such as random fading effects, random moving of mobile stations, coexisting of heterogeneous networks, and shadowing. From the preservation properties of LF ordering of point processes, it is noted that the random effects do not change the LF ordering of original point process when independent identical random effects are considered in two different spatial network deployment scenarios. As an example, consider two mobile networks where every node is moving. If the initial point processes of two mobile networks are LF ordered, then interferences raised from the mobile networks are LT ordered. Consequently the ordered interferences imply ordered performance metric results such as coverage probability and achievable rate. The ordered performance metric results are not changed regardless of the different mobility models such as constrained i.i.d. mobility, random walk, and Brownian motion. Since these random effects do not affect the performance comparison results and design guidelines using stochastic ordering approach, we need to focus the stochastic ordering of spatial deployments of nodes.


## 5.1. Cellular Networks

In this section, the comparisons of performance metrics will be derived based on the LF ordering of point processes for spatial deployments of base stations (BSs) and mobile stations (MSs).


### 5.1.1. System Model

We consider the downlink cellular network model consisting of BSs arranged according to some point processΦ
B in the Euclidean plane. For the deployment of BSs, a deterministic network such as lattice points or stochastic network such as a Poisson point process may be considered. Consider an independent collection of MSs, located according to some point process Φ
M which is independent of Φ
B. Figure 1 shows an example of cellular network consisting of stationary Poisson point processes with different intensities for BSs and MSs, respectively. For a traditional cellular network, assume that each user associates with the closest BS, which would suffer the least path-loss during wireless transmission. It is also assumed that the association between a BS and a MS is carried out in a large time scale compared to the coherence time of the channel. The cell boundaries are defined through the Voronoi tessellation of the BS process. Our goal is to compare performance metrics such as total cell coverage probability through stochastic ordering tools. The spatial coverage of cellular networks is also compared based on the LF order of the BS point processes.Figure 1
Illustration of a cellular network. The triangles represent base stations which form a stationary Poisson point processΦ
B with intensity λ
B
=
0.1 and the dots represent users which also form a stationary Poisson point process Φ
M with intensity λ
M
=
1.0.In order for the total cell coverage probability to be compared, the signal to interference plus noise ratio (SINR) of a user atx
∈
Φ
M should be quantified. The effective channel power between a user x and its associated typical BS B
0 is h
S
(
x
), which is a nonnegative RV. The SINR with additive noise power σ
2 is given by(15)
S
I
N
R
x
=
h
S
x
g
x
σ
2
+
I
x
,where g
(
·
)
:
R
+
→
R
+ is the path-loss function which is a continuous, positive, nonincreasing function of the Euclidean distance x from the user located at x to the typical BS B
0. The following is an example of a path-loss model [1, 26, 33, 34]:(16)
g
x
=
a
+
b
x
δ
-
1for some b
>
0, δ
>
d and a
∈
{
0,1
}, where δ is called the path-loss exponent, a determines whether the path-loss model belongs to a singular path-loss model (a
=
0) or a nonsingular path-loss model (a
=
1), and b is a compensation parameter to keep the total received power normalized regardless of the values of path-loss exponent. In (15), I
(
x
) is the accumulated interference power at a user located at x given by(17)
I
x
=
∑
y
∈
Φ
B
∖
B
0
h
I
y
g
y
-
xwhere Φ
B denotes the set of all BSs which is modeled as a point process and h
I
(
y
) is a positive random variable capturing the (power) fading coefficient between a user x and the y
t
h interfering BS. Moreover, h
I
(
y
) are i.i.d. random variables and independent of Φ
M and Φ
B.


### 5.1.2. Ordering of Performance Metrics in a Cellular Network

In the following discussion, we will introduce performance metrics involving the stochastic ordering of aggregate process in the cellC
0 which is associated with the BS B
0. By studying spatial character of networks and investigating the spatial distributions of mobile users, we can compare system performances using stochastic ordering approach without actual system performance evaluation. In addition, the preservation properties of the LF order in Lemmas 6–9 guarantee that the performance comparison results based on the LF ordering of point processes are not changed with respect to any identical independent random operation on Φ
M or Φ
B such as marking, thinning, translation, and superposition.(a) Total Cell Coverage Probability. In multicast/broadcast scenarios, multiple users receive a common signal from their associated BS. Therefore, the probability that SINRs of all served users are greater than a minimum threshold T is an important measure to ensure the signal reception quality of every user and it is calledtotal cell coverage probability. This metric can be ordered, if the underlying point processes are LF ordered.Theorem 10.
LetΦ
B be an arbitrary fixed BS deployment. Also, let Φ
M
1 and Φ
M
2 be two point processes for MS deployments, and let x
1
1
,
…
,
x
N
1
1
∈
Φ
M
1
∩
C
0 and x
1
2
,
…
,
x
N
2
2
∈
Φ
M
2
∩
C
0 be two user location sets belonging to the typical Voronoi cell C
0. N
1 and N
2 are random variables that are functions of Φ
M
1 and Φ
M
2, respectively. Let {
h
S
(
x
)
}
,
x
∈
(
Φ
M
1
∪
Φ
M
2
)
∩
C
0 in (15) be exponentially distributed independent RVs, and let {
h
I
(
y
)
}
,
y
∈
Φ
B in (17) be independent RVs that are also independent of {
h
S
(
x
)
}, Φ
M
1, and Φ
M
2. If Φ
M
1
≤
L
f
Φ
M
2, then for T
>
0
(18)
P
S
I
N
R
x
1
1
≥
T
,
…
,
S
I
N
R
x
N
1
1
≥
T
≥
P
S
I
N
R
x
1
2
≥
T
,
…
,
S
I
N
R
x
N
2
2
≥
Twhere P
· is over all RVs, h
S
(
x
), h
I
(
y
), Φ
M
1, and Φ
M
2.Proof.
The proof is given in AppendixI.Note that Theorem10 holds for any arbitrary Φ
B as long as it is identical under both scenarios. Equation (18) shows that LF ordering of user point processes implies ordering of the multivariate complementary cumulative distribution functions (CCDFs) of the SINRs.(b) Network Spatial Coverage. The network spatial coverage is an important performance metric to design BS deployment in cellular networks. We assume that BSs are distributed by a point process Φ
B and each BS has a fixed radius of coverage R. Denote the random number of BSs covering a fixed location y by(19)
S
y
=
∑
x
∈
Φ
B
1
y
∈
B
x
R
,where B
x
(
R
) is a d-dimensional ball of radius R centered at the point x. Denote the probability generating function of the random number of BSs covering location y by G
(
t
)
=
E
[
t
S
(
y
)
]
,
0
≤
t
≤
1. Since 0
≤
t
≤
1, t
z is a c.m. function with z. Note that 1
-
G
(
0
) represents the probability whether the location y is covered by at least one BS from the definition of the probability generation function. Thus, if Φ
B
1
≤
L
f
Φ
B
2, then G
1
(
t
)
≥
G
2
(
t
) from the property of LT ordering in (3) and consequently 1
-
G
1
(
0
)
≤
1
-
G
2
(
0
). This means the probability that any arbitrary point y in R
d is covered by at least one BS with the cell deployment by Φ
B
1 is always less than the probability with Φ
B
2. Due to random effects of real systems such as shadowing, different transmission power per each BS, and obstacles, the range of coverage R can be a nonnegative random variable. Since the random range of coverage R can be considered as independent marking m
=
R in Section 4.1, the ordering of spatial coverage probabilities still holds from Lemma 6 under the assumption that the random range of coverage R is independent of the BS deployment Φ
B. The ordering of spatial coverage probabilities also holds with random ellipse or square instead of a ball B
x
(
R
) from Lemma 6.With performance metrics such as network spatial coverage and network interference, our study can provide design guidelines for network deployment to increase spatial coverage of networks or provide less interference from networks. As an example, consider the effects of clustering as in Section3.2. In the case that the daughter clusters are assumed to be Poisson, the clustering of nodes diminishes a point process in the LF order. From an interference point of view, the clustering of interfering nodes causes less interference in the LT order between interference distributions. This translates into an increased coverage probability and improved capacity for the system. However, the clustering of nodes also causes less spatial coverage. Therefore, the proper point process for network deployment should be studied for balancing between interference and spatial coverage.


## 5.1.1. System Model

We consider the downlink cellular network model consisting of BSs arranged according to some point processΦ
B in the Euclidean plane. For the deployment of BSs, a deterministic network such as lattice points or stochastic network such as a Poisson point process may be considered. Consider an independent collection of MSs, located according to some point process Φ
M which is independent of Φ
B. Figure 1 shows an example of cellular network consisting of stationary Poisson point processes with different intensities for BSs and MSs, respectively. For a traditional cellular network, assume that each user associates with the closest BS, which would suffer the least path-loss during wireless transmission. It is also assumed that the association between a BS and a MS is carried out in a large time scale compared to the coherence time of the channel. The cell boundaries are defined through the Voronoi tessellation of the BS process. Our goal is to compare performance metrics such as total cell coverage probability through stochastic ordering tools. The spatial coverage of cellular networks is also compared based on the LF order of the BS point processes.Figure 1
Illustration of a cellular network. The triangles represent base stations which form a stationary Poisson point processΦ
B with intensity λ
B
=
0.1 and the dots represent users which also form a stationary Poisson point process Φ
M with intensity λ
M
=
1.0.In order for the total cell coverage probability to be compared, the signal to interference plus noise ratio (SINR) of a user atx
∈
Φ
M should be quantified. The effective channel power between a user x and its associated typical BS B
0 is h
S
(
x
), which is a nonnegative RV. The SINR with additive noise power σ
2 is given by(15)
S
I
N
R
x
=
h
S
x
g
x
σ
2
+
I
x
,where g
(
·
)
:
R
+
→
R
+ is the path-loss function which is a continuous, positive, nonincreasing function of the Euclidean distance x from the user located at x to the typical BS B
0. The following is an example of a path-loss model [1, 26, 33, 34]:(16)
g
x
=
a
+
b
x
δ
-
1for some b
>
0, δ
>
d and a
∈
{
0,1
}, where δ is called the path-loss exponent, a determines whether the path-loss model belongs to a singular path-loss model (a
=
0) or a nonsingular path-loss model (a
=
1), and b is a compensation parameter to keep the total received power normalized regardless of the values of path-loss exponent. In (15), I
(
x
) is the accumulated interference power at a user located at x given by(17)
I
x
=
∑
y
∈
Φ
B
∖
B
0
h
I
y
g
y
-
xwhere Φ
B denotes the set of all BSs which is modeled as a point process and h
I
(
y
) is a positive random variable capturing the (power) fading coefficient between a user x and the y
t
h interfering BS. Moreover, h
I
(
y
) are i.i.d. random variables and independent of Φ
M and Φ
B.


## 5.1.2. Ordering of Performance Metrics in a Cellular Network

In the following discussion, we will introduce performance metrics involving the stochastic ordering of aggregate process in the cellC
0 which is associated with the BS B
0. By studying spatial character of networks and investigating the spatial distributions of mobile users, we can compare system performances using stochastic ordering approach without actual system performance evaluation. In addition, the preservation properties of the LF order in Lemmas 6–9 guarantee that the performance comparison results based on the LF ordering of point processes are not changed with respect to any identical independent random operation on Φ
M or Φ
B such as marking, thinning, translation, and superposition.(a) Total Cell Coverage Probability. In multicast/broadcast scenarios, multiple users receive a common signal from their associated BS. Therefore, the probability that SINRs of all served users are greater than a minimum threshold T is an important measure to ensure the signal reception quality of every user and it is calledtotal cell coverage probability. This metric can be ordered, if the underlying point processes are LF ordered.Theorem 10.
LetΦ
B be an arbitrary fixed BS deployment. Also, let Φ
M
1 and Φ
M
2 be two point processes for MS deployments, and let x
1
1
,
…
,
x
N
1
1
∈
Φ
M
1
∩
C
0 and x
1
2
,
…
,
x
N
2
2
∈
Φ
M
2
∩
C
0 be two user location sets belonging to the typical Voronoi cell C
0. N
1 and N
2 are random variables that are functions of Φ
M
1 and Φ
M
2, respectively. Let {
h
S
(
x
)
}
,
x
∈
(
Φ
M
1
∪
Φ
M
2
)
∩
C
0 in (15) be exponentially distributed independent RVs, and let {
h
I
(
y
)
}
,
y
∈
Φ
B in (17) be independent RVs that are also independent of {
h
S
(
x
)
}, Φ
M
1, and Φ
M
2. If Φ
M
1
≤
L
f
Φ
M
2, then for T
>
0
(18)
P
S
I
N
R
x
1
1
≥
T
,
…
,
S
I
N
R
x
N
1
1
≥
T
≥
P
S
I
N
R
x
1
2
≥
T
,
…
,
S
I
N
R
x
N
2
2
≥
Twhere P
· is over all RVs, h
S
(
x
), h
I
(
y
), Φ
M
1, and Φ
M
2.Proof.
The proof is given in AppendixI.Note that Theorem10 holds for any arbitrary Φ
B as long as it is identical under both scenarios. Equation (18) shows that LF ordering of user point processes implies ordering of the multivariate complementary cumulative distribution functions (CCDFs) of the SINRs.(b) Network Spatial Coverage. The network spatial coverage is an important performance metric to design BS deployment in cellular networks. We assume that BSs are distributed by a point process Φ
B and each BS has a fixed radius of coverage R. Denote the random number of BSs covering a fixed location y by(19)
S
y
=
∑
x
∈
Φ
B
1
y
∈
B
x
R
,where B
x
(
R
) is a d-dimensional ball of radius R centered at the point x. Denote the probability generating function of the random number of BSs covering location y by G
(
t
)
=
E
[
t
S
(
y
)
]
,
0
≤
t
≤
1. Since 0
≤
t
≤
1, t
z is a c.m. function with z. Note that 1
-
G
(
0
) represents the probability whether the location y is covered by at least one BS from the definition of the probability generation function. Thus, if Φ
B
1
≤
L
f
Φ
B
2, then G
1
(
t
)
≥
G
2
(
t
) from the property of LT ordering in (3) and consequently 1
-
G
1
(
0
)
≤
1
-
G
2
(
0
). This means the probability that any arbitrary point y in R
d is covered by at least one BS with the cell deployment by Φ
B
1 is always less than the probability with Φ
B
2. Due to random effects of real systems such as shadowing, different transmission power per each BS, and obstacles, the range of coverage R can be a nonnegative random variable. Since the random range of coverage R can be considered as independent marking m
=
R in Section 4.1, the ordering of spatial coverage probabilities still holds from Lemma 6 under the assumption that the random range of coverage R is independent of the BS deployment Φ
B. The ordering of spatial coverage probabilities also holds with random ellipse or square instead of a ball B
x
(
R
) from Lemma 6.With performance metrics such as network spatial coverage and network interference, our study can provide design guidelines for network deployment to increase spatial coverage of networks or provide less interference from networks. As an example, consider the effects of clustering as in Section3.2. In the case that the daughter clusters are assumed to be Poisson, the clustering of nodes diminishes a point process in the LF order. From an interference point of view, the clustering of interfering nodes causes less interference in the LT order between interference distributions. This translates into an increased coverage probability and improved capacity for the system. However, the clustering of nodes also causes less spatial coverage. Therefore, the proper point process for network deployment should be studied for balancing between interference and spatial coverage.


## 5.2. Cognitive Networks

In the following discussion, we will consider the applications of stochastic orders to cognitive network systems where there is an increasing interest in developing efficient methods for spectrum management and sharing.


### 5.2.1. System Model

Let us consider an underlay cognitive radio network which contains a primary user (PU) and many secondary users (SUs) with an average interference power constraintΓ
I. The PU is located at the origin. The L SUs are uniformly randomly located in a certain area B
⊂
R
d [35–37]. It is assumed that there is a BS to coordinate the SUs’ transmission. In order to satisfy the interference constraint, the BS selects only N active number of users out of L total users through user selection schemes and the selected active SUs are allowed to transmit their signals to the BS. User selection creates a thinned point process Φ
S
U
,
t
h for the active SUs which has uniformly distributed N points over the area B. The resulting thinned point process can be considered as a mixed binomial point process as in Section 3.4. The system model of the cognitive radio network is illustrated in Figure 2. Under the system model, based on Theorem 5, one can design user selection schemes which guarantee the same average interference power from the active SUs to the PU and the same average sum rate for the active SUs. On the other hand, thedistribution of the instantaneous interferences from the active SUs to the PU is such that they are LT ordered and cause ordered performance metrics such as a coverage probability and an achievable rate of the PU according to the user selection schemes. In other words, the smaller LT ordered interference distribution guarantees the better coverage probability and achievable rate of the PU. We now discuss these in detail.Figure 2
Illustration of a cognitive network.(a) Average Interference Power Constraint. The instantaneous aggregate interference from the active SUs to the PU can be expressed as(20)
I
S
U
=
∑
x
∈
Φ
S
U
,
t
h
h
I
x
g
x
,where Φ
S
U
,
t
h is a point process for the active SUs and h
I
(
x
) is a positive random variable capturing the (power) fading coefficient between an active SU located at x and the PU. From Campbell’s theorem, the average of aggregate interference from the active SUs, E
[
I
S
U
], is the same as long as the average number of the active SUs is fixed to μ
=
E
[
N
] regardless of the distribution for N (for a proof, please see Appendix J). Therefore, we need to select μ in order to satisfy the average interference power constraint E
[
I
S
U
]
≤
Γ
I.(b) Average Sum Rate. On the other hand, if there is no interference between the active SUs by adopting code-division multiple access (CDMA), the instantaneous sum of achievable rates of the active SUs, C
S
U, is also random and can be expressed as(21)
C
S
U
z
=
∑
x
∈
Φ
S
U
,
t
h
l
o
g
1
+
h
S
x
g
x
-
z
σ
2
+
I
P
x
,where h
S
(
x
) is an effective fading channel between an active SU located at x and the BS for SUs located at z, I
P
(
x
)
=
h
I
(
x
)
g
(
x
) is the interference power from the PU to the SU located at x, and σ
2 is an additive noise power. From Campbell’s theorem, the average of sum of achievable rates of active SUs, E
[
C
S
U
(
z
)
], is the same regardless of the point processes for the active SUs as long as the average number of the active SUs is equal to μ
=
E
[
N
] (proof is the same as the average interference case in Appendix J with a different function).


### 5.2.2. Randomized User Selection Scheme for Secondary Users

We now discuss different ways to perform randomized user selection which corresponds to different ways of thinning the SU point process. One can apply the stochastic ordering tool to design user selection schemes based on Theorem5 which produce mixed binomial point processes for active SUs. Given μ
=
E
[
N
] which satisfies the interference constraint E
[
I
S
U
]
≤
Γ
I, the smaller LT ordered random number of active SUs N provides the smaller LF ordered point process Φ
S
U
,
t
h; that is, N
1
≤
L
t
N
2
⇒
Φ
S
U
,
t
h
1
≤
L
f
Φ
S
U
,
t
h
2 from Theorem 5. Consequently, the resulting mixed binomial point processes cause LT ordered aggregate interferences to the PU, I
S
U
1
≤
L
t
I
S
U
2. The LT ordered aggregate interferences from the active SUs to the PU yield ordered performance metrics for the PU such as a coverage probability and an achievable rate due to the LT ordered interferences and the coverage probability and the achievable rate having c.m. property with respect to the interferences [20]. On the other hand, the average sum of achievable rates of the active SUs and the average of interference power remain the same, E
[
C
S
U
1
]
=
E
[
C
S
U
2
] and E
[
I
S
U
1
]
=
E
[
I
S
U
2
] as discussed in Sections 5.2.1(a) and 5.2.1(b).We now give examples of a user selection scheme using the stochastic ordering approach. If the active SUs are chosen amongL total SUs with a probability p independently, the number of active SUs is a binomial random variable, N
B. The number of active SUs can follow discrete distributions other than binomial if different modes of operation are adopted. For another example, if the SUs are selected before a predetermined failure numbers r with a probability p occuring, then the number of selected active SUs follows a negative binomial distribution with parameter r and p denoted as N
N
B. Since N
N
B
≤
L
t
N
B [38], Φ
N
B
≤
L
f
Φ
B from Theorem 5. Therefore, the aggregate interferences from the active SUs are LT ordered I
N
B
≤
L
t
I
B, while E
[
C
N
B
]
=
E
[
C
B
] and E
[
I
N
B
]
=
E
[
I
B
]
≤
Γ
I. For these operations, the BS for SUs only needs to know the number of total SUs L and the average number of active SUs μ.From the discussion in Sections5.2.1(a) and 5.2.1(b), it is noted that the smaller LT ordered random number of active SUs N causes less interference to the PU, while the average interference E
[
I
S
U
] and average sum rate E
[
C
S
U
] are the same. From Theorem 5.A.21 in [21] and the discussion in Section 3.3, the smallest LT ordered random number N
m
i
n is P
{
N
=
0
}
=
1
-
P
{
N
=
2
μ
}
=
1
/
2 and the biggest N
m
a
x is the fixed N
=
μ. Even though the N
m
i
n causes the smallest LT ordered interference to the PU, when N
=
2
μ, it causes large instantaneous interference to the PU at this moment. Otherwise, the N
m
a
x provides balanced traffic from the active SUs since the fixed number of random set of users μ is always selected. However, it causes the bigger LT ordered interference to the PU than any other distributions for active random SUs N. Therefore, the proper distribution for random number of active SUs should be studied for balancing peakyness of instantaneous interference power and fairness of active SUs’ traffic.


## 5.2.1. System Model

Let us consider an underlay cognitive radio network which contains a primary user (PU) and many secondary users (SUs) with an average interference power constraintΓ
I. The PU is located at the origin. The L SUs are uniformly randomly located in a certain area B
⊂
R
d [35–37]. It is assumed that there is a BS to coordinate the SUs’ transmission. In order to satisfy the interference constraint, the BS selects only N active number of users out of L total users through user selection schemes and the selected active SUs are allowed to transmit their signals to the BS. User selection creates a thinned point process Φ
S
U
,
t
h for the active SUs which has uniformly distributed N points over the area B. The resulting thinned point process can be considered as a mixed binomial point process as in Section 3.4. The system model of the cognitive radio network is illustrated in Figure 2. Under the system model, based on Theorem 5, one can design user selection schemes which guarantee the same average interference power from the active SUs to the PU and the same average sum rate for the active SUs. On the other hand, thedistribution of the instantaneous interferences from the active SUs to the PU is such that they are LT ordered and cause ordered performance metrics such as a coverage probability and an achievable rate of the PU according to the user selection schemes. In other words, the smaller LT ordered interference distribution guarantees the better coverage probability and achievable rate of the PU. We now discuss these in detail.Figure 2
Illustration of a cognitive network.(a) Average Interference Power Constraint. The instantaneous aggregate interference from the active SUs to the PU can be expressed as(20)
I
S
U
=
∑
x
∈
Φ
S
U
,
t
h
h
I
x
g
x
,where Φ
S
U
,
t
h is a point process for the active SUs and h
I
(
x
) is a positive random variable capturing the (power) fading coefficient between an active SU located at x and the PU. From Campbell’s theorem, the average of aggregate interference from the active SUs, E
[
I
S
U
], is the same as long as the average number of the active SUs is fixed to μ
=
E
[
N
] regardless of the distribution for N (for a proof, please see Appendix J). Therefore, we need to select μ in order to satisfy the average interference power constraint E
[
I
S
U
]
≤
Γ
I.(b) Average Sum Rate. On the other hand, if there is no interference between the active SUs by adopting code-division multiple access (CDMA), the instantaneous sum of achievable rates of the active SUs, C
S
U, is also random and can be expressed as(21)
C
S
U
z
=
∑
x
∈
Φ
S
U
,
t
h
l
o
g
1
+
h
S
x
g
x
-
z
σ
2
+
I
P
x
,where h
S
(
x
) is an effective fading channel between an active SU located at x and the BS for SUs located at z, I
P
(
x
)
=
h
I
(
x
)
g
(
x
) is the interference power from the PU to the SU located at x, and σ
2 is an additive noise power. From Campbell’s theorem, the average of sum of achievable rates of active SUs, E
[
C
S
U
(
z
)
], is the same regardless of the point processes for the active SUs as long as the average number of the active SUs is equal to μ
=
E
[
N
] (proof is the same as the average interference case in Appendix J with a different function).


## 5.2.2. Randomized User Selection Scheme for Secondary Users

We now discuss different ways to perform randomized user selection which corresponds to different ways of thinning the SU point process. One can apply the stochastic ordering tool to design user selection schemes based on Theorem5 which produce mixed binomial point processes for active SUs. Given μ
=
E
[
N
] which satisfies the interference constraint E
[
I
S
U
]
≤
Γ
I, the smaller LT ordered random number of active SUs N provides the smaller LF ordered point process Φ
S
U
,
t
h; that is, N
1
≤
L
t
N
2
⇒
Φ
S
U
,
t
h
1
≤
L
f
Φ
S
U
,
t
h
2 from Theorem 5. Consequently, the resulting mixed binomial point processes cause LT ordered aggregate interferences to the PU, I
S
U
1
≤
L
t
I
S
U
2. The LT ordered aggregate interferences from the active SUs to the PU yield ordered performance metrics for the PU such as a coverage probability and an achievable rate due to the LT ordered interferences and the coverage probability and the achievable rate having c.m. property with respect to the interferences [20]. On the other hand, the average sum of achievable rates of the active SUs and the average of interference power remain the same, E
[
C
S
U
1
]
=
E
[
C
S
U
2
] and E
[
I
S
U
1
]
=
E
[
I
S
U
2
] as discussed in Sections 5.2.1(a) and 5.2.1(b).We now give examples of a user selection scheme using the stochastic ordering approach. If the active SUs are chosen amongL total SUs with a probability p independently, the number of active SUs is a binomial random variable, N
B. The number of active SUs can follow discrete distributions other than binomial if different modes of operation are adopted. For another example, if the SUs are selected before a predetermined failure numbers r with a probability p occuring, then the number of selected active SUs follows a negative binomial distribution with parameter r and p denoted as N
N
B. Since N
N
B
≤
L
t
N
B [38], Φ
N
B
≤
L
f
Φ
B from Theorem 5. Therefore, the aggregate interferences from the active SUs are LT ordered I
N
B
≤
L
t
I
B, while E
[
C
N
B
]
=
E
[
C
B
] and E
[
I
N
B
]
=
E
[
I
B
]
≤
Γ
I. For these operations, the BS for SUs only needs to know the number of total SUs L and the average number of active SUs μ.From the discussion in Sections5.2.1(a) and 5.2.1(b), it is noted that the smaller LT ordered random number of active SUs N causes less interference to the PU, while the average interference E
[
I
S
U
] and average sum rate E
[
C
S
U
] are the same. From Theorem 5.A.21 in [21] and the discussion in Section 3.3, the smallest LT ordered random number N
m
i
n is P
{
N
=
0
}
=
1
-
P
{
N
=
2
μ
}
=
1
/
2 and the biggest N
m
a
x is the fixed N
=
μ. Even though the N
m
i
n causes the smallest LT ordered interference to the PU, when N
=
2
μ, it causes large instantaneous interference to the PU at this moment. Otherwise, the N
m
a
x provides balanced traffic from the active SUs since the fixed number of random set of users μ is always selected. However, it causes the bigger LT ordered interference to the PU than any other distributions for active random SUs N. Therefore, the proper distribution for random number of active SUs should be studied for balancing peakyness of instantaneous interference power and fairness of active SUs’ traffic.


## 5.3. Discussion and Tradeoffs

### 5.3.1. Coverage versus Interference

As shown in the previous sections, the stochastic ordering of point processes can be applied to performance comparison and system design. Since the performance metrics depend on the stochastic ordering of point processes for spatial distribution of nodes, we can study spatial character of networks and investigate the spatial distributions of transmitting nodes in order to evaluate system performances using stochastic ordering approach. Then our investigations can be applied to the comparison of performance metrics such as number of served users and total cell coverage probability without having closed form expressions for the metrics. With performance metrics such as network spatial coverage and network interference [20], our study can provide design guidelines for network deployment to increase spatial coverage of networks or provide less interference from networks. As an example, consider the effects of clustering. The clustering of nodes reduces a point process in the LF order. From an interference point of view, the clustering of interfering nodes causes less interference in the LT order between interference distributions. This translates into an increased coverage probability and improved capacity for the system [20]. However, the clustering of nodes also causes less spatial coverage. Therefore, the proper point process for network deployment should be studied for balancing between interference and spatial coverage.


### 5.3.2. Burstiness versus Fairness

The stochastic ordering approach can also be applied to design user selection schemes for SUs in cognitive networks which satisfy the constraints of the system. Under the system setup described in Section5.2, the smaller LT ordered active SUs N causes less interference to the PU, while the average interference E
[
I
S
U
] and average sum rate E
[
C
S
U
] are the same. From Theorem 5.A.21 in [21] and the discussion in Section 3.3, the smallest and biggest LT ordered N can be obtained as follows:(22)
N
m
i
n
≤
L
t
N
≤
L
t
N
m
i
n
,where N is any nonnegative integer random variable, N
m
i
n is P
{
N
=
0
}
=
1
-
P
{
N
=
2
μ
}
=
1
/
2, and N
m
a
x is the fixed N
=
μ. Even though the smallest LT ordered random number N causes the smallest LT ordered interference to the PU, it causes more bursty traffic from the active SUs and more instantaneous interference when N
=
2
μ. Otherwise, the biggest LT ordered N provides balanced traffic from the active SUs since the fixed number of random set of users μ is always selected. However, it causes the bigger LT ordered interference to the PU than any other distributions for active random SUs N. Therefore, the proper distribution for active random SUs should be studied for balancing burstiness of interference and fairness of active SUs’ traffic.


### 5.3.3. Random Effects

The system performances do depend on not only spatial deployment of a network, but also random effects of real systems such as random fading effects, random moving of mobile stations, coexisting of heterogeneous networks, and shadowing. From the preservation properties of LF ordering of point processes, it is noted that the random effects do not change the LF ordering of original point process when independent identical random effects are considered in two different spatial network deployment scenarios. As an example, consider two mobile networks where every node is moving. If the initial point processes of two mobile networks are LF ordered, then interferences raised from the mobile networks are LT ordered. Consequently the ordered interferences imply ordered performance metric results such as coverage probability and achievable rate. The ordered performance metric results are not changed regardless of the different mobility models such as constrained i.i.d. mobility, random walk, and Brownian motion. Since these random effects do not affect the performance comparison results and design guidelines using stochastic ordering approach, we need to focus the stochastic ordering of spatial deployments of nodes.


## 5.3.1. Coverage versus Interference

As shown in the previous sections, the stochastic ordering of point processes can be applied to performance comparison and system design. Since the performance metrics depend on the stochastic ordering of point processes for spatial distribution of nodes, we can study spatial character of networks and investigate the spatial distributions of transmitting nodes in order to evaluate system performances using stochastic ordering approach. Then our investigations can be applied to the comparison of performance metrics such as number of served users and total cell coverage probability without having closed form expressions for the metrics. With performance metrics such as network spatial coverage and network interference [20], our study can provide design guidelines for network deployment to increase spatial coverage of networks or provide less interference from networks. As an example, consider the effects of clustering. The clustering of nodes reduces a point process in the LF order. From an interference point of view, the clustering of interfering nodes causes less interference in the LT order between interference distributions. This translates into an increased coverage probability and improved capacity for the system [20]. However, the clustering of nodes also causes less spatial coverage. Therefore, the proper point process for network deployment should be studied for balancing between interference and spatial coverage.


## 5.3.2. Burstiness versus Fairness

The stochastic ordering approach can also be applied to design user selection schemes for SUs in cognitive networks which satisfy the constraints of the system. Under the system setup described in Section5.2, the smaller LT ordered active SUs N causes less interference to the PU, while the average interference E
[
I
S
U
] and average sum rate E
[
C
S
U
] are the same. From Theorem 5.A.21 in [21] and the discussion in Section 3.3, the smallest and biggest LT ordered N can be obtained as follows:(22)
N
m
i
n
≤
L
t
N
≤
L
t
N
m
i
n
,where N is any nonnegative integer random variable, N
m
i
n is P
{
N
=
0
}
=
1
-
P
{
N
=
2
μ
}
=
1
/
2, and N
m
a
x is the fixed N
=
μ. Even though the smallest LT ordered random number N causes the smallest LT ordered interference to the PU, it causes more bursty traffic from the active SUs and more instantaneous interference when N
=
2
μ. Otherwise, the biggest LT ordered N provides balanced traffic from the active SUs since the fixed number of random set of users μ is always selected. However, it causes the bigger LT ordered interference to the PU than any other distributions for active random SUs N. Therefore, the proper distribution for active random SUs should be studied for balancing burstiness of interference and fairness of active SUs’ traffic.


## 5.3.3. Random Effects

The system performances do depend on not only spatial deployment of a network, but also random effects of real systems such as random fading effects, random moving of mobile stations, coexisting of heterogeneous networks, and shadowing. From the preservation properties of LF ordering of point processes, it is noted that the random effects do not change the LF ordering of original point process when independent identical random effects are considered in two different spatial network deployment scenarios. As an example, consider two mobile networks where every node is moving. If the initial point processes of two mobile networks are LF ordered, then interferences raised from the mobile networks are LT ordered. Consequently the ordered interferences imply ordered performance metric results such as coverage probability and achievable rate. The ordered performance metric results are not changed regardless of the different mobility models such as constrained i.i.d. mobility, random walk, and Brownian motion. Since these random effects do not affect the performance comparison results and design guidelines using stochastic ordering approach, we need to focus the stochastic ordering of spatial deployments of nodes.


## 6. Numerical Results

In this section, we now corroborate our theoretical results through numerical examples. Since the number of BSs is smaller than the number of MSs in general, we choose the smaller value ofλ
B for BSs than λ
M for MSs.


### 6.1. Cellular Networks

We show in Figure3 the total cell coverage probabilities. It is assumed that the BS distribution is a stationary Poisson point process Φ
B, and the compared user distributions follow also a Poisson point process Φ
P
P
P and mixed Poisson process Φ
M
P
P with the same intensity λ
M. Since the user distributions are LF ordered as Φ
M
P
P
≤
L
f
Φ
P
P
P, from Theorem 10, the total cell coverage probability of the users distributed by Φ
M
P
P is greater than that of Φ
P
P
P in the entire range of the SINR threshold as shown in Figure 3. Using the stochastic ordering approach, one can compare the coverage probabilities by investigating the spatial distributions of mobile users without actual system evaluation.Figure 3
Total cell coverage probabilities.


### 6.2. Cognitive Networks

In Figure4, the CDFs of the SINR of the primary user are shown where the spatial distributions of the active SUs are different mixed binomial processes. The LT ordered number of the active SUs N
N
B
≤
L
t
N
P
≤
L
t
N
B of the negative binomial, Poisson, and binomial RVs ensures the ordering Φ
N
B
≤
L
f
Φ
P
≤
L
f
Φ
B of the corresponding mixed binomial processes, from Theorem 5. Since the aggregate interferences from LF ordered point processes for spatial distributions of the active SUs are LT ordered, we observe S
I
R
N
B
≥
s
t
S
I
R
P
≥
s
t
S
I
R
B which are the ratio between the PU’s effective fading channel and the interference from active SUs. This is because when the PU’s effective fading channel is exponentially distributed and interferences are LT ordered, the SIRs are reverse ordered inusual stochastic order [20]. The aforementioned relationship between SIR and interference distributions holds as long as the CCDF of the PU’s effective fading channel is a c.m. function by the property of LT ordering in (3). An example is the exponential distribution. Despite the ordering of the SIRs in Figure 4, the average of the sum of achievable rates of the active SUs in (21) is the same regardless of LF ordered point processes as shown in Figure 5.Figure 4
Coverage probabilities of primary user.Figure 5
Average sum rates of secondary users.In order to guarantee the best coverage probability for the PU, one can use the stochastic ordering approach to design the user selection schemes which cause less interference from active SUs to the PU. Since the negative binomial distribution for the number of active SUs causes the smallest LT ordered interference, one can design the user selection scheme with the minimum information such as the total number of SUsL and the average number of active SUs μ which provides the negative binomial distribution as discussed in Section 5.2.


## 6.1. Cellular Networks

We show in Figure3 the total cell coverage probabilities. It is assumed that the BS distribution is a stationary Poisson point process Φ
B, and the compared user distributions follow also a Poisson point process Φ
P
P
P and mixed Poisson process Φ
M
P
P with the same intensity λ
M. Since the user distributions are LF ordered as Φ
M
P
P
≤
L
f
Φ
P
P
P, from Theorem 10, the total cell coverage probability of the users distributed by Φ
M
P
P is greater than that of Φ
P
P
P in the entire range of the SINR threshold as shown in Figure 3. Using the stochastic ordering approach, one can compare the coverage probabilities by investigating the spatial distributions of mobile users without actual system evaluation.Figure 3
Total cell coverage probabilities.


## 6.2. Cognitive Networks

In Figure4, the CDFs of the SINR of the primary user are shown where the spatial distributions of the active SUs are different mixed binomial processes. The LT ordered number of the active SUs N
N
B
≤
L
t
N
P
≤
L
t
N
B of the negative binomial, Poisson, and binomial RVs ensures the ordering Φ
N
B
≤
L
f
Φ
P
≤
L
f
Φ
B of the corresponding mixed binomial processes, from Theorem 5. Since the aggregate interferences from LF ordered point processes for spatial distributions of the active SUs are LT ordered, we observe S
I
R
N
B
≥
s
t
S
I
R
P
≥
s
t
S
I
R
B which are the ratio between the PU’s effective fading channel and the interference from active SUs. This is because when the PU’s effective fading channel is exponentially distributed and interferences are LT ordered, the SIRs are reverse ordered inusual stochastic order [20]. The aforementioned relationship between SIR and interference distributions holds as long as the CCDF of the PU’s effective fading channel is a c.m. function by the property of LT ordering in (3). An example is the exponential distribution. Despite the ordering of the SIRs in Figure 4, the average of the sum of achievable rates of the active SUs in (21) is the same regardless of LF ordered point processes as shown in Figure 5.Figure 4
Coverage probabilities of primary user.Figure 5
Average sum rates of secondary users.In order to guarantee the best coverage probability for the PU, one can use the stochastic ordering approach to design the user selection schemes which cause less interference from active SUs to the PU. Since the negative binomial distribution for the number of active SUs causes the smallest LT ordered interference, one can design the user selection scheme with the minimum information such as the total number of SUsL and the average number of active SUs μ which provides the negative binomial distribution as discussed in Section 5.2.


## 7. Summary

In this paper, Laplace functional ordering of broad classes of point processes was investigated. We showed the preservation of LF ordering of point process with respect to several operations, such as independent marking, thinning, random translation, and superposition. We introduced the applications of LF ordering of point processes to wireless networks such as cellular networks and cognitive networks, which provided guidelines for design of user selection schemes and transmission strategy for wireless networks. Tradeoffs between coverage and interference as well as fairness and peakyness were also discussed. The power of this approach is that network performance comparisons can be made even in cases where a closed form expression for the performances is not analytically tractable. We verified our results through Monte-Carlo simulations.



---

*Source: 4307136-2018-11-01.xml*