Cooperative Beamforming for Physical-Layer Security in Power-Constrained Wireless Sensor Networks with Partial Relay Selection

Abstract

We investigate the physical-layer security of a wireless sensor network comprised of a source-destination pair, multiple decode-and-forward (DF) relays, and an eavesdropper. When the relays forward the source signal to the destination, they should dissipate certain power for driving their physical circuits (e.g., amplifiers and filters), in addition to the transmit power required for emitting radio signals. However, no existing work considers the circuit power when exploiting relays for enhancing the wireless security against eavesdropping. We thus propose the relay-selection based cooperative beamforming framework, where partial relays are selected to forward the source signal in a beamforming manner. We present two relay-selection strategies, namely, the exponential-complexity exhaustive search and linear-complexity relay ordering. For comparison purposes, we also evaluate the conventional all-relay based and best-relay based beamforming schemes, where all relays or only the best one is selected to assist the source-destination transmission. It is shown that the proposed beamforming schemes significantly outperform the conventional all-relay and best-relay based beamforming schemes in terms of secrecy capacity. Additionally, the relay-ordering based beamforming scheme almost achieves the same secrecy capacity as the exhaustive-search method, but with a reduced computational complexity.

1. Introduction

Wireless sensor networks (WSNs) provide efficient data acquisition and processing solutions for various applications such as factory automation, environment monitoring, and battlefield reconnaissance. Cooperative communication is a popular technique in WSNs to improve system reliability and throughput as sensor nodes are usually equipped with single antenna and the destination node might be out of the coverage of the source node. However, the broadcast nature of wireless medium brings not only the feasibility of sensor cooperation, but also the vulnerability to wiretapping. Although cryptographic techniques are widely used in modern communication systems, information leakage is still likely to happen if brute-force attack occurs. Hence, it is necessary to further enhance the overall system confidentiality through physical-layer security (PLS) schemes.

Wyner pioneered the study of PLS by proving that it is possible to communicate safely without a secret key in a degraded broadcast channel [1]. His results were extended to nondegraded channels [2] and Gaussian wiretap channels [3] in 1978 and were further extended to general fading wiretap channels in 2008 [4]. PLS has exerted a tremendous interest on a growing number of researchers ever since. Recently, a lot of attention has been drawn to the improvement of secrecy capacity (which is defined in [3] as the difference between the capacity of the legitimate link and that of the wiretapping link) by incorporating relays [5–9] and performing beamforming [7–12].

Beamforming technique is widely used in relay systems [13–15] as an effective way to improve the received signal-to-noise ratio (SNR) at the destination. The core idea of applying beamforming in traditional relay systems without security concerns is to exploit the magnitudes and phases of the relay-to-destination channels and accordingly adjust the transmit powers and phases of the signals that are to be transmitted from several relays bearing a common message, so as to combine the signals at the destination constructively [14]. However, for relay systems with security concerns, the beamforming technique needs to exploit the channel information of both the destination and the eavesdropper. And the objective is no longer the received SNR at the destination but the secrecy capacity.

Among the aforementioned works in the area of beamforming for PLS purposes, [7] studied beamforming schemes for decode-and-forward (DF), amplify-and-forward (AF), and cooperative jamming where all available relays were adopted, either to retransmit the source signal or to send an artificial noise to confound the eavesdropper. Null-space beamforming was proposed in [8] to hide the information signal in the null-space of the relay-eavesdropper channel. These beamforming schemes were designed with perfect channel information of the wiretapping link while in [9, 11, 12, 16, 17], the authors proposed their schemes based on imperfect channel information or even no channel information of the wiretapping link. Although the assumption of imperfect channel information or even no channel information of the wiretapping link is more practical, the models in these papers do not accord with WSNs since sensors are usually equipped with single antenna. Besides, relay-selection (RS) strategies have also been studied in [5, 6] where the single best relay that can provide the maximal secrecy capacity or minimal secrecy outage probability is selected. Although the best-relay-selection strategy is easy to deploy, it sacrifices some security performance. It will be pointed out that although the models and assumptions of the relay/multiantenna systems are different, a common conclusion that system security improves with the increase of relay/antenna number and relay/antenna transmit power can be drawn.

