A Topology Controlling Scheme Based on Guard Region in Wireless Sensor Network

Abstract

In dense wireless sensor network, we usually remove the unnecessary communication links by topology control in order to get an energy efficient routing. The channel environment becomes more complex, which results in difficulty to control topology under a mass node distribution according to the accurate interference model. This paper introduces the concept of a guard region, defined as the region around each receiver where interfering transmissions are inhibited to make the topology control. Based on the hard-core process in stochastic geometry, the scheduling of interfering node in guard region and the density of active sensors are achieved theoretically. Then we do the analysis of coverage of receiver; the interference around receiver is computed as main interference in guard region and secondary interference outside guard region. Finally, through Monte-Carlo simulation, the topology model based on guard region is proved to be correct and the influences on coverage under different parameters are analyzed.

1. Introduction

The rapid development of sensor technology, heterogeneous convergence network, and wireless communication technique give birth to the appearance of wireless sensor network (WSN), which has brought great change to the acquisition layer of Internet of Things technology. Wireless sensor network can be formed by immense amounts of small-sized sensors with the ability of sensing, information processing, and wireless data transmission. As a modern emerging network, compared with traditional communication network solution, WSN has been increasingly widely applied in various domain, such as environment monitoring, animal monitoring, battlefield surveillance, and smart Grid, due to its low-cost, expansibility, reliability, accuracy, flexibility, and easy deployment. The emergence of WSN extends the capacity for human communicating with physical information and objective world, which is considered as an influential technology [1]. Each node is expected to send the information to the base station, called sink, via multihop communication through the assistance of other nodes. However, if the node distribution in WSN is too dense, due to the existence of a large number of links, there will be too much interference among nodes which will lead to packet retransmission, and then the energy consumption will become higher. Due to the limited energy in sensor node, higher energy consumption results in a short lifetime of the network. Thus, it is expected that topology controlling techniques play an important part in the management of the complex of such highly complicated and distributed network [2]. Through topology control, the unnecessary communication links can be removed to make the topology of the network energy efficient.

An efficient topology guarantees the interconnected nodes a reliable data link; thus, a key challenge in WSN is to design efficient topology control mechanisms to ensure the data transmitting to the sink. A lot of research has been focused on topology controlling [3–16]; nevertheless, some control algorithms proposed in these studies adopt sensing disk model to make a topology model without considering the degrading from channel fading; thus, these topology models cannot reflect the actual transmission conditions, which make the theoretical precision of the topology control model proposed in these papers not able to meet the need of practical situations.

In this paper we propose a topology controlling model based on guard region in wireless sensor network to extend the network lifetime without increasing the interference. The proposed topology controlling model contains density controlling for active sensors based on hard-core process and coverage analysis based on guard region around receiving node. We check the topology controlling method by analysis of coverage measure of receiving node.

The remainder of this paper is organized as follows: Section 2 presents related work and details the contributions of the paper. Section 3 describes the related model and some preliminaries. The details of the topology controlling model based on guard region are presented in Sections 4 and 5. Section 4 presents density controlling for active sensors and Section 5 demonstrates the coverage analysis based on guard region around receiving node. Simulation results are presented in Section 6 and the analysis based on the results is also presented in this section. Finally, Section 7 concludes the paper.

2. Related Work

Our work is based on the contribution of a variety of other researches. There has been a great deal of work in the area of topology controlling in WSN. In this section we present some of the previous work related to this paper and give the contribution of our paper.

When related to getting the energy efficient topology controlling scheme, we should analyze the density of active sensors around receiver, and then through lower the interference node of receivers to make the topology of network energy efficient. During the achievement of active sensors, most papers adopt sensing models which define the sensing domain as regular shape, such as disk sensing model [3], Boolean sector sensing model [4], attenuated disk sensing model [5], the truncated attenuated disk sensing model [6], detecting sensing model [7] based on the data fusion technique in event detection, and estimation sensing model [8] based on the parameter estimation of receiving signal power. However, the channel fading degrades the signal power badly which makes the sensing domain of sensors become an irregular region. To get a nearly optimal density of active sensors, we adopt stochastic geometry [9] to describe the relationship of nodes. In [10], Poisson point process (PPP) is adopted to describe the node topology of the interested region, and then the connectivity of the interested region is analyzed based on the PPP-based topology. In [11], the stochastic geometry is utilized to analyze the coverage problem of network; the minimum number of nodes to realize the complete coverage is achieved by topology controlling. In [12], detection performance of receivers is improved through optimizing the probability of event detection based on PPP-based topological distribution. In [13], the topology in CSMA network is analyzed based on stochastic geometry. In [14], the QoS topology control problem is mapped into an ordinal potential game model, and a distributed strategy adjustment algorithm for nodes is designed accordingly. In [15], the topology of local event detection is controlled via PPP model. In [16], the topology of the detection of distributed event in the network when being attacked is controlled. In [17], the topology of the active sensors in the network is controlled by detection polymerization technology. However, in order to lower the density of interference node, we resort to the hard-core process to thin the density of sensors which bring interference to receiver to get the topology of active sensors.

