On the Probabilistic Deployment of Smart Grid Networks in TV White Space

Abstract

To accommodate the rapidly increasing demand for wireless broadband communications in Smart Grid (SG) networks, research efforts are currently ongoing to enable the SG networks to utilize the TV spectrum according to the Cognitive Radio paradigm. To this aim, in this letter, we develop an analytical framework for the optimal deployment of multiple closely-located SG Neighborhood Area Networks (NANs) concurrently using the same TV spectrum. The objective is to derive the optimal values for both the number of NANs and their coverage. More specifically, regarding the number of NANs, we derive the optimal closed-form expression, i.e., the closed-form expression that assures the deployment of the maximum number of NANs in the considered region satisfying a given collision constraint on the transmissions of the NANs. Regarding the NAN coverage, we derive the optimal closed-form expression, i.e., the closed-form expression of the NAN transmission range that assures the maximum coverage of each NAN in the considered region satisfying the given collision constraint. All the theoretical results are derived by adopting a stochastic approach. Finally, numerical results validate the theoretical analysis.

1. Introduction

To accommodate the rapidly increasing demand for wireless broadband communications in Smart Grid (SG) scenarios, research efforts [1] are currently ongoing to enable the SG Networks (SGNs) to utilize the channels of the TV spectrum temporarily unused by the licensed users, referred to as incumbents, according to the Cognitive Radio paradigm [2,3,4,5,6]. The vacant channels are known as TV White Space (TVWS) channels.

SG communications over TVWS channels are conditioned by regulators on the ability of the SGNs to avoid harmful interference toward incumbents. To this aim, the existing rulings [7] obviate the spectrum sensing as the mechanism for the SGNs to determine the TVWS availability. Instead, they require the SGNs to periodically access to a geolocated database, referred to as White Space DataBase (WSDB) [8,9,10], for acquiring the list of TVWS channels.

Let us consider the typical SG scenario shown in Figure 1, where several smart meters connected to a gateway constitute a Home Area Network (HAN), and multiple gateways connected to a Data Aggregate Unit (DAU) constitute a Neighborhood Area Network (NAN) [1,11,12] (please note that the typical wireless technologies and the corresponding values of the coverage ranges for HANs and NANs are reported in [12], along with further details on their communication features). The gateway is responsible for transmitting the meter data periodically collected within its HAN to the DAU via a TVWS channel, once declared available by the WSDB. However, experimental studies have shown that the number of TVWS channels is significantly limited in urban areas [13]. Hence, it is likely that multiple closely-located NANs are authorized to use the same TVWS channel and their transmissions may collide, leading so to a performance degradation. Moreover, since so far there are no regulatory requirements for the coexistence among NANs operating in TVWS spectrum, such a performance degradation can be severe. The described scenario of multiple closely-located NANs sharing the same TVWS channel has been considered for the first time in [14], where the sensing duration that maximizes the achievable data rate at a given NAN has been determined.

Differently from [14], in this letter, we develop an analytical framework for the optimal deployment of multiple closely-located NANs using the same TVWS channel with the objective to derive the optimal values for both the number of NANs and their coverage. More specifically, regarding the number of NANs, we derive the optimal closed-form expression, i.e., the closed-form expression that allows to evaluate the maximum number of NANs in the considered network region satisfying a given collision constraint on the transmissions of NANs.

Regarding the NAN coverage, we derive the optimal closed-form expression, i.e., the closed-form expression of the NAN transmission range that assures the maximum coverage of each NAN in the considered network region satisfying the given collision constraint.

All theoretical results are derived by adopting a stochastic approach and by considering the specificity of the NAN traffic demands. Finally, numerical results validate the theoretical analysis.

2. System Model

In a geographic region of area $\mathcal{A}$, K NANs are deployed. The HAN gateways of each NAN are responsible for transmitting the meter data periodically collected within their HANs to the DAU via the same TVWS channel declared available by the WSDB, as depicted in Figure 1. We denote with $G_i$ the number of HAN gateways belonging to the i-th NAN and with $R_{\text{TX}}^i$ their transmission range. The traffic of the i-th NAN is modeled thought the parameters $P_{\text{a}}^i$ and $P_{\text{in}}^i\stackrel{▵}{=}1-P_{\text{a}}^i$ denoting the probabilities of an arbitrary HAN gateway belonging to the i-th NAN being active (i.e., having meter data collected within its HAN to transmit to the DAU) and inactive, respectively.

