A probabilistic retransmission protocol on a relaying network

Abstract

Relaying protocols are usually deterministic, i.e. they commute from one action to the next one in a predefined manner, depending on the success of the transmission. This paper demonstrates the advantages that probabilistic protocols (i.e. the next action to be undertaken depends on some probability) may have in this context. The whole study is performed on a simple sourcerelay-destination network, the relay working in demodulate and forward mode, in order to obtain insights on the interaction between relaying and HARQ. So far, probabilistic protocols have been mainly proposed for higher layers of communication systems, but are applied here to physical and MAC layers. Since it contains only two parameters, we demonstrate that our probabilistic protocol can easily be tuned for best performance using a Finite State Markov Chain (FSMC), and that it brings improvement over deterministic protocols in the same scenario.

A Probabilistic HARQ Protocol for Demodulate-and-Forward Relaying Networks

“…Another example is found in [12] where the communication is based on an algorithm that precomputes the probability that the communication is possible between a specified source and the destination. In contrast, expanding on ideas presented by the authors in [13], this paper proposes the use of a probabilistic protocol at the physical and MAC layers, and proposes a careful performance analysis and optimization. It has to be noted that the rather involved analysis is required only for performance optimization, and that the decoding algorithm remains unchanged with respect to classical deterministic protocols.…”