There are two problems during the topology control in WSN; the first is the uncertainty of channel which makes the coverage in WSN become complex. Moreover, in order to lower the energy consumption, we should schedule the work state in network. To make the scheduling meaningful, we should inhibit the distance of active sensors; thus, the guard region concept is introduced, which is the region around each receiver where interfering transmissions are inhibited. In theory, we adopt the hard-core process in stochastic geometry to thin the density of active sensors.

In wireless network, there are a lot of studies related to guard region. A guard region of a receiver of cell is imposed in [18]; thus the transmitting power at the receiver is guaranteed. In [19], an optimal guard zone, defined as the region around a receiver where transmissions are inhibited, is employed, and the capacity of receiver is enhanced compared to a simple ALOHA-type MAC. And in [20], a theory model of guard region is proposed to get a higher capacity, which is defined as the maximum permissible density of simultaneous transmissions that satisfies a target SINR at each receiver, with a specified outage probability. In [20], a guard region is proposed to lower the cochannel interference to the user caused by a randomly chosen transmitter. In [21], the author proved the optimum guard zone size that maximizes the network throughput for a desired communication performance. In [22], the author proposed an interference coordination scheme in which a guard zone protecting the macro cell user is utilized. In [23], the author studied and found the existence of an optimal guard zone radius that maximizes the total system throughput in D2D wireless networks.

However, in these works, the coverage analysis of wireless network is not considered. Considering the complex transmit characteristic, in this work, we aim to derive the topology control method based on the guard region which can increase the energy efficiency (EE) and extend the network lifetime without increasing the interference in the networks.

The main contributions of this paper are as follows: (1)

In WSN, we propose a guard region around the receiver in which no other transmitters exist to reduce the interference and unnecessary link around receiver. In theory, we get the guard region through hard-core process, in which points are forbidden to be closer than a certain minimum distance. Thus, the retained sensors after thinning are activated and the necessary node in sensors forming the data routing is achieved. The correctness of density of active sensors is validated through Monte-Carlo simulations.

(2)

Considering the distribution of active sensors and the characteristic of channel, we propose a novel sensing model based on an irregular sensing domain. Besides, the interference around receiver is perceived as main interference in guard region and secondary interference outside the guard region; based on the interference analysis, we propose a guard region based interference model. Then coverage of receiver is analyzed based on irregular sensing domain and interference model. The correctness of interference model is validated through Monte-Carlo simulations.

3. System and Network Model

3.1. System Model

When the network model is as easy as Boolean disc model, the sensing ability of a node in the whole sensing domain can be considered to be equal everywhere. Once an event exists in the sensing radius of the nodes, that event is covered immediately. However, in a sensor network where the distribution of nodes is more intensive and transmission environment becomes more complex, the spatial distribution characteristics of the node, the interference from other transmitter nodes and complex channel fading, all impact the sensing ability of the node, which makes the sensing region of the nodes no longer a regular circular region but an irregular region which can be changed by the channel gain. For wireless channel circumstance, we develop a general power law path loss model in which the signal power decays at the rate $k {‖x_{i}‖}^{- η}$ with the distance $‖x_{i}‖$ , where k is a frequency dependent propagation constant $k = {(c / 4 π {f_{c}^{}}^{2})}^{2}$ , with the speed of radio propagation c, the carrier frequency $f_{c}$ , and the path loss exponent η, where $η \geq 2$ and we specially get the value of 2 or 4 in the sensor network. For analysis, sensors suffer multipath fading, namely, random channel gains with a Rayleigh fading gains $h_{i}$ , which obeys the exponential distribution with mean $1 / μ$ and can be denoted as $h_{i} ~ \exp (μ)$ ; $P_{t}$ is assumed to be the transmit power of transmitters; $P_{t h}$ is a given receiving power threshold to calculate content region. All the nodes transmit with the same transmit power $P_{t}$ and the resulting signal-to-interference-plus-noise-ratio (SINR) expression assuming the user connects to the transmitter is

\begin{matrix} SINR (y_{i}) = \frac{P_{t} h_{x_{i}} κ R^{- η}}{I (y_{i}) + σ^{2}}, \end{matrix}

(1)

where

σ^{2}

is the constant additive noise power and

I (y_{i})

is the sum of the received powers from all other transmitter and is treated as noise in the present work. So we assume that each receiver connects to its strongest transmitter. Mathematically, the typical node at the origin is in coverage if

\max [SINR (y_{i})] > γ

. The coverage is presented as

\begin{matrix} P_{c o v} = P (SINR (y_{i}) > β) . \end{matrix}

(2)

The SINR of a signal should be greater than a certain threshold γ for the signal to be successfully decoded by its intended receiver. Otherwise, the intended receiver will experience an outage.

3.2. Network Model

We consider that the network model consists of multiple stationary sensors with different transmitter-receiver pairs in an infinite two dimension plane. Sensors are distributed according to a Poisson bipolar model. $Ψ = {x_{i} : i = 1,2, 3, \dots, n}$ is a Poisson point process that models the spatial distribution of the potential transmitter in the network with intensity λ, where $x_{i}$ denotes the position of the ith transmitter in the $R^{2}$ plane. However, in the process of the actual node deployment, in order to improve the utilization efficiency of sensor nodes, the node spatial distribution density needs to be reduced, which means controlling node density as far as possible on the premise of not reducing the coverage. As shown in Figure 1, the network topology control spreads from two aspects.

