On the energy-delay tradeoff and relay positioning of wireless butterfly networks

This paper considers energy-delay tradeoff (EDT) of data transmission in wireless network coded butterfly networks (WNCBNs) where two sources convey their data to two destinations with the assistance of a relay employing either physical-layer network coding (PNC) or analog network coding (ANC). Hybrid automatic repeat request with incremental redundancy (HARQIR) is applied for a reliable communication. Particularly, we first investigate the EDT of both PNC and ANC schemes in WNCBNs to evaluate their energy efficiency. It is found that there is no advantage of using a relay in a high power regime. However, in a low power regime, the PNC scheme is shown to be more energy efficient than both the ANC and direct transmission (DT) schemes if the relay is located far from the sources, while both the PNC and ANC schemes are less energy efficient than the DT scheme when the relay is located near the sources. Additionally, algorithms that optimise relay positioning are developed based on two criteria - minimising total transmission delays and minimising total energy consumption subject to node location and power allocation constraints. This optimisation can be considered as a benchmark for relay positioning in either a low-latency or a low-energy-consumption WNCBN

On the energy-delay tradeoff and relay positioning of wireless butterfly networks

This paper considers energy-delay tradeoff (EDT) of data transmission in wireless network coded butterfly networks (WNCBNs) where two sources convey their data to two destinations with the assistance of a relay employing either physical-layer network coding (PNC) or analog network coding (ANC). Hybrid automatic repeat request with incremental redundancy (HARQIR) is applied for a reliable communication. Particularly, we first investigate the EDT of both PNC and ANC schemes in WNCBNs to evaluate their energy efficiency. It is found that there is no advantage of using a relay in a high power regime. However, in a low power regime, the PNC scheme is shown to be more energy efficient than both the ANC and direct transmission (DT) schemes if the relay is located far from the sources, while both the PNC and ANC schemes are less energy efficient than the DT scheme when the relay is located near the sources. Additionally, algorithms that optimise relay positioning are developed based on two criteria - minimising total transmission delays and minimising total energy consumption subject to node location and power allocation constraints. This optimisation can be considered as a benchmark for relay positioning in either a low-latency or a low-energy-consumption WNCBN

Cooperative Strategies for Simultaneous and Broadcast Relay Channels

Consider the \emph{simultaneous relay channel} (SRC) which consists of a set of relay channels where the source wishes to transmit common and private information to each of the destinations. This problem is recognized as being equivalent to that of sending common and private information to several destinations in presence of helper relays where each channel outcome becomes a branch of the \emph{broadcast relay channel} (BRC). Cooperative schemes and capacity region for a set with two memoryless relay channels are investigated. The proposed coding schemes, based on \emph{Decode-and-Forward} (DF) and \emph{Compress-and-Forward} (CF) must be capable of transmitting information simultaneously to all destinations in such set. Depending on the quality of source-to-relay and relay-to-destination channels, inner bounds on the capacity of the general BRC are derived. Three cases of particular interest are considered: cooperation is based on DF strategy for both users --referred to as DF-DF region--, cooperation is based on CF strategy for both users --referred to as CF-CF region--, and cooperation is based on DF strategy for one destination and CF for the other --referred to as DF-CF region--. These results can be seen as a generalization and hence unification of previous works. An outer-bound on the capacity of the general BRC is also derived. Capacity results are obtained for the specific cases of semi-degraded and degraded Gaussian simultaneous relay channels. Rates are evaluated for Gaussian models where the source must guarantee a minimum amount of information to both users while additional information is sent to each of them.Comment: 32 pages, 7 figures, To appear in IEEE Trans. on Information Theor