Buffer-aided relays can improve the diversity of multi-hop networks, however, they increase packet delays. Thus, various delay-aware protocols have been developed, but without considering the transmission diversity. Moreover, most works adopt ideal assumptions, such as symmetric links, perfect Channel State Information (CSI) and error-free feedback channels. So, we propose a Low-Complexity (LoCo) link selection algorithm, herein called LoCo - Link. The proposed algorithm may experience delays during CSI updates, and hence, by using outdated CSI its performance may deteriorate. To alleviate this issue, we next propose a distributed version of LoCo - Link (d - LoCo - Link) dealing with outdated CSI. In both algorithms, the source performs broadcasting towards multiple relays; when the packets are transmitted by a relay to the destination, they are discarded from all other relays. This coordination relies on feedback channels. For non error-free feedback channels, we propose a scheme in which the relays listen to the transmission of the best relay and drop duplicate packets. Results show that LoCo - Link surpasses other algorithms, by decreasing the delay in asymmetric networks. Moreover, d - LoCo - Link avoids diversity losses due to outdated CSI, while the effect of non error-free feedback channels is mitigated by taking advantage of the inter-relay channels.
|Sivut||3694 - 3706|
|Julkaisu||IEEE Transactions on Communications|
|Varhainen verkossa julkaisun päivämäärä||29 maaliskuuta 2018|
|DOI - pysyväislinkit|
|Tila||Julkaistu - elokuuta 2018|
|OKM-julkaisutyyppi||A1 Julkaistu artikkeli, soviteltu|