Figure 1

The network model of controlling scheme with $R_{g}$ changing.

The content region existing among the transmitter nodes makes the density of nodes in the spatial deployment unable to be too high, which is the foundation of the topology control mechanism. That is to say, there are no other nodes existing in the content region of node 1, and the existence of node 3 is due to its location which is outside the content region of node 1. So we assumed that each transmitter $x_{i}$ has an associated receiver located at a content distance $R_{c}$ in a random direction and it is not contained in PPP. Hard-core process is a point process derived from basic PPP through thinning; in a hard-core process the points are forbidden to be closer than a certain minimum distance. The process of hard-core is introduced in preliminaries, and $R_{c}$ is used in the Poisson bipolar model to denote the average hop distance in WSN.

The scheme for receiver based MAC protocols (e.g., carrier sense multiple access and multiple access with collision avoidance) or other local coordination techniques to limit the interference creates a guard zone around the receiver. Guard region aims to achieve higher capacity via protecting the receiver node. In the analysis of the topology control mechanism, the introduction of the guard region will make the interference distribution more complicated. As shown in Figure 1, we set a guard region around node 2; the radius of guard region is $R_{g}$ , $R_{g} = c R$ ; c is the controlling parameter for guard region radius. We denote the interference to node 2 as I, which contains two parts. One part is named as dominant interference source which is denoted as $I_{0}$ and the other part is named as nondominant interference $I_{1}$ .

Figure 1 illustrates that the increasing ${R_{}}_{g}$ naturally decreases the interference but at the cost of inefficient spatial reuse, while the decreasing ${R_{}}_{g}$ makes the interference increase. That is because when ${R_{}}_{g}$ increases, the guard region around the receiver becomes larger, which means that more transmit nodes are forbidden to transmit. Obviously, that will reduce the interference but, at the same time, that wastes the spatial resources and leads to a low resource utilization ratio.

4. Density Controlling for Active Sensors Based on Hard-Core Process

To fit the distribution of transmitter, PPP is proposed to initial node deploying. Having known that $N (B)$ is the number of point in the area B . A general Poisson point process on $R^{2}$ is defined as follows.

Lemma 1.

The PPP on $R^{2}$ with intensity measure λ is a point process such that (1)

the mean of $N (B)$ is λ,

(2)

for every compact set $B \subset R^{2}$ we may write

\begin{matrix} P (N (Β) = k) = \exp (- \int_{B}^{} λ (x) d x) \cdot \frac{{(\int_{B}^{} λ (x) d x)}^{k}}{k!}, \end{matrix}

(3)

giving that $B_{1}, B_{2}, \dots, B_{m}$ are disjoint compact sets, then $N (B_{1}), N (B_{2}), \dots, N (B_{m})$ are dependent.

As is shown in Figure 1, a generic node which is denoted by node 1 located $x_{i} \in R$ transmits signal to node 2; without loss of generality, we set node 2 located at the origin $o = (0,0)$ ; the signal power of node 1 degrades at the rate of $P_{t} k h_{i} {‖x_{i}‖}^{- η}$ , and then the receiving power at node 2 is represented by $P_{t} k h_{i} {‖x_{i}‖}^{- η}$ ; when the power is higher than the receiving power threshold $P_{t h}$ , node 2 is sensed by node 1. There are two models available to hard-core processes, named as Matérn hard-core point process of type I and type II. In this paper, Matérn hard-core point process type II is required. Matérn hard-core point process type II is as follows:

(1) Starting with a basic uniform PPP $Ψ = {x_{i}; i = 1,2, 3, \dots, n}$ with intensity λ.

(2) Adding to each point $x_{i}$ an independent random variable $M_{x_{i}}$ , which is a mark, uniformly distributed on $[0,1]$ .

(3) A marked point $(x_{i}, M_{x_{i}})$ is retained in $Ψ_{c}$ if and only if

\begin{matrix} Ψ_{C} ≜ \{x_{i} \in Ψ_{C} : M_{x_{i}} < M_{x_{j}}, \forall j \in B_{x_{i}} (R_{c}) \cap Ψ ∖ x_{i}\}, \end{matrix}

(4)

where

B_{x_{i}} (R_{c})

is the area centering at

x_{i}

with a radius

R_{c}

. We consider that

Ψ_{c}

is the set of nodes which is retained in the contention region, while

R_{c}

is the radius of contention region. In the irregular region of Rayleigh fading channel,

R_{c}

and

P_{th}

are obedient to the same standard. The content radius of transmitter can be calculated as

\begin{matrix} E (R_{c}^{2}) = {(\frac{P_{t} κ}{P_{th}})}^{2 / η} \int_{0}^{\infty} {(x)}^{2 / η} μ e^{- μ x} d x = {(\frac{P_{t} κ}{μ P_{th}})}^{2 / η} \int_{0}^{\infty} e^{- t} t^{2 / η} d t = {(\frac{P_{t} κ}{P_{th} μ})}^{2 / η} Γ (1 + \frac{2}{η}), \end{matrix}

