While buffer-aided relaying improves the diversity of a multi-hop network, its deployment introduces time-delays, thus rendering buffering unreliable for delay-intolerant applications. To alleviate excessive delays, various studies propose delayaware protocols, but at the expense of reduced diversity, and consequently, increased outage probability. Attempts to maintain the diversity of the system while trying to reduce delays, however, may lead to even higher delays, especially in asymmetric topologies. In this work, we propose a Low-Complexity (LoCo) link selection algorithm, herein called LoCo - Link, that aims at reducing packet delays and enhancing the performance of practical asymmetric two-hop networks. The complexity of LoCo - Link is derived and compared with other state-of-the-art relay selection policies. The performance of the proposed algorithm is evaluated in terms of outage probability, average throughput and average delay, focusing on scenarios with asymmetric links.
|Title of host publication||IEEE International Conference on Communications, ICC 2017|
|Number of pages||6|
|Publication status||Published - 30 Jun 2017|
|MoE publication type||A4 Article in a conference publication|
|Event||IEEE International Conference on Communications - Paris, France|
Duration: 21 May 2017 → 25 May 2017
|Name||IEEE International Conference on Communications|
|Conference||IEEE International Conference on Communications|
|Period||21/05/2017 → 25/05/2017|
- Relay selection
- buffer-aided relaying
- asymmetric links
- Markov chains
Nomikos, N., Charalambous, T., Vouyioukas, D., & Karagiannidis, G. K. (2017). LoCo-Link: A Low-Complexity Link Selection Algorithm for Delay Mitigation in Asymmetric Two-Hop Networks. In IEEE International Conference on Communications, ICC 2017 (IEEE International Conference on Communications). IEEE.