z-logo
open-access-imgOpen Access
On the design of relay selection strategy for two‐way amplify‐and‐forward mobile relaying
Author(s) -
Xia Xiaochen,
Xu Kui,
Ma Wenfeng,
Xu Youyun
Publication year - 2013
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2013.0168
Subject(s) - relay , computer science , outage probability , channel state information , fading , selection (genetic algorithm) , linear network coding , coding (social sciences) , diversity gain , cooperative diversity , channel (broadcasting) , computer network , diversity combining , topology (electrical circuits) , telecommunications , wireless , mathematics , statistics , artificial intelligence , power (physics) , physics , quantum mechanics , combinatorics , network packet
Opportunistic relay selection (RS) is an efficient method to obtain diversity gain in analogue network coding (ANC) protocol with multiple relays. However, in networks with mobile relays, the channel state information (CSI) used in the RS procedure becomes outdated because of the time‐varying nature of fading channels, which severely deteriorates the system performance. In this study, the authors study the RS strategy which aims to optimise the outage performance of the ANC protocol with multiple mobile relays. RS schemes for two different cases are designed, that is, (i) the scheme with only the outdated CSI during the RS procedure, and (ii) the scheme with both the outdated CSI and the statistical knowledge of channels during the RS procedure. The closed‐form expressions of the outage probabilities as well as the asymptotic expressions are analytically derived for the proposed schemes, and moreover, the achievable diversities are analysed based on the asymptotic expressions. Simulation results are presented to evaluate the performances while validate the theoretical analyses for the proposed schemes.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here