(5)

where

Γ (x) = \int_{0}^{\infty} t^{x - 1} e^{- t} d t

is the gamma function.

In Figure 1, $R_{c} = 2 R$ is the communication radius of node 1, and the domain centering at 1 with a radius $R_{c}$ is the communication domain of a generic node; in the communication domain, the transmitter coexists with node 1 forming a PPP ψ with the density of λ, which will bring interference to node 2; we can lower the density of transmitter by hard-core process to ensure that there is only one transmitter in the communication domain of node 1. Let

\begin{matrix} |N_{0}| = \sum_{x_{i} \in ψ} 1_{\{P_{t} κ h_{i} {‖x_{i}‖}^{- η} > P_{th}\}} \end{matrix}

(6)

be number of nodes in content region, then

\begin{matrix} P (N_{0} = n) = P (\sum_{x_{i} \in ψ} 1_{\{P_{t} κ h_{i} {‖x_{i}‖}^{- η} > P_{th}\}} = n) \overset{(a)}{=} \frac{{(λ {\tilde{B}}_{x_{i}})}^{n} e^{- λ {\tilde{B}}_{x_{i}}}}{n!} = E_{h} ({\frac{{(λ π {‖x_{i}‖}^{2})}^{n} e^{- λ π {‖x_{i}‖}^{2}}}{n!}|}_{‖x_{i}‖ < {(P_{t} κ h_{i} / P_{th})}^{1 / η}}) \overset{(b)}{=} \frac{{(λ π {(P_{t} κ / P_{th} μ)}^{2 / η} Γ (1 + 2 / η))}^{n} e^{λ π {(P_{t} κ / P_{th} μ)}^{2 / η} Γ (1 + 2 / η)}}{n!}, \end{matrix}

(7)

where

(a)

~equation (3) and

(b)

is the distribution character of

h_{i}

We make the communication domain of node 1 the contention region and allocate a random time mark uniformly distributed on $[0,1]$ and activate the sensor with the lowest time mark. Assuming that there are n nodes coexisting with node 1 in ψ and the marks attached to each point are uniformly distributed, it can be easily derived that the probability of node 1 having a lowest mark among n coexisting nodes is $1 / n + 1$ . Hence, the activation probability is denoted by

\begin{matrix} P_{HCP} = \sum_{n = 0}^{\infty} \frac{1}{n + 1} P (\sum_{x_{i} \in ψ} 1_{\{P_{t} κ h_{i} {‖x_{i}‖}^{- η} > P_{th}\}} = n) = e^{- λ π {(P_{t} κ / P_{th} μ)}^{2 / η} Γ (1 + 2 / η)} \sum_{n = 0}^{\infty} \frac{{(λ π {(P_{t} κ / P_{th} μ)}^{2 / η} Γ (1 + 2 / η))}^{n}}{(n + 1)!} = \frac{1 - e^{- λ π {(P_{t} κ / P_{th} μ)}^{2 / η} Γ (1 + 2 / η)}}{λ π {(P_{t} κ / P_{th} μ)}^{2 / η} Γ (1 + 2 / η)}, \end{matrix}

(8)

where

1_{{}}

is an indicator function, which indicates the sets of nodes that can coexist with node 1 which can sense node 2. Assuming, after the node activation, that node 1 is activated, other nodes are shut down. Then we can activate sensors according to hard-core process in whole area; then we get the active sensors which are green in Figure 1.

5. Coverage Analysis Based on Interference Model considering Guard Region

As the guard region can provide receivers with less interference by inhibiting transmissions around them, in this section, we develop a topology controlling scheme based on guard region to model the interferer around receiving node. We model the interferer locations according to a marked point process, where the marks correspond to the time access to channel between the interferers and target receiver. Therefore, in the interference model, two kinds of interference sources are mainly considered, one is inside the guard region, which is called the dominant interference source $I_{0}$ and the other is from other nodes outside the guard region, which is called the subordinate interference source $I_{1}$ . Consider

\begin{matrix} I (y_{i}) = I_{0} (y_{i}) + I_{1} (y_{i}) . \end{matrix}

(9)

Then the Laplace transformation of I can be denoted as

\begin{matrix} L_{I (r)} (s) = E [e^{s I_{0}}] E [e^{s I_{1}}] . \end{matrix}

(10)

The dominant interference source $I_{0}$ comes from the nodes at the contention region from the nodes which cannot access the signal path in the set of $ψ ∖ N_{0} = \{x_{j} : P_{t} κ h_{i} {‖x_{j}‖}^{- η} < P_{th}\}$ , where $x_{j}$ denotes a node located at $x_{j} \in R^{2}$ and $‖x_{j}‖$ denotes the distance between $x_{j}$ and node 2. Then the density of the dominant interference source $I_{0}$ can be denoted by

\begin{matrix} λ_{I_{0}} = λ F_{h_{i}} (\frac{P_{th} R^{1 / η}}{P_{t} κ}) . \end{matrix}

(11)

Then the Laplace transformation of

I_{0}

can be denoted by