The above existing studies that exploit relays to enhance system security are designed with only consideration of transmit power. No attention was paid to circuit power consumption (CPC) which is indispensable for relays to drive the circuit blocks. As a matter of fact, in a WSN, the dense distribution of sensors allows them to transmit with a low power that might be comparable to or even overwhelmed by the circuit power, which makes the negligence of CPC improper. Furthermore, the sensor nodes are usually powered by batteries which provide energy for both signal transmission and processing. Hence, the traditional power constraints need to be modified in a WSN. The consequence of incorporating CPC is that the increase of relay number means the decrease of relay transmit power; thus, it is unclear whether system security still can be improved if more relays are adopted. In fact, [18–20] have revealed that, in multiantenna/cooperative systems without eavesdroppers, using more antennas/relays might degrade the system performance if the total power is constrained. However, no existing work considering CPC takes system security as a metric of interest. This motivates us to reveal whether the same result exists in a security-oriented cooperative WSN and how to select the best relays if it does.

The main contribution of our work can be described as follows. We take CPC into account to perform cooperative beamforming, whereas existing literature on the cooperative beamforming aided PLS fails to consider the CPC. Our work shows that when CPC is considered, adopting more relays may degrade the secrecy capacity performance, which, to the best of our knowledge, has not been revealed by any previous work. It is thus important but challenging to determine which relays should be selected to form an optimal beamforming vector. Although the exhaustive-search approach is effective in finding the optimal relays, its computational complexity grows exponentially with the number of relays. To this end, we propose a relay-ordering based beamforming scheme which has only a linear computational complexity but achieves nearly the same security performance as the exhaustive-search aided beamforming scheme does.

The remainder of this paper is organized as follows. Section 2 establishes the system model along with the total power constraint which includes both transmit power and circuit power. Section 3 first updates the conventional all-relay based and best-relay based beamforming schemes by incorporating CPC and then proposes two partial-relay-selection based beamforming schemes. In Section 4, the four schemes described in Section 3 are evaluated in terms of their secrecy capacity performance. Conclusions are drawn in Section 5.

2. System Model

Consider a cooperative WSN consisting of a source-destination pair with K helpers $H = {H_{i} ∣ i = 1,2, \dots, K}$ and an eavesdropper as shown in Figure 1. Each node is equipped with single antenna working in half-duplex mode. Only the helpers that can successfully decode the source signal are considered as candidate relays. We define the collection of candidate relays as decoding set $D = {R_{i} ∣ i = 1,2, \dots, M} \subseteq H$ . The source-relay, relay-destination, and relay-eavesdropper channels are denoted by $h_{S R} = (h_{S R, 1}, h_{S R, 2}, \dots, h_{S R, M})^{T}$ , $h_{R D} = (h_{R D, 1}, h_{R D, 2}, \dots, h_{R D, M})^{T}$ and $h_{R E} = (h_{R E, 1}, h_{R E, 2}, \dots, h_{R E, M})^{T}$ , respectively. All the channels are independent and the channel between node A and node B follows a $C N (0, σ_{A B}^{2})$ distribution, where $σ_{A B}^{2} = (λ / 4 π d_{A B})^{3.5} G_{A} G_{B}$ with λ, $d_{A B}$ , $G_{A}$ , and $G_{B}$ representing the wavelength, the distance between A and B, the transmit antenna gain at A, and the receive antenna gain at B, respectively. The additive white Gaussian noises (AWGNs) are assumed to follow a $C N (0, σ_{n}^{2})$ distribution.

Figure 1

A cooperative WSN in the presence of an eavesdropper. The relays in the decoding set are shaded. Solid line: legitimate link; dashed line: eavesdropping link.

Note that many of the previous beamforming designs assumed perfect instantaneous channel state information (CSI) of both the legitimate link and the eavesdropping link. In practical scenarios, however, the eavesdropper is probably passive, so it might be difficult to attain its instantaneous CSI due to the absence of feedback. Hence, following [6, 16, 17], in this paper, we assume that only statistical information of the eavesdropping link is priorly known since it is possible that the location of the eavesdropper is roughly known.

In the first hop, the source transmits $\sqrt{P_{s}} s$ , where s is normalized as $E [| s |^{2}] = 1$ and $P_{s}$ is the transmit power of the source node. In the second hop, each selected relay decodes its received signal, reencodes it, and then forwards a scaled version of the reencoded signal; that is, $R_{i}$ transmits $t_{i} = w_{i}^{*} s$ , where $w_{i}^{*}$ represents the conjugate of $w_{i}$ and is the beamforming weight of $R_{i}$ , and $P_{t, i} = | w_{i} |^{2}$ is the transmit power. Denote the set of selected relays as $R_{s} \subseteq D$ . Apparently, if $R_{i} \notin R_{s}$ , $w_{i} = 0$ .

The respective received signals at the destination and the eavesdropper can be expressed as

\begin{matrix} y_{D} = w^{H} h_{R D} s + v_{D}, \\ y_{E} = w^{H} h_{R E} s + v_{E}, \end{matrix}

