Open AccessSecure Connectivity Probability of Multi‐hop Clustered Randomize‐and‐Forward Networks
Author(s) -
Wang Xiaowei,
Su Zhou,
Wang Guangyi
Publication year - 2017
Publication title -
etri journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.295
H-Index - 46
eISSN - 2233-7326
pISSN - 1225-6463
DOI - 10.4218/etrij.17.0117.0199
Subject(s) - hop (telecommunications) , relay , computer science , computer network , outage probability , channel (broadcasting) , power (physics) , physics , quantum mechanics , fading
This work investigates secure cluster‐aided multi‐hop randomize‐and‐forward networks. We present a hop‐by‐hop multi‐hop transmission scheme with relay selection, which evaluates for each cluster the relays that can securely receive the message. We propose an analytical model to derive the secure connectivity probability ( SCP ) of the hop‐by‐hop transmission scheme. For comparison, we also analyze SCP s of traditional end‐to‐end transmission schemes with two relay‐selection policies. We perform simulations, and our analytical results verify that the proposed hop‐by‐hop scheme is superior to end‐to‐end schemes, especially with a large number of hops or high eavesdropper channel quality. Numerical results also show that the proposed hop‐by‐hop scheme achieves near‐optimal performance in terms of the SCP .