\begin{matrix} L_{I_{0} (y_{i})} (s) = E_{Ψ_{I_{0}}, h_{j}} (e^{- s \sum_{x_{j} \in Ψ_{I_{0}} ∖ x_{i}} P_{t} κ h_{j} {‖x_{j}‖}^{- η}}) = E_{Ψ_{I_{0}}} (\prod_{x_{j} \in Ψ_{I_{0}} ∖ x_{i}} E_{h_{j}} (e^{- s P_{t} κ h_{j} {‖x_{j}‖}^{- η}})) = E_{Ψ_{I_{0}}} (\prod_{x_{j} \in Ψ_{I_{0}} ∖ x_{i}} \frac{μ}{s P_{t} κ {‖x_{j}‖}^{- η} + μ}) \overset{(a)}{=} \exp (- 2 π λ F_{h_{i}} (\frac{P_{th} {(R_{g} + R)}^{1 / η}}{P_{t} κ}) P_{HCP} \int_{0}^{R_{g}} (1 - \frac{μ}{s P_{t} κ r^{- η} + μ}) r d r) = \exp (- 2 π λ F_{h_{i}} (\frac{P_{th} {(R_{g} + R)}^{1 / η}}{P_{t} κ}) P_{HCP} \int_{0}^{R_{g}} r \int_{0}^{\infty} e^{- t (1 + (μ / s P_{t} κ) r^{η})} d t d r) = \exp (- 2 π λ F_{h_{i}} (\frac{P_{th} {(R_{g} + R)}^{1 / η}}{P_{t} κ}) P_{HCP} {(\frac{s P_{t} κ}{μ})}^{2 / η} \int_{0}^{R_{g}} x \int_{0}^{\infty} e^{- t (1 + x^{η})} d t d x) \overset{(b)}{=} \exp (- \frac{2 π λ F_{h_{i}} (P_{th} {(R_{g} + R)}^{1 / η} / P_{t} κ) P_{HCP} {(s P_{t} κ / μ)}^{2 / η} {(s P_{t} κ)}^{2 / η} Γ (- 2 / η) Γ (- 2 / η + 1)}{η μ^{2 / η}}), \end{matrix}

(12)

where

(a)

is based on Campbell's theory and

(b)

\begin{matrix} \int_{0}^{R_{g}} x \int_{0}^{\infty} e^{- t (1 + x^{η})} d t d x = \int_{0}^{R_{g}} \int_{0}^{\infty} x e^{- t (1 + x^{η})} d t d x = \int_{0}^{\infty} e^{- t} \int_{0}^{R_{g}} x e^{- t x^{η}} d x d t = \frac{1}{η} \int_{0}^{\infty} {(y)}^{2 / η - 1} e^{(- y)} d y \int_{0}^{\infty} e^{- t} t^{- 2 / η} d t = \frac{1}{η} Γ (- \frac{2}{η}) Γ (- \frac{2}{η} + 1) . \end{matrix}

(13)

The secondary interference source $I_{1}$ comes from the sensors outside of the communication region of node 1; based on the concept of guard region, we regard the interference as the interferer from node 3 in Figure 1. Since the interference nodes satisfy the outside of the communication domain of node 1, the probability comes from two independent parts, one part is the probability of the potential interference source not deleted by transmitter node i, in other words, out of the coverage area. We can use

\begin{matrix} F_{h_{i}} (\frac{P_{th} {(R_{g} + R)}^{1 / η}}{P_{t} κ}) \cdot P_{HCP} \end{matrix}

(14)

to indicate the probability of the potential node out of the contention region of the node i, where F is the CDF function of

h_{i}

. The other part is the probability of the potential interference source not deleted by other transmitter nodes, which is

P_{HCP}

that we discussed before.

I_{1} (y_{i})

is calculated as

\begin{matrix} L_{I_{1} (y_{i})} (s) = E_{ψ, h_{j}} (e^{- s \sum_{x_{j} \in ψ ∖ x_{i}} P_{t} κ h_{j} {‖x_{j}‖}^{- η}}) = E_{ψ} (\prod_{x_{j} \in ψ ∖ x_{i}}^{} E_{h_{j}} (e^{- s P_{t} κ h_{j} {‖x_{j}‖}^{- η}})) = E_{ψ} (\prod_{x_{j} \in ψ ∖ x_{i}}^{} \frac{μ}{s P_{t} κ {‖x_{j}‖}^{- η} + μ}) \overset{(a)}{=} \exp (- 2 π λ \int_{R_{g}}^{\infty} (1 - \frac{μ}{s P_{t} κ r^{- η} + μ}) r d r) = \exp (- 2 π λ \int_{R_{g}}^{\infty} r \int_{0}^{\infty} e^{- t (1 + (μ / s P_{t} κ) r^{η})} d t d r) = e x p (- 2 π λ {(\frac{s P_{t} κ}{μ})}^{2 / η} \int_{R_{g}}^{\infty} x \int_{0}^{\infty} e^{- t (1 + x^{η})} d t d x) \overset{(b)}{=} \exp (- \frac{2 π λ {(s P_{t} κ)}^{2 / η} Γ_{R_{g}} (- 2 / η) Γ (- 2 / η + 1)}{η μ^{2 / η}}), \end{matrix}