(1)

where

v_{D}

and

v_{E}

are the AWGNs at the legitimate destination and the eavesdropper.

To obtain the total power constraint on relays with CPC included in a generic way, we divide the CPC of each relay into two parts, one of which is independent of the transmit power and the other of which is dependent. For $R_{i} \notin R_{s}$ , both parts are 0; for $R_{i} \in R_{s}$ , its CPC can be written as $P_{c, i} = P_{o} + P_{P A, i}$ , where $P_{o}$ includes consumption terms of filters, mixers, and so on and $P_{P A, i}$ is the consumption of the power amplifier. The terms in $P_{o}$ vary with different systems and are irrelative with $P_{t, i}$ whereas the relationship between $P_{P A, i}$ and $P_{t, i}$ is $P_{P A, i} = (ξ / η - 1) P_{t, i}$ , where ξ is the peak to average ratio and η is the drain efficiency [18]. The total power constraint on relays is

\begin{matrix} P \geq \sum_{i = 1}^{M} (P_{t, i} + P_{c, i}) = \frac{ξ}{η} w^{H} w + |R_{s}| P_{o}, \end{matrix}

(2)

where

|\cdot|

is the cardinality. It is worth noticing that

|R_{s}|

is also the number of nonzero elements in w; that is,

| R_{s} | = {‖w‖}_{0}

, where

{‖\cdot‖}_{0}

is the 0-norm. Meanwhile, as has been mentioned in the previous section, secrecy capacity of a DF relay system grows with the total transmit power of relays. Hence, the optimal beamforming vector w satisfies

\begin{matrix} w^{H} w = P_{a} - {‖w‖}_{0} P_{b}, \end{matrix}

(3)

where

P_{a} = η P / ξ

and

P_{b} = η P_{o} / ξ

. Moreover,

{‖w‖}_{0}

needs to satisfy

{‖w‖}_{0} \leq N = ⌈P_{a} / P_{b} - 1⌉

, where

⌈\cdot⌉

is the ceil function, to avoid the impossible case that the whole power is consumed by circuitry.

3. Relay-Selection Based Beamforming Schemes for PLS

A widely used metric of interest in security-oriented systems is secrecy capacity $C_{s} = (C_{D} - C_{E})^{+}$ , where $C_{D}$ and $C_{E}$ represent the capacity of the legitimate link and that of the eavesdropping link, respectively, and $(a)^{+} = \max (a, 0)$ . However, since only statistical information of the eavesdropping link is assumed to be known, following [9, 16], we take the ergodic secrecy capacity over the distribution of the eavesdropper's CSI, that is, $C_{s}^{e r} = E_{h_{R E}} [C_{D} - C_{E}]$ , as the objective instead. From (1), it can be easily derived that

\begin{matrix} C_{s}^{e r} = \frac{1}{2} \log (1 + \frac{w^{H} h_{R D} h_{R D}^{H} w}{σ_{n}^{2}}) - \frac{1}{2} \underset{h_{R E}}{E} \log (1 + \frac{w^{H} h_{R E} h_{R E}^{H} w}{σ_{n}^{2}}) \end{matrix}

(4)

\begin{matrix} \geq \frac{1}{2} \log (1 + \frac{w^{H} h_{R D} h_{R D}^{H} w}{σ_{n}^{2}}) - \frac{1}{2} \log (1 + \frac{w^{H} V_{R E} w}{σ_{n}^{2}}), \end{matrix}

(5)

where

V_{R E} = diag (σ_{R E, 1}^{2}, σ_{R E, 2}^{2}, \dots, σ_{R E, M}^{2})

and (5) is derived after applying Jensen's Inequality to (4). Define

\begin{matrix} C_{s}^{l b} = \frac{1}{2} \log (\frac{σ_{n}^{2} + w^{H} h_{R D} h_{R D}^{H} w}{σ_{n}^{2} + w^{H} V_{R E} w}); \end{matrix}

(6)

then

C_{s}^{l b}

serves as the lower bound of

C_{s}^{e r}

. Hence, the optimization problem can be written as

\begin{matrix} \underset{w}{m a x} C_{s}^{l b} \\ s.t. w^{H} w = P_{a} - {‖w‖}_{0} P_{b}, {‖w‖}_{0} \leq N \end{matrix}

(7)

which can be further recast as

\begin{matrix} \underset{w}{m a x} \frac{w^{H} M w}{w^{H} E w} \\ s.t. w^{H} w = P_{a} - {‖w‖}_{0} P_{b}, {‖w‖}_{0} \leq N, \end{matrix}

