3.1 Selection criterion
As is mentioned above, a single source-relay pair is selected for any frame transmission. According to the principle of the AF protocol and the considered system model, the k th (1 ≤ k ≤ K) source’s received SNR at the destination, with the help of the m th (1 ≤ m ≤ M) relay, can be expressed as
where and are the instantaneous received SNR at the m th relay from the k th source and at the destination from the m th relay, respectively.
Similarly, the received SNR at the eavesdropper can be calculated as well by simply replacing in (1) by, where is the instantaneous SNR of the link R
→ D. Therefore, the instantaneous secrecy rate, defined as the difference between the achievable rate of the source-destination link and that of the source-eavesdropper link, can be formulated as
where [x]+ = max(0,x). In order to minimize the secrecy outage probability, defined as the probability that the instantaneous secrecy rate falls below a target secrecy rate, our criterion is to select such a source-relay pair (k∗,m∗) that can maximize the secrecy rate in (2). That is,
With this criterion, the achievable secrecy outage probability can be expressed as
where RS represents the target secrecy rate, and. Since RS is positive, v should be larger than 1.
If the global CSI is available at some node, e.g., the RSU, the criterion in (3) can be implemented in a centralized manner. However, it is non-trivial to obtain the CSI of all the involved links, especially for the networks with a large number of nodes. This motivates us to develop the distributed algorithm with low complexity, the details of which will be given in the next subsection.
3.2 Low-complexity distributed scheme
The proposed low-complexity design is based on the observation of (3), which tells us that the achievable secrecy rate is determined by, the maximum of’s. According to the selection criterion in Sect. III. A, can also be viewed as, where is defined as
With the above observation in mind, we can divide the overall selection procedure into three steps. First, every relay node independently evaluates its eligibility for cooperation. After that, each eligible relay selects an appropriate source to maximize its contribution to the achievable secrecy rate. In this way, all the candidate source-relay pairs are generated. Finally, a single pair with the maximum is screened out from the candidate pairs to access the channel. The details of these steps are given in the following:
Step 1: Generating the Set of Eligible Relays. For any relay node R
, it can be deduced from (3) that if, then will be less than 1, irrespective of the source index k. In other words, the system will be in outage if this relay node is selected to access the channel, no matter which source is chosen to form the pair.
Further, when, the secrecy outage probability, with R
being the selected relay, can be expressed as
where (a) stems from the fact that for a < b. If, we have and. Therefore, the probability provided by (6) equals to 1, implying that the outage event definitely occurs if we choose such a relay to cooperate.
Summarizing the discussions above, we can conclude that to support the target secrecy rate, the selected relay has to satisfy the following condition:
In other words, if the channel gains regarding R
does not meet (7), R
cannot be selected. In steps 2 and 3, we will only focus on the eligible relays satisfying (7).
It should be emphasized that the eligibility determination process requires the knowledge of and at R
. However, this can be guaranteed because we have assumed that both the RSU and the eavesdropper are active entities which will transmit control information or messages, and the corresponding channel gains can be estimated at the relays using the pilots from the received signals.
Step 2: Source Selection at Eligible Relays. After step 1 has been finished, all the relays satisfying (7) broadcast flag signals to declare its eligibility for cooperation. Upon receiving the flag signals, all the sources will send an ACK to respond. With the received ACKs, any eligible relay R
can estimate for all k s. After that, R
supposes itself to be the selected relay and chooses the ‘best’ source which can contribute most to. To elaborate on how to find such a source node, a lemma will be introduced first.
Lemma 1. The function
where γ1and γ2are two constants with γ1being larger than γ2, is an increasing function of γ.
Proof. By taking the derivative of f(γ) with respect to γ, we can obtain
which is obviously larger than 0 for γ1 > γ2. Therefore, f(γ) is an increasing function of γ. □
Based on this lemma, the ‘best’ source for R
, i.e.,, should be the one with the following property:
It is no doubted that step 2 also enjoys a distributed implementation since the source selection is performed at the eligible relays, and there is no information exchange among different relay nodes.
To select the optimal source-relay pair, we adopt the method based on the distributed timer. Specifically, after calculating, each eligible relay R
will start its timer with the initial value inversely proportional to. Therefore, the relay with the largest, namely, has its timer expired first. then broadcasts the flag signal and the rest of the relays will back off after receiving the flag signal. Noticing the fact that the ‘best’ source for has already been determined to be in step 2, we now have the selected source-relay pair.
Remark 1. The proposed source-relay selection scheme has two advantages. First, it can be realized in a distributed way, yielding a low implementation complexity. This is of practical significance for vehicular networks. Second, the distributed method, despite of its simplicity, is an optimal solution in the sense that it can select the ‘best’ source-relay pair to minimize the system secrecy outage probability.