3. Optimal Deployment Analysis

At a certain time instant t, the transmissions of two arbitrary HAN gateways, say $H_{\ell }^i$ and $H_m^j$ belonging to the i-th and j-th NANs, respectively, collide if and only if the HAN gateways are both active and their distance $d_{H_{\ell }^i{H}_m^j}\left(t\right)$ (denoted in the following as $d_{ij}\left(t\right)$ for the sake of simplicity) is smaller than the distance threshold constituted by the maximum between their transmission ranges, i.e., $d_{ij}\left(t\right)\le max\left(R_{\text{TX}}^i,R_{\text{TX}}^j\right)$. Hence, it results that the transmissions of a certain HAN gateway belonging to the i-th NAN, say $H_{\ell }^i$, collide with the transmissions of the j-th NAN if it exists al least one active HAN gateway belonging to the j-th NAN within the distance threshold. We denote the probability of this event as $P_{\text{C}}^{H_{\ell }^i,j}$. As a consequence, there is no collision between the transmissions of NANs i and j if none of the active HANs belonging to NAN i is within the distance threshold of any of the active HANs belonging to NAN j. We denote the probability of this event as ${\overline{P}}_{\text{C}}^{ij}$. In the following, by accounting for these definitions, with some algebraic manipulations, we derive the expressions of $P_{\text{C}}^{H_{\ell }^i,j}$ and $P_{\text{C}}^{ij}\stackrel{▵}{=}1-{\overline{P}}_{\text{C}}^{ij}$. Specifically:

$$P_{\text{C}}^{H_{\ell }^i,j}\stackrel{▵}{=}1-{\overline{P}}_{\text{C}}^{H_{\ell }^i,j}=1-\left[P_{\text{in}}^i+P_{\text{a}}^i{\left(1-P_{\text{a}}^j{P}_{d_{ij}}\right)}^{G_j}\right]$$

(1)

where $P_{d_{ij}}$ denotes the probability of the event $\left\{d_{ij}\left(t\right)\le max\left(R_{\text{TX}}^i,R_{\text{TX}}^j\right)\right\}$. By accounting for Equation (1) and the definition of $P_{\text{C}}^{ij}$, in the reasonable hypothesis of independence of the HAN transmissions, it results

$$\begin{array}{c}\hfill P_{\mathrm{C}}^{ij}\stackrel{▵}{=}1-{\overline{P}}_{\mathrm{C}}^{ij}=1-\prod _{l=1}^{G_i}{\overline{P}}_{\mathrm{C}}^{H_{\ell }^i,j}=1-{\left[P_{\text{in}}^i+P_{\text{a}}^i{\left(1-P_{\text{a}}^j{P}_{d_{ij}}\right)}^{G_j}\right]}^{G_i}\end{array}$$

(2)

Since in a typical SG scenario it is reasonable to assume statistically the NANs having similar traffic and communication characteristics, the collision probabilities between two NANs are symmetric, i.e., $P_{\text{C}}^{ij}=P_{\text{C}}^{ji}=P_{\text{C}}$. Hence the overall collision probability $P_{\text{C}}^{\mathcal{O}}$, i.e., the probability that the transmissions of at least one NAN collide with the transmissions of at least one of the remaining $(K-1)$ NANs, can be calculated as follows:

$$\begin{array}{c}\hfill P_{\text{C}}^{\mathcal{O}}\stackrel{▵}{=}1-{\left({\overline{P}}_{\text{C}}\right)}^{\left(\genfrac{}{}{0pt}{}{K}{2}\right)}=1-{\left({\overline{P}}_{\text{C}}\right)}^{\frac{K(K-1)}{2}}\end{array}$$

(3)

where ${\overline{P}}_{\text{C}}={\overline{P}}_{\text{C}}^{ij}$ is given in Equation (2) and the binomial coefficient $\left(\genfrac{}{}{0pt}{}{K}{2}\right)$ is due to the symmetry of the collision probabilities ${\left\{P_{\text{C}}^{ij}\right\}}_{i,j\in \{1,\dots K\}}$. By substituting ${\overline{P}}_{\text{C}}$ in Equation (3), one has:

$$\begin{array}{c}\hfill P_{\text{C}}^{\mathcal{O}}=1-{\left[P_{\text{in}}+P_{\text{a}}{\left(1-P_{\text{a}}{P}_d\right)}^G\right]}^{\frac{GK(K-1)}{2}}\end{array}$$

(4)

As mentioned in the introduction, $P_{\mathrm{C}}^{\mathcal{O}}$ has to be under a threshold, depending on the considered application, to assure a certain level of protection on the NANs transmissions, i.e.,

$$P_{\mathrm{C}}^{\mathcal{O}}\le {\mathcal{T}}_{\mathrm{C}}$$

(5)

With ${\mathcal{T}}_{\text{C}}$ denoting the largest value of the overall collision probability tolerated by the SG scenario. In the following we refer to ${\mathcal{T}}_{\text{C}}$ as collision constraint. Satisfying Equation (5) is equivalent to satisfy:

$$1-{\left[P_{\text{in}}+P_{\text{a}}{\left(1-P_{\text{a}}{P}_d\right)}^G\right]}^{\frac{GK(K-1)}{2}}\le {\mathcal{T}}_{\text{C}}$$

(6)

The largest value of K satisfying Equation (6), say the optimal value $K_{\text{opt}}$, is the maximum number of NANs that can be deployed in the region of area $\mathcal{A}$ satisfying the collision constraint ${\mathcal{T}}_{\text{C}}$. Specifically, by applying the logarithm function with basis $P_{\text{in}}+P_{\text{a}}{\left(1-P_{\text{a}}{P}_d\right)}^G$ to Equation (6) and by recognizing that this logarithm is a decreasing function of its argument since $P_{\text{in}}+P_{\text{a}}{\left(1-P_{\text{a}}{P}_d\right)}^G\le 1$, one has:

$$P_{\text{C}}^{\mathcal{O}}\le {\mathcal{T}}_{\text{C}}\iff K(K-1)\le \frac{2}{G}{log}_{P_{\text{in}}+P_{\text{a}}{\left(1-P_{\text{a}}{P}_d\right)}^G}(1-{\mathcal{T}}_{\text{C}})$$

(7)

Hence, $K_{opt}$ is obtained as the largest integer less than or equal to the maximum value satisfying Equation (7):

$$K_{\text{opt}}=⌊\frac{1}{2}\left(-1+\sqrt{1+\frac{8}{G}{log}_{P_{\text{in}}+P_{\text{a}}{\left(1-P_{\text{a}}{P}_d\right)}^G}(1-{\mathcal{T}}_{\text{C}})}\right)⌋$$

(8)

With $\lfloor ·\rfloor$ denoting the floor operator. It’s easy to verify that ${\displaystyle 1+\frac{8}{G}{log}_{P_{\text{in}}+P_{\text{a}}{\left(1-P_{\text{a}}{P}_d\right)}^G}(1-{\mathcal{T}}_{\text{C}})\ge 1}$, i.e., $K_{\text{opt}}$ is positive. From Equation (8) it results that, for a given value of ${\mathcal{T}}_{\text{C}}$, $K_{\text{opt}}$ decreases as G increases. The same consideration holds if $P_{\text{a}}$ increases.

In the hypothesis of NANs uniformly distributed in the region of area $\mathcal{A}$ and $R_{\text{TX}}<<\sqrt{\mathcal{A}}$ (We assumed a bi-dimensional squared network region. This hypothesis is not restrictive. In fact, if the network region has dimensions a and b, respectively, one has to compare the transmission range with the smallest dimension, i.e.: $R_{TX}<<min\{a,b\}$), $P_d=P(d\left(t\right)<R_{\text{TX}})$ can be evaluated as: $P_d\simeq \frac{\pi R_{\text{TX}}^2}{\mathcal{A}}$. By substituting this in Equation (6), the optimal NAN coverage $R_{\text{TX}}^{\text{opt}}$, i.e., the maximum value of the transmission range that satisfies the collision constraint ${\mathcal{T}}_{\text{C}}$, is obtained by solving Equation (6) with respect to $R_{\text{TX}}$ and by taking the maximum value:

$$R_{\text{TX}}^{\text{opt}}=\sqrt{\frac{\mathcal{A}}{\pi P_{\text{a}}}}\sqrt{1-\sqrt[G]{\frac{\sqrt[\frac{GK(K-1)}{2}]{\left(1-{\mathcal{T}}_{\text{C}}\right)}-P_{\text{in}}}{P_{\text{a}}}}}$$

(9)

From Equation (9) it results that the optimal coverage increases as the SG traffic demand $P_{\mathrm{a}}$ decreases, as expected.

In

Table 1. Adopted notation.

Symbol	Definition
K	number of NANs deployed in the network region
$\mathcal{A}$	Area of the network region
$H_{\ell }^i$	The ℓ-th HAN gateway belonging to the i-th NAN
$H_m^j$	The m-th HAN gateway belonging to the j-th NAN
$P_{\mathrm{C}}^{ij}$	Collision probability of the transmissions of NANs i and j
$P_{\mathrm{C}}^{\mathcal{O}}$	Overall collision probability
$P_{\mathrm{a}}$	Probability of an arbitrary HAN gateway belonging to the i-th NAN being active
$P_{\text{in}}$	Probability of an arbitrary HAN gateway belonging to the i-th NAN being inactive
G	Number of HAN gateways
$R_{\text{TX}}$	Transmission range of an HAN gateway
$P_d$	Probability of the distance $d\left(t\right)$ between two arbitrary HAN gateways belonging
	to two different NANs being smaller than $R_{\text{TX}}$
${\mathcal{T}}_{\mathrm{C}}$	Collision constraint, i.e., the largest value of the overall collision probability tolerated by the SG scenario
$R_{\text{TX}}^{\text{opt}}$	Optimal NAN coverage, i.e., the maximum value of $R_{\text{TX}}$ satisfying the collision constraint ${\mathcal{T}}_{\text{C}}$
$K_{\text{opt}}$	The largest value of K satisfying the collision constraint ${\mathcal{T}}_{\mathrm{C}}$

we summarized the notation used for the parameters involved in the analysis along with their meaning, to improve the clarity of the manuscript.

4. Numerical Results

Here, we validate the theoretical results through Monte Carlo simulations. We consider $K=3$ NANs placed randomly in a squared region of area $\mathcal{A}$. Figure 2 shows the overall collision probability $P_{\text{C}}^{\mathcal{O}}$ as a function of the SG traffic demand $P_{\text{a}}$, for three different values of the normalized transmission range, i.e., $R_{\text{TX}}/\sqrt{A}=\{0.01,0.02,0.03\}$. First, we note that the theoretical results match very well the simulation results. Then, when $P_{\text{a}}$ decreases, $P_{\text{C}}^{\mathcal{O}}$ decreases as well, since the probability of an HAN gateway being active decreases. Moreover, when $R_{\text{TX}}/\sqrt{A}$ increases $P_{\text{C}}^{\mathcal{O}}$ increases, since it is more likely that two HAN gateways are within a distance smaller than their transmission range. In the same figure, we also plot the optimal transmission range $R_{\text{TX}}^{\text{opt}}/\sqrt{A}$ given in Equation (9) as function of $P_{\text{a}}$ for a value of the collision threshold equal to ${\mathcal{T}}_{\text{C}}=0.05$. By comparison with the previous plot, we note that the theoretical results are once again confirmed. In fact, only if $R_{\text{TX}}\le R_{\text{TX}}^{\text{opt}}$, the collision constraint is satisfied. Figure 3 shows $P_{\text{C}}^{\mathcal{O}}$ as a function of $P_{\text{a}}$, for three different values of the number G of HAN gateways, i.e., $G=\{10,20,30\}$. Again, the theoretical results match very well the simulation results. Moreover, when G increases, $P_{\text{C}}^{\mathcal{O}}$ increases as well. This result is reasonable, since it is more likely to find active HAN gateways.

5. Conclusions

We developed a theoretical framework for the optimal deployment of multiple closely-located NANs over TVWS spectrum. Specifically, we derived through closed-form expressions the optimal values for both the number of NANs and their coverage, i.e., the maximum values assuring the given collision constraint. Such closed-form expressions reveled the highly non-linear relationship among the involved parameters as the number of NANs, their traffic demand, the number of HAN gateways and their transmission ranges. The developed analysis is crucial and preliminary for designing any effective coexistence protocol. Such an issue will be addressed in a future work along with optimization strategies for the DAU deployment.