(8)

where

M = σ_{n}^{2} I / (P_{a} - |R_{s}| P_{b}) + h_{R D} h_{R D}^{H}

and

E = σ_{n}^{2} I / (P_{a} - |R_{s}| P_{b}) + V_{R E}

In order to prove that the optimal RS strategy is to select partial relays as well as for subsequent comparison purpose, we first update the conventional schemes where either all relays or only one best relay is selected, namely, the all-relay based and the best-relay based beamforming schemes; then we present the partial relay based schemes.

3.1. Conventional Beamforming Schemes for PLS

3.1.1. All-Relay Based Beamforming Scheme

Consider that all the candidate relays are selected to assist the source; that is, $| R_{s} | = M$ . The optimal beamforming solution is

\begin{matrix} w_{a l l} = \sqrt{P_{a} - M P_{b}} u_{m a x} (E^{- 1} M), \end{matrix}

(9)

where

u_{m a x} (X)

represents the unit-norm eigenvector of matrix X that corresponds to its largest eigenvalue

λ_{m a x} (X)

. Substituting

w_{a l l}

into (4), we have

\begin{matrix} C_{s, a l l}^{l b} = \frac{1}{2} \log λ_{m a x} (E^{- 1} M) . \end{matrix}

(10)

This scheme only works when the power budget for relays is high enough to drive the circuit blocks in all M relays; that is, $P > M P_{o}$ needs to be satisfied.

3.1.2. Best-Relay Based Beamforming Scheme

Opportunistic relaying is also a common relaying strategy where only one best relay is selected. The best relay, say $R_{k}$ , is selected as the one that maximizes $C_{s}^{l b}$ ; that is,

\begin{matrix} R_{k} = \arg \max_{R_{i} \in D} \frac{σ_{n}^{2} + (P_{a} - P_{b}) {|h_{R D, i}|}^{2}}{σ_{n}^{2} + (P_{a} - P_{b}) σ_{R E, i}^{2}} . \end{matrix}

(11)

The beamforming weight is

w_{k} = (\sqrt{P_{a} - P_{b}} / | h_{R D, k} |) h_{R D, k}

Apparently, if $P_{o} < P \leq 2 P_{o}$ , only the best-relay based scheme can be applied. While in the case of $P ≫ M P_{o}$ , according to the majorization theory [21], the eigenvalues of a positive semidefinite Hermitian matrix majorize the diagonal elements, thus,

\begin{matrix} C_{s, a l l}^{l b} \geq \frac{1}{2} \log \max_{i} \frac{σ_{n}^{2} + (P_{a} - M P_{b}) {|h_{R D, i}|}^{2}}{σ_{n}^{2} + (P_{a} - M P_{b}) σ_{R E, i}^{2}} ≳ \frac{1}{2} \log \max_{i} \frac{σ_{n}^{2} + (P_{a} - P_{b}) {|h_{R D, i}|}^{2}}{σ_{n}^{2} + (P_{a} - P_{b}) σ_{R E, i}^{2}} = C_{s, b e s t}^{l b} . \end{matrix}

(12)

Hence, the all-relay based scheme becomes the better choice in this case. As a result, the best choice over the whole power range should be a partial RS based beamforming scheme that adjusts the selected relays and their weight vector according to the channels and the power budget. The next subsection is going to discuss how to select partial relays and design their weight vector.

3.2. Proposed Beamforming Schemes for PLS

The objective in (8) is a Rayleigh quotient [22]; to maximize it the eigenvalue decomposition (EVD) method is usually used. However, the argument in this objective is self-constrained. It is infeasible to directly use the EVD method on this problem. To break the self-constraint, we need to preassume the relays to be selected. For simplicity, we assume $| R_{s} | = m$ and denote the set of selected relays as $R_{s} = {R_{k_{1}}, R_{k_{2}}, \dots, R_{k_{m}}}$ . By dropping the nonselected relays, the corresponding legitimate channel and the variance matrix of the eavesdropping channel can be written as $h_{R D, s} = (h_{R D, k_{1}}, h_{R D, k_{2}}, \dots, h_{R D, k_{m}})^{T}$ and $V_{R E, s} = d i a g (σ_{R E, k_{1}}^{2}, σ_{R E, k_{2}}^{2}, \dots, σ_{R E, k_{m}}^{2})$ , respectively. Hence, the optimization problem becomes

\begin{matrix} \underset{w_{s}}{m a x} \frac{w_{s}^{H} M_{s} w_{s}}{w_{s}^{H} E_{s} w_{s}} \\ s.t. w_{s}^{H} w_{s} = P_{a} - m P_{b}, \end{matrix}