(15)

where

(a)

is obeying Campbell's theory and

(b)

\begin{matrix} \int_{R_{g}}^{\infty} \int_{0}^{\infty} e^{- t (1 + x^{η})} x d t d x = \int_{R_{g}}^{\infty} e^{- t} \int_{0}^{\infty} x e^{- t x^{η}} d t d x = \frac{1}{η} \int_{R_{g}}^{\infty} {(y)}^{2 / η - 1} e^{(- y)} d y \int_{0}^{\infty} e^{- t} t^{- 2 / η} d t = \frac{1}{η} Γ_{R_{g}} (\frac{2}{η}) Γ (1 - \frac{2}{η}) . \end{matrix}

(16)

The coverage can be calculated as

\begin{matrix} P_{c o v} = P (SINR (y_{i}) > γ) = P (\frac{P_{t} κ h_{i} R^{- η}}{I (y_{i}) + σ^{2}} > γ) = P (h_{i} > \frac{R^{η} γ (I (y_{i}) + σ^{2})}{P_{t} κ}) = E_{I (y_{i})} [\exp (- \frac{μ R^{η} γ (I (y_{i}) + σ^{2})}{P_{t} κ})] = \exp (- \frac{μ R^{η} γ σ^{2}}{P_{t} κ}) E_{I (y_{i})} (\exp (- \frac{μ R^{η} γ I (y_{i})}{P_{t} κ})) = \exp (- \frac{μ R^{η} γ σ^{2}}{P_{t} κ}) L_{I_{0} (y_{i})} (\frac{μ R^{η} γ}{P_{t} κ}) L_{I_{1} (y_{i})} . \end{matrix}

(17)

In this paper, based on the interference model we proposed, the aggregate interference is considered to be caused by two kinds of interference sources, which are denoted as $I_{0}$ and $I_{1}$ . Consider

\begin{matrix} L_{I (r)} (s) = E [e^{s I_{0}}] E [e^{s I_{1}}] = e x p (- \frac{2 π λ F_{h_{i}} (P_{th} {(R_{g} + R)}^{1 / η} / P_{t} κ) P_{HCP} {(s P_{t} κ / μ)}^{2 / η} {(s P_{t} κ)}^{2 / η} Γ (- 2 / η) Γ (- 2 / η + 1)}{η μ^{2 / η}}) \cdot \exp (- \frac{2 π λ {(s P_{t} κ)}^{2 / η} Γ_{R_{g}} (- 2 / η) Γ (- 2 / η + 1)}{η μ^{2 / η}}) . \end{matrix}

(18)

Obviously, the aggregate interference is closely related to

R_{g}

, the radius of the guard region.

6. Simulation Results and Analysis

In this section, the system synthetical performance of the designed schemes is illustrated by the computer simulation using MATLAB. First, we describe the parameter settings adopted in our simulation, and then the simulation results and discussions are presented. Simulation parameters discussed above are summarized in Table 1. We assume that the size of the area A is $50 * 50$ m², and simulation parameters are summarized in Table 1.

Table 1

Simulation parameter settings.

Parameter	Value
H	$2 \leq η \leq 6$
W	0.01 mw
$Λ$	0.001–0.1
$η$	0, 3, 6
B	0 dB ≤ β ≤ 40 dB
$κ$	10
$P_{t}$	0.1 mw ≤ $P_{t}$ ≤ 1 mw
M	1

The analysis of the influence that channel random parameters η and β and the transmission power $P_{t}$ have on the continuous flow density of the sensor network will be illustrated by the following simulation results.

Figure 2 shows the influence that channel attenuation factor μ has on the activity probability with the adoption of hybrid scheduling scheme. It can be illustrated that, given the density of nodes λ in the network, the bigger the channel attenuation factor μ is, the more active the nodes in the network are. That is because when μ gets bigger, the sensing field of the node shrinks, which means that the active contention region of the nodes becomes smaller. Accordingly, the number of the active nodes increases. The simulation of the $P_{HCP}$ is the result of Monte-Carlo simulation after 1000 times irritations, while the theoretical value refers to the $P_{HCP}$ calculated by formula (11). Due to the extinction effect hard-core point process has on retained (active) node, the simulated value of the active probability is higher than the theoretical value. However, the variation tendency of simulation value is consistent with that of the theoretical value, which verifies the validity of the theoretical value.

Figure 2

Influence of active probability under different μ.

Figure 3 shows the influence the path loss exponent η has on the activity probability with the adoption of hybrid scheduling scheme. It can be illustrated that, given the density of nodes λ in the network, the bigger the path loss exponent η is, the more active the nodes in the network are. That is because when η gets bigger, the sensing field of the node shrinks, which means that the active contention region of the nodes becomes smaller. Accordingly, the number of the active nodes increases. The simulation of the $P_{HCP}$ is the result of Monte-Carlo simulation after 1000 times irritations, while the theoretical value refers to the $P_{HCP}$ calculated by formula (11). Due to the extinction effect hard-core point process has on retained (active) node, the simulated value of the active probability is higher than the theoretical value. However, the variation tendency of simulation value is consistent with that of the theoretical value, which verifies the validity of the theoretical value.

