Performance Analysis of Reliability Filling on Quasi-Static Fading Channels

Abstract-Cooperative communication techniques are network-based approaches to achieve spatial diversity in systems in which each node only has a single antenna. Many such techniques are based on relaying, which is effective in terms of error performance but requires a large information exchange among the cooperating nodes. Cooperative reception techniques that offer near-optimal performance with a smaller information exchange are an area of ongoing research. One promising approach is to investigate combining techniques that can be used as a model for designing efficient cooperative reception schemes. In this paper, we consider one such technique, called reliability filling, that combines only as much information as needed to meet some reliability threshold. We analyze the performance of this technique for several scenarios of interest. Analytical estimates of the overhead involved in reliability filling are also given. Analysis and simulation results show that reliability filling can offer performance close to maximal-ratio combining while combining fewer symbols

Cascade decode-and-forward : spatial diversity reuse in sensor networks

In this paper, we consider a wireless sensor network that involves sensory data hoping through multiple wireless relays to reach a central collection hub. In particular we improve the decode-and-forward cooperative relaying scheme. In this paper, we propose the Cascade-Decode-and-Forward, where the number of successful relays increases with each additional cooperation stage. The achieved effect is a cascade of relays that contribute towards achieving full spatial diversity at the destination. A novel relationship between the achievable bit error rate and delay is derived for the proposed scheme. The results show that a small delay constraint relaxation, the proposed scheme can achieve full diversity. As the delay constraint relaxes further, the protocol can achieve full diversity at signals levels 10–100 orders magnitude lower than the decode-and-forward protocol. The proposed protocol can dynamically trade-off transmission reliability with delay and the analysis has shown that a certain node connectivity density is required to achieve a cascading cooperation chain with an arbitrarily low data extinction probability

Ultra-Reliable Short Message Cooperative Relaying Protocols under Nakagami-m Fading

In the next few years, the development of wireless communication systems propel the world into a fully connected society where the Machine-type Communications (MTC) plays a substantial role as key enabler in the future cellular systems. MTC is categorized into mMTC and uMTC, where mMTC provides the connectivity to massive number of devices while uMTC is related to low latency and ultra-high reliability of the wireless communications. This paper studies uMTC with incremental relaying technique, where the source and relay collaborate to transfer the message to a destination. In this paper, we compare the performance of two distinct cooperative relaying protocols with the direct transmission under the finite blocklength (FB) regime. We define the overall outage probability in each relaying scenario, supposing Nakagami-m fading. We show that cooperative communication outperforms direct transmission under the FB regime. In addition, we examine the impact of fading severity and power allocation factor on the outage probability and the minimum delay required to meet the ultra-reliable communication requirements. Moreover, we provide the outage probability in closed form