(13)

where

w_{s} = (w_{k_{1}}, w_{k_{2}}, \dots, w_{k_{m}})^{T}

M_{s} = σ_{n}^{2} I / (P_{a} - m P_{b}) + h_{R D, s} h_{R D, s}^{H}

, and

E_{s} = σ_{n}^{2} I / (P_{a} - m P_{b}) + V_{R E, s}

. The objective achieves its maximal value

\begin{matrix} C_{s}^{l b} (R_{s}) = \frac{1}{2} \log λ_{m a x} (E_{s}^{- 1} M_{s}) \end{matrix}

(14)

by adopting

w_{s} = \sqrt{P_{a} - m P_{b}} u_{m a x} (E_{s}^{- 1} M_{s})

The next step is to determine the optimal relays to be selected; that is,

\begin{matrix} \underset{R_{s}}{m a x} C_{s}^{l b} (R_{s}) \\ s.t. R_{s} \subseteq D, |R_{s}| \leq N . \end{matrix}

(15)

3.2.1. Exhaustive-Search Based Beamforming Scheme

It is obvious that the only way to obtain the optimal value of $R_{s}$ is to do exhaustive search. Given the maximal possible number of selected relays $m i n (M, N)$ , the sample space of $R_{s}$ is $Ω_{1} = {R_{1}, R_{2}, \dots, R_{2^{m i n (M, N)} - 1}}$ (∅ is clearly impossible to be the optimal value of $R_{s}$ unless no relay can successfully decode the source signal, in which case, the system achieves zero secrecy capacity). The exhaustive-search based beamforming scheme can be described in Algorithm 1.

Algorithm 1 (exhaustive-search based beamforming scheme).

The algorithm is described as follows: (1)

For each $R_{i} \in Ω_{1}$ , calculate $C_{s}^{l b} (R_{i})$ according to (14).

(2)

The optimal set of relays is selected according to $R_{s o p t} = \arg \max_{R_{i} \in Ω_{1}} C_{s}^{l b} (R_{i})$ .

(3)

The optimal weight vector for $R_{s o p t}$ is obtained as $w_{s o p t} = \sqrt{P_{a} - | R_{s o p t} | P_{b}} u_{m a x} (E_{s o p t}^{- 1} M_{s o p t})$ .

3.2.2. Relay-Ordering Based Beamforming Scheme

It will be noticed that the computational complexity of the exhaustive-search scheme is exponential in network size. To overcome this disadvantage, we introduce relay ordering into the RS strategy so that the computation will be significantly reduced.

If the received SNRs are high, the optimization problem in (13) is approximate to

\begin{matrix} \underset{w_{s}}{m a x} \frac{w_{s}^{H} h_{R D, s} h_{R D, s}^{H} w_{s}}{w_{s}^{H} V_{R E, s} w_{s}} \\ s.t. w_{s}^{H} w_{s} = P_{a} - m P_{b} \end{matrix}

(16)

which yields

\begin{matrix} C_{s}^{l b} (R_{s}) \approx \frac{1}{2} \log tr (V_{R E, s}^{- 1} h_{R D, s} h_{R D, s}^{H}) = \frac{1}{2} \log \sum_{i = 1}^{m} \frac{{|h_{R D, k_{i}}|}^{2}}{σ_{R E, k_{i}}^{2}}, \end{matrix}

(17)

where

t r (\cdot)

represents the trace. Consequently,

| h_{R D, i} |^{2} / σ_{R E, i}^{2}

is a feasible relay-ordering criterion. This criterion can be understood by looking into the definition of secrecy capacity. Enlarging secrecy capacity is equivalent to improving the capacity of the legitimate link whilst keeping the capacity of the eavesdropping link as low as possible. A large

| h_{R D, i} |^{2} / σ_{R E, i}^{2}

indicates that the

R_{i}

-destination channel is in relatively good condition, while the

R_{i}

-eavesdropper distance is relatively large. Thus, adopting such a relay

R_{i}

to forward the source signal is probably beneficial. In other words, the relay-ordering based beamforming scheme can be described in Algorithm 2.

Algorithm 2 (relay-ordering based beamforming scheme).

The algorithm is described as follows: (1)

Order the candidate relays as $| h_{R D, 1} |^{2} / σ_{R E, 1}^{2} \geq | h_{R D, 2} |^{2} / σ_{R E, 2}^{2} \geq \dots \geq | h_{R D, M} |^{2} / σ_{R E, M}^{2}$ .

(2)