Figure 3

Influence of activity probability under different η.

Figure 4 shows the influence that receiving power threshold $P_{t h}$ has on the activity probability with the adoption of hybrid scheduling scheme. It can be illustrated that, given the density of nodes λ in the network, the bigger the receiving power threshold $P_{t h}$ is, the fewer the active nodes in the network are. That is because when $P_{t h}$ gets bigger, the sensing field of the node extends, which means that the active contention region of the nodes become bigger. Accordingly, the number of the active nodes decreases.

Figure 4

Influence of activity probability under different $P_{t h}$ .

Figure 5 shows the influence that the threshold value of SNR β has on the coverage probability. It can be illustrated that the bigger the threshold value of SNR β is, the smaller the value of the coverage probability computed by formula is, and so is the simulation of the coverage probability. The simulation of the $P_{c o v}$ is the result of Monte-Carlo simulation after 1000 times irritations, while the theoretical value refers to the $P_{c o v}$ calculated by formula (11). In general, the variation tendency of simulation value is consistent with that of the theoretical value, which verifies the validity of the theoretical value.

Figure 5

Coverage probability versus threshold value of SINR.

Figure 6 shows the influence that receiving power threshold $P_{t h}$ has on the coverage probability. It can be illustrated that, given the path loss exponent η in the network, the bigger the receiving power threshold $P_{t h}$ is, the higher the value of the coverage probability is. The result can be explained as follows: with the given path loss exponent η, the increasing receiving power threshold $P_{t h}$ can lead to less interferences, which means higher coverage probability. While the receiving power threshold $P_{t h}$ is given, with the increasing of the path loss exponent η, the coverage probability gets bigger. That is because once the receiving power threshold $P_{t h}$ is settled, the path loss exponent η getting bigger can cause less interferences, which means that the coverage probability becomes bigger.

Figure 6

Coverage probability versus $P_{t h}$ under different η .

Figure 7 shows the influence that channel attenuation factor µ has on the coverage probability. It can be illustrated that, given the path loss exponent η in the network, the bigger the channel attenuation factor µ is, the lower the value of the coverage probability is. That is resulted by the truth that, with the given path loss exponent η, the increasing channel attenuation factor µ can result in more interferences, which means lower coverage probability. While the channel attenuation factor µ is given, with the increasing of the path loss exponent η, the coverage probability gets bigger. That is because once the channel attenuation factor µ is settled, the path loss exponent η getting bigger leads to less interferences, which means the coverage probability becomes bigger.

Figure 7

Coverage probability versus µ under different η.

The hard-core scheduling scheme controls the conversion of the nodes' operating state in order to achieve an equitable distribution of the limited energy, time slot, and spectrum resource in the network as well as reduce the interference during the transmission.

When comparing the performance of the hard-core scheduling scheme and the random scheduling scheme, we use a more exquisite index, where k is the number of sensors covering the event. $λ_{active}$ is the density of the active nodes. Consider

\begin{matrix} P (λ_{active}, k) = 1 - \sum_{i = 0}^{k - 1} \frac{{[λ_{active} A]}^{i} e^{- λ_{active} A}}{i!} . \end{matrix}

(19)

Figure 8 illustrates the effect that different scheduling schemes have on coverage probability. After comparing the two figures in Figure 8, it can be observed that when the density of active nodes is given, limited by the number of active node, the coverage probability decreases with the increasing k. As for the point that the two figures, respectively, illustrate, first we do the Monte-Carlo approach to the network when $η = 4$ , $μ = 1$ , and $β = 0$ dB, and then we compare the effect that different scheduling schemes have on coverage probability. It can be observed that the coverage probability under the hard-core scheduling scheme is higher than that under the random scheduling scheme.

Figure 8

Comparison between the hard-core scheduling scheme and the random scheduling scheme.

7. Conclusion

This paper has analyzed the effect of the guard region of receiving nodes to network interference model in WSN and Rayleigh fading channel. It has proposed the theoretical analysis model of topology control. It spreads mainly in two aspects: one is density controlling scheme and the other is coverage analysis, in which we succeed to make a refined calculation of the interference inside the guard region resulting as $I_{0}$ and calculate the interference outside the guard region using the HCPP's analysis result fitting. By building simulation environment and using Monte-Carlo simulation, we succeed in verifying the validity of the model and analyzing the influence on the coverage under different parameters.

Footnotes

Competing Interests

The authors declare that they have no competing interests.

Acknowledgments

This work was supported by the National Natural Science Foundation of China (no. 61372117).

References

Akyildiz

Sankarasubramaniam

Cayirci

Wireless sensor networks: a survey

Computer Networks 2002 38 4 393 422

10.1016/s1389-1286(01)00302-4

Liu

A generalized probabilistic topology control for wireless sensor networks

IEEE Journal on Selected Areas in Communications 2012 30 9 1780 1788

10.1109/JSAC.2012.121023

2-s2.0-84866947169

Ammari

H. M.

Das

S. K.

