We consider a half-duplex wireless relay network with hybrid-automatic retransmission request (HARQ) and Rayleigh fading channels. In this paper, we analyze the outage probability of the multi-relay delay-limited HARQ system with opportunistic relaying scheme in decode-and-forward mode, in which the \emph{best} relay is selected to transmit the source's regenerated signal. A simple and distributed relay selection strategy is proposed for multi-relay HARQ channels. Then, we utilize the non-orthogonal cooperative transmission between the source and selected relay for retransmitting of the source data toward the destination if needed, using space-time codes or beamforming techniques. We analyze the performance of the system. We first derive the cumulative density function (CDF) and probability density function (PDF) of the selected relay HARQ channels. Then, the CDF and PDF are used to determine the outage probability in the $l$-th round of HARQ. The outage probability is required to compute the throughput-delay performance of this half-duplex opportunistic relaying protocol. The packet delay constraint is represented by $L$, the maximum number of HARQ rounds. An outage is declared if the packet is unsuccessful after $L$ HARQ rounds. Furthermore, closed-form upper-bounds on outage probability are derived and subsequently are used to investigate the diversity order of the system. Based on the derived upper-bound expressions, it is shown that the proposed schemes achieve the full spatial diversity order of $N+1$, where $N$ is the number of potential relays. Our analytical results are confirmed by simulation results.
This paper investigates the performance of relay networks in the presence of hybrid automatic repeat request (ARQ) feedback and adaptive power allocation. The throughput and the outage probability of different hybrid ARQ protocols are studied for independent and spatially-correlated fading channels. The results are obtained for the cases where there is a sum power constraint on the source and the relay or when each of the source and the relay are power-limited individually. With adaptive power allocation, the results demonstrate the efficiency of relay-ARQ techniques in different conditions.
In this paper, novel cooperative automatic repeat request (ARQ) methods with network coding are proposed for two way relaying network. Upon a failed transmission of a packet, the network enters cooperation phase, where the retransmission of the packets is aided by the relay node. The proposed approach integrates network coding into cooperative ARQ, aiming to improve the network throughput by reducing the number of retransmissions. For successive retransmission, three different methods for choosing the retransmitting node are considered. The throughput of the methods are analyzed and compared. …
This paper presents a cross-layer approach to jointly design adaptive modulation and coding (AMC) at the physical layer and cooperative truncated automatic repeat request (ARQ) protocol at the data link layer. We first derive an exact closed form expression for the spectral efficiency of the proposed joint AMC-cooperative ARQ scheme. Aiming at maximizing this system performance measure, we then optimize an AMC scheme which directly satisfies a prescribed packet loss rate constraint at the data-link layer. The results indicate that utilizing cooperative ARQ as a retransmission strategy, noticea…
The cooperative automatic repeat request (C-ARQ) is a link layer relaying protocol which exploits the spatial diversity and allows the relay node to retransmit the source data packet to the destination, when the latter is unable to decode the source data correctly. This paper presents a cross-layer link adaptation design for C-ARQ based relay channels in which both source and relay nodes employ adaptive modulation coding and power adaptation at the physical layer. For this scenario, we first derive closed-form expressions for the system spectral efficiency and average power consumption. We the…
In a cooperative relay network, a relay node (R) facilitates data transmission to the destination node (D), when the latter is unable to decode the source node (S) data correctly. This paper considers such a system model and presents a cross-layer approach to jointly design adaptive modulation and coding (AMC) at the physical layer and cooperative truncated automatic repeat request (ARQ) protocol at the data link layer. We first derive a closed form expression for the spectral efficiency of the joint cooperative ARQ-AMC scheme. Aiming at maximizing this performance measure, we then optimize tw…
This paper develops a contention-based opportunistic feedback technique towards relay selection in a dense wireless network. This technique enables the forwarding of additional parity information from the selected relay to the destination. For a given network, the effects of varying key parameters such as the feedback probability are presented and discussed. A primary advantage of the proposed technique is that relay selection can be performed in a distributed way. Simulation results find its performance to closely match that of centralized schemes that utilize GPS information, unlike the prop…
In this paper, we study the performance of the downlink of a cellular network with automatic repeat-request (ARQ) and a half duplex decode-and-forward shared relay. In this system, two multiple-input-multiple-output (MIMO) base stations serve two single antenna users. A MIMO shared relay retransmits the lost packets to the target users. First, we study the system with direct retransmission from the base station and derive a closed form expression for the outage probability of the system.We show that the direct retransmission can overcome the fading, however, it cannot overcome the interference…
This paper presents a decentralized relay selection protocol for a dense wireless network and describes channel feedback strategies that improve its performance. The proposed selection protocol supports hybrid automatic-repeat-request transmission where relays forward parity information to the destination in the event of a decoding error. Channel feedback is employed for refining the relay selection process and for selecting an appropriate transmission mode in a proposed adaptive modulation transmission framework. An approximation of the throughput of the proposed adaptive modulation strategy …
This paper addresses robust communication on a fading relay channel in which the relay is connected to the decoder via an out-of-band digital link of limited capacity. Both the source-to-relay and the source-to-destination links are subject to fading gains, which are generally unknown to the encoder prior to transmission. To overcome this impairment, a hybrid automatic retransmission request (HARQ) protocol is combined with multi-layer broadcast transmission, thus allowing for variable-rate decoding. Moreover, motivated by cloud radio access network applications, the relay operation is limited…
In this paper, the average successful throughput, i.e., goodput, of a coded 3-node cooperative network is studied in a Rayleigh fading environment. It is assumed that a simple automatic repeat request (ARQ) technique is employed in the network so that erroneously received codeword is retransmitted until successful delivery. The relay is assumed to operate in either amplify-and-forward (AF) or decode-and-forward (DF) mode. Under these assumptions, retransmission mechanisms and protocols are described, and the average time required to send information successfully is determined. Subsequently, th…
This paper studies the problem of relay-assisted user scheduling for downlink wireless transmission. The base station or access point employs hybrid automatic-repeat-request (HARQ) with the assistance of a set of fixed relays to serve a set of mobile users. By minimizing a cost function of the queue lengths at the base station and the number of retransmissions of the head-of-line packet for each user, the base station can schedule an appropriate user in each time slot and an appropriate transmitter to serve it. It is shown that a priority-index policy is optimal for a linear cost function with…
In this paper, we consider a three node relay network comprising a source, a relay, and a destination. The source transmits the message to the destination using hybrid automatic repeat request (HARQ) with incremental redundancy (IR). The relay overhears the transmitted message, amplifies it using a variable gain amplifier, and then forwards the message to the destination. This latter combines both the source and the relay message and tries to decode the information. In case of decoding failure, the destination sends a negative acknowledgement. A new replica of the message containing new parity…
Inspired by several delay-bounded mission-critical applications, this paper investigates chase-combining-based hybrid automatic repeat request (CC-HARQ) protocols to achieve high reliability in delay-constrained applications. A salient feature of our approach is to use the end-to-end delay constraint for computing the total number of ARQs permitted in the network, and then optimally distributing them across the nodes so as to minimize packet-drop-probability (PDP), which is the end-to-end reliability metric of interest. Since the chase-combining strategy combines the received packets across mu…
The performance of the automatic repeat request-dynamic decode and forward (ARQ-DDF) cooperation protocol is analyzed in two distinct scenarios. The first scenario is the multiple access relay (MAR) channel where a single relay is dedicated to simultaneously help several multiple access users. For this setup, it is shown that the ARQ-DDF protocol achieves the optimal diversity multiplexing tradeoff (DMT) of the channel. The second scenario is the cooperative vector multiple access (CVMA) channel where the users cooperate in delivering their messages to a destination equipped with multiple rece…
Tradeoff in diversity, multiplexing, and delay in multihop MIMO relay networks with ARQ is studied, where the random delay is caused by queueing and ARQ retransmission. This leads to an optimal ARQ allocation problem with per-hop delay or end-to-end delay constraint. The optimal ARQ allocation has to trade off between the ARQ error that the receiver fails to decode in the allocated maximum ARQ rounds and the packet loss due to queueing delay. These two probability of errors are characterized using the diversity-multiplexing-delay tradeoff (DMDT) (without queueing) and the tail probability of r…
Automatic Repeat Request (ARQ) is an effective technique for reliable transmission of packets in wireless networks. In ARQ, however, only a few erroneous bits in a packet will cause the entire packet to be discarded at the receiver. In this case, it's wasteful to retransmit the correct bit in the received packet. The partial packet recovery only retransmits the unreliable decoded bits in order to increase the throughput of network. In addition, the cooperative transmission based on Interleave-division multiple-access (IDMA) can obtain diversity gains with multiple relays with different locatio…
Relay networks aid in increasing the rate of communication from source to destination. However, the capacity of even a three-terminal relay channel is an open problem. In this work, we propose a new lower bound for the capacity of the three-terminal relay channel with destination-to-source feedback in the presence of correlated noise. Our lower bound improves on the existing bounds in the literature. We then extend our lower bound to general relay network configurations using an arbitrary number of filter-and-forward relay nodes. Such network configurations are common in many multi-hop communi…
This paper investigates the information freshness of two-way relay networks (TWRN) operated with physical-layer network coding (PNC). Information freshness is quantified by age of information (AoI), defined as the time elapsed since the generation time of the latest received information update. PNC reduces communication latency of TWRNs by turning superimposed electromagnetic waves into network-coded messages so that end users can send update packets to each other via the relay more frequently. Although sending update packets more frequently is potential to reduce AoI, how to deal with packet …
We analyze the performance of amplify-and-forward (AF) automatic repeat request (ARQ) for a two-hop cooperative system with reliability constrains. For this setup, we first derive the closed-form outage probability expression. Next, we present a power allocation scheme that allows us to achieve a target outage probability, while minimizing the outage-weighted average power expenditure for asymmetric power allocation between the source and relay. This is cast as an optimization problem, and the optimal power allocation (OPA) is obtained in closed form by invoking the Karush-Kuhn-Tucker (KKT) co…
Cooperative hybrid-ARQ (HARQ) protocols, which can exploit the spatial and temporal diversities, have been widely studied. The efficiency of cooperative HARQ protocols is higher than that of cooperative protocols, because retransmissions are only performed when necessary. We classify cooperative HARQ protocols as three decode-and-forward based HARQ (DF-HARQ) protocols and two amplified-and-forward based (AF-HARQ) protocols. To compare these protocols and obtain the optimum parameters, two unified frameworks are developed for protocol analysis. Using the frameworks, we can evaluate and compare …
In this paper, the throughput of relay networks with multiple source-destination pairs under queueing constraints has been investigated for both variable-rate and fixed-rate schemes. When channel side information (CSI) is available at the transmitter side, transmitters can adapt their transmission rates according to the channel conditions, and achieve the instantaneous channel capacities. In this case, the departure rates at each node have been characterized for different system parameters, which control the power allocation, time allocation and decoding order. In the other case of no CSI at t…
It has been shown that a decentralized relay selection protocol based on opportunistic feedback from the relays yields good throughput performance in dense wireless networks. This selection strategy supports a hybrid-ARQ transmission approach where relays forward parity information to the destination in the event of a decoding error. Such an approach, however, suffers a loss compared to centralized strategies that select relays with the best channel gain to the destination. This paper closes the performance gap by adding another level of channel feedback to the decentralized relay selection pr…
In this paper, we consider an automatic-repeat-request (ARQ) retransmission protocol signaling over a block-fading multiple-input, multiple-output (MIMO) channel. Unlike previous work, we allow for multiple fading blocks within each transmission (ARQ round), and we constrain the transmitter to fixed rate codes constructed over complex signal constellations. In particular, we examine the general case of average input-power-constrained constellations as well as the practically important case of finite discrete constellations. This scenario is a suitable model for practical wireless communication…
In this paper, we investigate the outage performance of hybrid automatic repeat request with chase combining (HARQ-CC) assisted downlink non-orthogonal multiple access (NOMA) systems. A closed-form expression of the individual outage probability and the diversity gain are obtained firstly. Based on the developed analytical outage probability, a tradeoff between the minimum number of retransmissions and the transmit power allocation coefficient is then provided for a given target rate. The provided simulation results demonstrate the accuracy of the developed analytical results. Moreover, it is …
In this paper, we consider high-speed wireless packet access using code division multiple access (CDMA) and multiple-input multiple-output (MIMO). Current wireless standards, such as high speed packet access (HSPA), have adopted multi-code transmission and hybrid-automatic repeat request (ARQ) as major technologies for delivering high data rates. The key technique in hybrid-ARQ, is that erroneous data packets are kept in the receiver to detect/decode retransmitted ones. This strategy is refereed to as packet combining. In CDMA MIMO-based wireless packet access, multi-code transmission suffers …
The class of orthogonal relay channels in which the orthogonal channels connecting the source terminal to the relay and the destination, and the relay to the destination, depend on a state sequence, is considered. It is assumed that the state sequence is fully known at the destination while it is not known at the source or the relay. The capacity of this class of relay channels is characterized, and shown to be achieved by the partial decode-compress-and-forward (pDCF) scheme. Then the capacity of certain binary and Gaussian state-dependent orthogonal relay channels are studied in detail, and …
We consider a relay channel for which the following assumptions are made. (1) The source-destination and relay-destination channels are orthogonal (frequency division relay channel). (2) The relay implements the decode-and-forward protocol. (3) The source and relay implement the same channel encoder, namely, a onvolutional encoder. (4) They can use arbitrary and possibly different modulations. In this framework, we derive the best combiner in the sense of the maximum likelihood (ML) at the destination and the branch metrics of the trellis associated with its channel decoder for the ML combiner…
Distributed space-time block coding is a diversity technique to mitigate the effects of fading in multi-hop wireless networks, where multiple relay stages are used by a source to communicate with its destination. This paper proposes a new distributed space-time block code called the cascaded orthogonal space-time block code (COSTBC) for the case where the source and destination are equipped with multiple antennas and each relay stage has one or more single antenna relays. Each relay stage is assumed to have receive channel state information (CSI) for all the channels from the source to itself,…
We consider a wireless relay network with one source, one relay and one destination, where communications between nodes are preformed via N orthogonal channels. This, for example, is the case when orthogonal frequency division multiplexing is employed for data communications. Since the power available at the source and relay is limited, we study optimal power allocation strategies at the source and relay in order to maximize the overall source-destination capacity under individual power constraints at the source and/or the relay. Depending on the availability of the channel state information a…
The problem of resource allocation is studied for a two-user fading orthogonal multiaccess relay channel (MARC) where both users (sources) communicate with a destination in the presence of a relay. A half-duplex relay is considered that transmits on a channel orthogonal to that used by the sources. The instantaneous fading state between every transmit-receive pair in this network is assumed to be known at both the transmitter and receiver. Under an average power constraint at each source and the relay, the sum-rate for the achievable strategy of decode-and-forward (DF) is maximized over all po…
This paper addresses network code design for robust transmission of sources over an orthogonal two-hop wireless network with a broadcasting relay. The network consists of multiple sources and destinations in which each destination, benefiting the relay signal, intends to decode a subset of the sources. Two special instances of this network are orthogonal broadcast relay channel and the orthogonal multiple access relay channel. The focus is on complexity constrained scenarios, e.g., for wireless sensor networks, where channel coding is practically imperfect. Taking a source-channel and network …
This paper is on relay selection in uplink of an in-band full-duplex (IBFD) cooperative cellular network. Assuming an orthogonal frequency division multiple access (OFDMA) cellular network, we develop a relay selection and resource allocation algorithm for this network. The relay selection algorithms select the best relay based on distance between users and signal to interference plus noise ratio (SINR) that operate in amplify and forward (AF) mode. The optimization problem allocates the optimum subcarriers and powers to all users to maximize the average sum-rate of the network. In addition, t…
To improve the sum-rate (SR) of the dual-hop relay system, a novel two-stage power allocation scheme with non-orthogonal multiple access (NOMA) is proposed. In this scheme, after the reception of the superposition coded symbol with a power allocation from the source, the relay node forwards a new superposition coded symbol with another power allocation to the destination. By employing the maximum ratio combination (MRC), the destination jointly decodes the information symbols from the source and the relay. Assuming Rayleigh fading channels, closed-form solution of the ergodic SR at high signal…
The secrecy capacity of relay channels with orthogonal components is studied in the presence of an additional passive eavesdropper node. The relay and destination receive signals from the source on two orthogonal channels such that the destination also receives transmissions from the relay on its channel. The eavesdropper can overhear either one or both of the orthogonal channels. Inner and outer bounds on the secrecy capacity are developed for both the discrete memoryless and the Gaussian channel models. For the discrete memoryless case, the secrecy capacity is shown to be achieved by a parti…
Distributed Space-Time Block Codes (DSTBCs) from Complex Orthogonal Designs (CODs) (both square and non-square CODs other than the Alamouti design) are known to lose their single-symbol ML decodable (SSD) property when used in two-hop wireless relay networks using amplify and forward protocol. For such a network, in this paper, a new class of high rate, training-embedded (TE) SSD DSTBCs are constructed from TE-CODs. The proposed codes include the training symbols in the structure of the code which is shown to be the key point to obtain high rate as well as the SSD property. TE-CODs are shown t…
In this paper, using relaying broadcast channels (RBCs) as component channels for non-orthogonal multiple access (NOMA) is proposed to enhance the performance of NOMA in single-input single-output (SISO) cellular downlink systems. To analyze the performance of the proposed scheme, an achievable rate region of a RBC with compress-and-forward (CF) relaying is newly derived based on the recent work of noisy network coding (NNC). Based on the analysis of the achievable rate region of a RBC with decode-and-forward (DF) relaying, CF relaying, or CF relaying with dirty-paper coding (DPC) at the trans…
A relay channel with orthogonal components that is affected by an interference signal that is noncausally available only at the source is studied. The interference signal has structure in that it is produced by another transmitter communicating with its own destination. Moreover, the interferer is not willing to adjust its communication strategy to minimize the interference. Knowledge of the interferer's signal may be acquired by the source, for instance, by exploiting HARQ retransmissions on the interferer's link. The source can then utilize the relay not only for communicating its own messag…
Non-orthogonal multiple access (NOMA) and the cooperative relaying systems are two of the promising techniques to meet requirements of future wireless networks such as high spectral efficiency and wide coverage area. On the other hand, the energy efficiency has also high priority in the applications with limited energy such as sensor networks and/or internet of things (IoTs). To this end, in this paper, we propose wireless powered cooperative relaying system with NOMA thereby increasing spectral and energy efficiency. We consider three different energy harvesting (EH) protocols (i.e., power sh…
In this paper, we study relay networks with orthogonal components in presence of noncausal channel state information (CSI) available at the source. We propose an upper bound on the capacity of the discrete memoryless model (DM)for the case in which just the source component intended for the destination is encoded against the CSI known non-causally at the source. Also, we derive capacity for two special classes of the Gaussian structure of the model. The first class is the one for which we have obtained the upper bound and the second class is the one in which all of the source components intend…
We consider the uncoded transmission over the half-duplex single relay channel, with a single antenna at the source, relay and destination nodes, in a Rayleigh fading environment. The phase during which the relay is in reception mode is referred to as Phase 1 and the phase during which the relay is in transmission mode is referred to as Phase 2. The following two cases are considered: the Non-Orthogonal Decode and Forward (NODF) scheme, in which both the source and the relay transmit during Phase 2 and the Orthogonal Decode and Forward (ODF) scheme, in which the relay alone transmits during Ph…
We consider a cooperative non-orthogonal multiple access (NOMA) network in which a full-duplex (FD) multi-antenna relay assists transmission from a base station (BS) to a set of far users with poor channel conditions, while at the same time the BS transmits to a set of near users with strong channel conditions. We assume imperfect self-interference (SI) cancellation at the FD relay and imperfect inter-user interference cancellation at the near users. In order to cancel the SI at the relay a zero-forcing based beamforming scheme is used and the corresponding outage probability analysis of two u…
In this paper, we present a finite-block-length comparison between the orthogonal multiple access (OMA) scheme and the non-orthogonal multiple access (NOMA) for the uplink channel. First, we consider the Gaussian channel, and derive the closed form expressions for the rate and outage probability. Then, we extend our results to the quasi-static Rayleigh fading channel. Our analysis is based on the recent results on the characterization of the maximum coding rate at finite block-length and finite block-error probability. The overall system throughput is evaluated as a function of the number of i…
This paper investigates a two-way relay nonorthogonal multiple access (TWR-NOMA) system, where two groups of NOMA users exchange messages with the aid of one half-duplex (HD) decode-and-forward (DF) relay. Since the signal-plus-interference-to-noise ratios (SINRs) of NOMA signals mainly depend on effective successive interference cancellation (SIC) schemes, imperfect SIC (ipSIC) and perfect SIC (pSIC) are taken into consideration. To characterize the performance of TWR-NOMA systems, we derive closed-form expressions for both exact and asymptotic outage probabilities of NOMA users' signals with…
Two emerging technologies towards 5G wireless networks, namely non-orthogonal multiple access (NOMA) and cognitive radio (CR), will provide more efficient utilization of wireless spectrum in the future. In this article, we investigate the integration of NOMA with CR into a holistic system, namely cognitive NOMA network, for more intelligent spectrum sharing. Design principles of cognitive NOMA networks are perfectly aligned to functionality requirements of 5G wireless networks, such as high spectrum efficiency, massive connectivity, low latency, and better fairness. Three different cognitive N…
We consider a multi-way relay network with an orthogonal uplink and correlated sources, and we characterise reliable communication (in the usual Shannon sense) with a single-letter expression. The characterisation is obtained using a joint source-channel random-coding argument, which is based on a combination of Wyner et al.'s "Cascaded Slepian-Wolf Source Coding" and Tuncel's "Slepian-Wolf Coding over Broadcast Channels". We prove a separation theorem for the special case of two nodes; that is, we show that a modular code architecture with separate source and channel coding functions is (asym…
We establish an achievable rate region for discrete memoryless interference relay channels that consist of two source-destination pairs and one or more relays. We develop an achievable scheme combining Han-Kobayashi and noisy network coding schemes. We apply our achievability to two cases. First, we characterize the capacity region of a class of discrete memoryless interference relay channels. This class naturally generalizes the injective deterministic discrete memoryless interference channel by El Gamal and Costa and the deterministic discrete memoryless relay channel with orthogonal receive…
The paper treats a multiuser relay scenario where multiple user equipments (UEs) have a two-way communication with a common Base Station (BS) in the presence of a buffer-equipped Relay Station (RS). Each of the uplink (UL) and downlink (DL) transmission can take place over a direct or over a relayed path. Traditionally, the UL and the DL path of a given two-way link are coupled, that is, either both are direct links or both are relayed links. By removing the restriction for coupling, one opens the design space for a decoupled two-way links. Following this, we devise two protocols: orthogonal d…
This letter studies the outage performance of cooperative non-orthogonal multiple access (NOMA) network with the help of an amplify-and-forward relay. An accurate closed-form approximation for the exact outage probability is derived. Based on this, the asymptotic outage probability is investigated, which shows that cooperative NOMA achieves the same diversity order and the superior coding gain compared to cooperative orthogonal multiple access. It is also revealed that when the transmit power of relay is smaller than that of the base station, the outage performance improves as the distance bet…
The problem of optimal resource allocation is studied for ergodic fading orthogonal multiaccess relay channels (MARCs) in which the users (sources) communicate with a destination with the aid of a half-duplex relay that transmits on a channel orthogonal to that used by the transmitting sources. Under the assumption that the instantaneous fading state information is available at all nodes, the maximum sum-rate and the optimal user and relay power allocations (policies) are developed for a decode-and-forward (DF) relay. With the observation that a DF relay results in two multiaccess channels, on…
This letter studies the impact of relay selection (RS) on the performance of cooperative non-orthogonal multiple access (NOMA). In particular, a two-stage RS strategy is proposed, and analytical results are developed to demonstrate that this two-stage strategy can achieve the minimal outage probability among all possible RS schemes, and realize the maximal diversity gain. The provided simulation results show that cooperative NOMA with this two-stage RS scheme outperforms that with the conventional max-min approach, and can also yield a significant performance gain over orthogonal multiple acce…
In this paper, we consider a relay-assisted uplink non-orthogonal multiple access (NOMA) system. In this system, two radio frequency (RF) users are grouped for simultaneous transmissions, over each resource block, to an intermediate relay. The relay then forwards the amplified version of the users' aggregated signals, in the presence of multiuser interference, to a relatively far destination. In order to cope with the users' ever-increasing desire for higher data rates, a high-throughput free-space optics (FSO) link is employed as the relay-destination backhaul link. It is assumed that the FSO…
We develop a new upper bound on the capacity of the relay channel that is tighter than previously known upper bounds. This upper bound is proved using traditional weak converse techniques involving mutual information inequalities and Gallager-type explicit identification of auxiliary random variables. We show that the new upper bound is strictly tighter than all previous bounds for the Gaussian relay channel with non-zero channel gains. When specialized to the relay channel with orthogonal receiver components, the bound resolves a conjecture by Kim on a class of deterministic relay channels. W…
A two-way relay non-orthogonal multiple access (TWR-NOMA) system is investigated, where two groups of NOMA users exchange messages with the aid of one half-duplex (HD) decode-and-forward (DF) relay. Since the signal-plus-interference-to-noise ratios (SINRs) of NOMA signals mainly depend on effective successive interference cancellation (SIC) schemes, imperfect SIC (ipSIC) and perfect SIC (pSIC) are taken into account. In order to characterize the performance of TWR-NOMA systems, we first derive closed-form expressions for both exact and asymptotic outage probabilities of NOMA users' signals wi…
A state-dependent relay channel is studied in which strictly causal channel state information is available at the relay and no state information is available at the source and destination. Source and relay are connected via two unidirectional out-of-band orthogonal links of finite capacity, and a state-dependent memoryless channel connects source and relay, on one side, and the destination, on the other. Via the orthogonal links, the source can convey information about the message to be delivered to the destination to the relay while the relay can forward state information to the source. This …
We consider the communication scenario where a source-destination pair wishes to keep the information secret from a relay node despite wanting to enlist its help. For this scenario, an interesting question is whether the relay node should be deployed at all. That is, whether cooperation with an untrusted relay node can ever be beneficial. We first provide an achievable secrecy rate for the general untrusted relay channel, and proceed to investigate this question for two types of relay networks with orthogonal components. For the first model, there is an orthogonal link from the source to the r…
A state-dependent relay channel is studied in which strictly causal channel state information is available at the relay and no state information is available at the source and destination. The source and the relay are connected via two unidirectional out-of-band orthogonal links of finite capacity, and a state-dependent memoryless channel connects the source and the relay, on one side, and the destination, on the other. Via the orthogonal links, the source can convey information about the message to be delivered to the destination to the relay while the relay can forward state information to t…
A Gaussian interference channel (IC) with a relay is considered. The relay is assumed to operate over an orthogonal band with respect to the underlying IC, and the overall system is referred to as IC with an out-of-band relay (IC-OBR). The system can be seen as operating over two parallel interference-limited channels: The first is a standard Gaussian IC and the second is a Gaussian relay channel characterized by two sources and destinations communicating through the relay without direct links. We refer to the second parallel channel as OBR Channel (OBRC). The main aim of this work is to ident…