Set $Ω_{2} = {R_{1}, R_{2}, \dots, R_{m i n (M, N)}}$ , where $R_{m} = {R_{1}, R_{2}, \dots, R_{m}}$ ; for each $R_{m}$ , calculate $C_{s}^{l b} (R_{m})$ according to (14).

(3)

The optimal set of relays is selected according to $R_{s o p t} = \arg \max_{R_{m} \in Ω_{2}} C_{s}^{l b} (R_{m})$ .

(4)

The optimal weight vector for $R_{s o p t}$ is obtained as $w_{s o p t} = \sqrt{P_{a} - | R_{s o p t} | P_{b}} u_{m a x} (E_{s o p t}^{- 1} M_{s o p t})$ .

Remarks. (i) Firstly, although the relay-ordering criterion is obtained by assuming high received SNRs, if the interrelay distances are much smaller than the relay-eavesdropper distances (which is widely assumed in relay systems), the relay-ordering based scheme is indeed the optimal scheme. In this case, $h_{R E, i} ~ C N (0, σ_{R E}^{2})$ , the relay-ordering criterion becomes $| h_{R D, i} |^{2}$ and the maximal $C_{s}^{l b}$ achieved by the relay-ordering based scheme is

\begin{matrix} C_{s}^{l b} (R_{s o p t}) = \frac{1}{2} l o g \frac{σ_{n}^{2} + (P_{a} - |R_{s o p t}| P_{b}) {‖h_{R D, s o p t}‖}^{2}}{σ_{n}^{2} + (P_{a} - |R_{s o p t}| P_{b}) σ_{R E}^{2}} . \end{matrix}

(18)

Meanwhile,

C_{s}^{l b}

achieved by any set of relays

R_{s}

with any beamforming weight

w_{s}

\begin{matrix} C_{s}^{l b} = \frac{1}{2} \log \frac{σ_{n}^{2} + w_{s}^{H} h_{R D, s} h_{R D, s}^{H} w_{s}}{σ_{n}^{2} + (P_{a} - |R_{s}| P_{b}) σ_{R E}^{2}} . \end{matrix}

(19)

Apparently,

\begin{matrix} C_{s}^{l b} \leq \frac{1}{2} \log \frac{σ_{n}^{2} + (P_{a} - |R_{s}| P_{b}) {‖h_{R D, s}‖}^{2}}{σ_{n}^{2} + (P_{a} - |R_{s}| P_{b}) σ_{R E}^{2}} \leq C_{s}^{l b} (R_{s o p t}) . \end{matrix}

(20)

(ii) Secondly, there are only

\min (M, N)

possible combinations of relays in the relay-ordering based beamforming scheme, so the computational complexity is

o (M)

whereas the computational complexity of the exhaustive-search based beamforming scheme is

o (2^{M})

4. Simulation Results

This section examines the performance of the proposed schemes. For simplicity, some of the circuit blocks are omitted such as the encoder, decoder, and pulse shaping block. Analog-to-digital converter and digital-to-analog converter are also omitted since their power consumption is relative to the hardware type. The resulting $P_{o}$ can be written as $P_{o} = P_{o t} + P_{o r}$ , where $P_{o t} = P_{f i l t} + P_{m i x} + P_{s y n}$ is the consumption of the blocks in the transmitting side and $P_{o r} = P_{L N A} + P_{f i l r} + P_{I F A} + P_{m i x} + P_{s y n}$ is the consumption of the blocks in the receiving side. The subscripts filt, mix, syn, LNA, filr, and IFA stand for filters at the transmitting side, mixer, frequency synthesizer, low noise amplifier, filters at the receiving side, and intermediate frequency amplifier. Using the parameters in [18], we have $P_{o} = 188.6$ mW. Note that the value of $P_{o}$ can be changed to extend the above schemes to include some other circuit blocks.

The number of helpers is set to 4, so the sample space of $D$ is $Ω = {\emptyset, D_{1}, D_{2}, \dots, D_{15}}$ . The probability of $D = D_{m}$ is $\Pr (D = D_{m}) = \prod_{H_{i} \in D_{m}} (1 - P_{{o u t}_{i}}) \prod_{H_{i} \in H - D_{m}} P_{{o u t}_{i}}$ , where $P_{{o u t}_{i}}$ is the probability of occurrence of outage over the source- $H_{i}$ channel [5] and is set to $1 0^{- 3}$ in our simulations. The helper-destination distances are set to 50 m and the helper-eavesdropper distances are set to d, $0.8 d$ , $1.2 d$ , and $1.5 d$ , where d is the reference helper-eavesdropper distance to show the relationship between the number of selected relays and the eavesdropper's location by varying d. The modulation method is 4 QAM ( $ξ = 1$ ). The carrier frequency is 2.5 GHz and the antenna gains are 0 dB. The noise variance is modeled as $σ_{n}^{2} = N_{0} B$ , where $N_{0} = - 174$ dBm/Hz is the single-sided spectral density and $B = 2$ MHz is the channel bandwidth. Every data point is averaged over 10,000 independent channel realizations.