A study of k-coverage and measures of connectivity in 3D wireless sensor networks

IEEE Transactions on Computers 2010 59 2 243 257

10.1109/tc.2009.166

MR2750528

2-s2.0-75149172742

Liu

Some problems of directional sensor networks

International Journal of Sensor Networks 2007 2 1-2 44 52

10.1504/IJSNET.2007.012981

2-s2.0-84893537199

Veltri

Huang

Potkonjak

Minimal and maximal exposure path algorithms for wireless embedded sensor networks

Proceedings of the 1st International Conference on Embedded Networked Sensor Systems (SenSys '03)

2003

ACM

40 50

10.1145/958491.958497

Zou

Chakrabarty

A distributed coverage- and connectivity-centric technique for selecting active nodes in wireless sensor networks

IEEE Transactions on Computers 2005 54 8 978 991

10.1109/tc.2005.123

2-s2.0-24144501101

Yang

Qiao

Barrier information coverage with wireless sensors

Proceedings of the IEEE Conference on Computer Communications (INFOCOM '09)

April 2009

Rio de Janeiro, Brazil

IEEE

918 926

Liu

Zhang

Localization-oriented coverage based on Bayesian estimation in camera sensor networks

Proceedings of the International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM '08)

June 2008

Newport Beach, Calif, USA

IEEE

1 8

10.1109/wowmom.2008.4594837

2-s2.0-52049096431

Haenggi

Stochastic Geometry for Wireless Networks 2012

Cambridge University Press

MR3184048

10.

Fang

Zhang

Identifying neighbor and connectivity of wireless sensor networks with poisson point process

Wireless Personal Communications 2012 64 4 795 809

10.1007/s11277-010-0220-4

2-s2.0-84862582343

11.

Kong

Zhao

Liu

X.-Y.

Liu

M.-Y.

Shu

Surface coverage in sensor networks

IEEE Transactions on Parallel and Distributed Systems 2014 25 1 234 243

10.1109/TPDS.2013.35

2-s2.0-84904098381

12.

Zhang

Nevat

Peters

Event detection in wireless sensor networks in random spatial sensors deployments

IEEE Transactions on Signal Processing 2015 63 22 6122 6135

10.1109/tsp.2015.2452218

13.

Alfano

Garetto

Leonardi

New directions into the stochastic geometry analysis of dense CSMA networks

IEEE Transactions on Mobile Computing 2014 13 2 324 326

10.1109/TMC.2012.248

2-s2.0-84891610869

14.

Liu

A QoS-based topology control algorithm for underwater wireless sensor networks

International Journal of Distributed Sensor Networks 2010 2010 12

642053

10.1155/2010/642053

2-s2.0-79952820385

15.

Zhang

Poor

H. V.

Chiang

Optimal power allocation for distributed detection over MIMO channels in wireless sensor networks

IEEE Transactions on Signal Processing 2008 56 9 4124 4140

10.1109/tsp.2008.924639

MR2517162

2-s2.0-65449138003

16.

Zhang

Koh

J. Y.

Lin

Nevat

Distributed event detection under Byzantine attack in wireless sensor networks

Proceedings of the 9th IEEE International Conference on Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP '14)

April 2014

1 6

10.1109/issnip.2014.6827609

2-s2.0-84903691900

17.

Nevat

Peters

G. W.

Collings

I. B.

Distributed detection in sensor networks over fading channels with multiple antennas at the fusion centre

IEEE Transactions on Signal Processing 2014 62 3 671 683

10.1109/TSP.2013.2293970

MR3160304

2-s2.0-84893366007

18.

Heath

Kountouris

Bai

Modeling heterogeneous network interference using Poisson point processes

IEEE Transactions on Signal Processing 2013 61 16 4114 4126

10.1109/TSP.2013.2262679

MR3085300

2-s2.0-84880831887

19.

Weber

S. P.

Yang

Andrews

J. G.

de Veciana

Transmission capacity of wireless ad hoc networks with outage constraints

IEEE Transactions on Information Theory 2005 51 12 4091 4102

10.1109/tit.2005.858939

MR2243145

2-s2.0-29144494481

20.

Hasan

Andrews

J. G.

The guard zone in wireless ad hoc networks

IEEE Transactions on Wireless Communications 2007 6 3 897 906

10.1109/TWC.2007.04793

2-s2.0-33947580021

21.

Pan

Dynamic frequency reuse based on guard regions in two-layer heterogeneous networks

Electronics Letters 2015 51 12 947 949

10.1049/el.2015.0347

2-s2.0-84930720850

22.

Gulati

Evans

B. L.

Andrews

J. G.

Tinsley

K. R.

Statistics of co-channel interference in a field of Poisson and Poisson-Poisson clustered interferers

IEEE Transactions on Signal Processing 2010 58 12 6207 6222

10.1109/tsp.2010.2072922

MR2790082

2-s2.0-78649301787

23.

Hernandez-Aquino

Zaidi

S. A.

McLernon

Ghogho

Imran

Tilt angle optimization in two-tier cellular networks—a stochastic geometry approach

IEEE Transactions on Communications 2015 63 12 5162 5177

10.1109/tcomm.2015.2485981