Figure 2 shows the relationship between the average number of selected relays and the power budget for relays with the eavesdropper in two different locations. Since the curves of the two proposed schemes are close to each other, we provide Table 1 as well, to show the percentage error of the average number of adopted relays in the relay-ordering based scheme as compared with the optimal number obtained in the exhaustive-search based scheme.

Table 1

Percentage error of the average number of adopted relays.

d (in m)	P (in dBm)
d (in m)	23	25	27	29	31	33	35	37	39	41	43	45	47	49
50	0%	0%	0%	0%	0%	0%	0%	0%	0%	0%	0%	0%	0%	0%
200	0%	0%	23.1%	4.1%	8.9%	6.0%	1.9%	1.6%	0.12%	0.14%	0%	0.07%	0.12%	0.01%

Figure 2

Average number of selected relays versus total power budget.

Notice that a total power budget of 29 dBm is enough to drive all the circuit blocks in all helpers. However, the average optimal number of relays obtained by exhaustive search is only 2.09 when $d = 50$ m and 1.66 when $d = 200$ m. It can also be seen from both Figure 2 and Table 1 that, in the case of small d, the two schemes show perfect match, while, in the case of large d, the two schemes have a slight difference, but only in medium power range. This difference is attributed to the growing deviation between (13) and (16) when d grows. However, in practice, the value of d is usually small since sensor nodes are densely distributed.

It is worth mentioning that, according to Figure 2, for a fixed power budget, the farther the eavesdropper is, the fewer relays we should adopt. This indicates that as the helper-eavesdropper distance increases, the benefit brought by the increase of transmit power surpasses that by the increase of relay number.

Figure 3 compares different schemes in terms of the secrecy capacity they achieve with $d = 50$ m. The results of the conventional schemes are illustrated for the purpose of benchmarking. The proposed schemes obviously outperform the conventional ones in the whole power range. To be specific, in low power range and high power range, the proposed schemes have the advantage of the best-relay based scheme and that of the all-relay based scheme, respectively, while in medium power range, they outperform the conventional schemes both. This figure also clearly states that if CPC is considered in the total power constraint, adopting more relays may degrade the system security.

Figure 3

Performance comparison of different beamforming schemes.

5. Conclusion

We investigated beamforming schemes in a cooperative WSN for PLS with consideration of both transmit power and circuit power. We first revealed that the optimal beamforming scheme should be performed along with a partial RS strategy and then provided two partial RS based beamforming schemes, namely, the exhaustive-search based scheme and the relay-ordering based scheme, both of which adjust the selected relays dynamically according to the channels and the power budget. Simulation results show that our schemes combine the advantage of the all-relay based scheme in high power range and that of the best-relay based scheme in low power range. Moreover, the relay-ordering based scheme achieves almost the same secrecy capacity as the exhaustive-search based scheme does, but with a dramatically reduced computational complexity.

Footnotes

Competing Interests

The authors declare that they have no competing interests.

Acknowledgments

This work was supported by the Natural Science Foundation of China under Grants 61302101 and 61401223 and by the Graduate Innovation Plan of Jiangsu Province under Grant CXZZ12_0463.

References

Wyner

A. D.

The wire-tap channel

The Bell System Technical Journal 1975 54 8 1355 1387

10.1002/j.1538-7305.1975.tb02040.x

MR0408979

Csiszar

Korner

Broadcast channels with confidential messages

IEEE Transactions on Information Theory 1978 24 3 339 348

10.1109/TIT.1978.1055892

Leung-Yan-Cheong

S. K.

Hellman

M. E.

The Gaussian wire-tap channel

IEEE Transactions on Information Theory 1978 24 4 451 456

10.1109/tit.1978.1055917

MR0504361

Gopala

P. K.

Lai

El Gamal

On the secrecy capacity of fading channels

IEEE Transactions on Information Theory 2008 54 10 4687 4698

10.1109/tit.2008.928990

MR2591128

2-s2.0-54749106691

Zou

Wang

Shen

Optimal relay selection for physical-layer security in cooperative wireless networks

IEEE Journal on Selected Areas in Communications 2013 31 10 2099 2111

10.1109/jsac.2013.131011

2-s2.0-84884537599

Yang

Wang

Cooperative transmission for security enhancement in clustered wireless sensor networks

International Journal of Distributed Sensor Networks 2015 2015 7

751456

10.1155/2015/751456

2-s2.0-84937000766

Dong

Han

Petropulu

A. P.

Poor

H. V.

Improving wireless physical layer security via cooperating relays

IEEE Transactions on Signal Processing 2009 58 3 1875 1888

10.1109/TSP.2009.2038412

Wang

H.-M.

Yin

Wang

Xia

X.-G.

Joint null-space beamforming and jamming to secure af relay systems with individual power constraint

Proceedings of the 38th IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP '13)

May 2013

Vancouver, Canada

2911 2914

10.1109/icassp.2013.6638190

2-s2.0-84890524371

Wang

Zhang

X.-D.

Secure relay beamforming with imperfect channel side information

IEEE Transactions on Vehicular Technology 2013 62 5 2140 2155

10.1109/tvt.2012.2230657

2-s2.0-84879149313

10.

Wang

H.-M.

Yin

Xia

X.-G.

Distributed beamforming for physical-layer security of two-way relay networks

IEEE Transactions on Signal Processing 2012 60 7 3532 3545

10.1109/tsp.2012.2191543

MR2943256

2-s2.0-84862635573

11.

Chen

H.-H.

Physical layer security in multi-cell MISO downlinks with incomplete CSI—a unified secrecy performance analysis

IEEE Transactions on Signal Processing 2014 62 23 6286 6297

10.1109/tsp.2014.2362890

MR3281523

2-s2.0-84910151930

12.

Wang

H.-M.

Zheng

Xia

X.-G.

Secure MISO wiretap channels with multiantenna passive eavesdropper: artificial noise vs. artificial fast fading

IEEE Transactions on Wireless Communications 2015 14 1 94 106

10.1109/twc.2014.2332164

2-s2.0-84921405314

13.

Havary-Nassab

Shahbazpanahi

Grami

Luo

Z.-Q.

Distributed beamforming for relay networks based on second-order statistics of the channel state information

IEEE Transactions on Signal Processing 2008 56 9 4306 4316

10.1109/tsp.2008.925945

MR2517178

2-s2.0-65449132856

14.

Mudumbai

Brown

D. R.

III Madhow

Poor

H. V.

Distributed transmit beamforming: challenges and recent progress

IEEE Communications Magazine 2009 47 2 102 110

10.1109/mcom.2009.4785387

2-s2.0-62149087803

15.

Jing

Jafarkhani

Network beamforming using relays with perfect channel information

IEEE Transactions on Information Theory 2009 55 6 2499 2517

10.1109/tit.2009.2018175

MR2598384

2-s2.0-66949167419

16.

Lin

P.-H.

Lai

S.-H.

Lin

S.-C.

H.-J.

On secrecy rate of the generalized artificial-noise assisted secure beamforming for wiretap channels

IEEE Journal on Selected Areas in Communications 2013 31 9 1728 1740

10.1109/jsac.2013.130907

2-s2.0-84883698532

17.

Baldi

Chiaraluce

Laurenti

Tomasin

Renna

Secrecy transmission on parallel channels: theoretical limits and performance of practical codes

IEEE Transactions on Information Forensics and Security 2014 9 11 1765 1779

10.1109/tifs.2014.2348915

2-s2.0-84907528055

18.

Cui

Goldsmith

A. J.

Bahai

Energy-efficiency of MIMO and cooperative MIMO techniques in sensor networks

IEEE Journal on Selected Areas in Communications 2004 22 6 1089 1098

10.1109/jsac.2004.830916

2-s2.0-4344710765

19.

Jayaweera

S. K.

Virtual MIMO-based cooperative communication for energy-constrained wireless sensor networks

IEEE Transactions on Wireless Communications 2006 5 5 984 989

10.1109/TWC.2006.1633350

2-s2.0-33744745602

20.

Zhou

Cui

J.-H.

Energy-efficient cooperative communication in a clustered wireless sensor network

IEEE Transactions on Vehicular Technology 2008 57 6 3618 3628

10.1109/tvt.2008.918730

2-s2.0-57049085115

21.

Marshall

Olkin

Arnold

Inequalities: Theory of Majorization and Its Applications 1979 2nd

New York, NY, USA

Academic Press

22.

Gradshteyn

I. S.

Ryzhik

I. M.

Table of Integrals, Series, and Products 2007 7th

San Diego, Calif, USA

Elsevier

Edity by A. Jeffrey and D. Zwillinger