Related papers: Efficiently Finding Simple Schedules in Gaussian H…
In order to satisfy the delay requirements of telecommunication systems, in this paper, we present a cooperative network with the short packet transmission in the Rayleigh fading channel. The desired relay can be implemented as a two-way…
This study investigates the problem of communication for a network composed of two half-duplex parallel relays with additive white Gaussian noise. Two protocols, i.e., \emph{Simultaneous} and \emph{Successive} relaying, associated with two…
We analyze coding for energy efficiency in relay channels at a fixed source rate. We first propose a half-duplex decode-forward coding scheme for the Gaussian relay channel. We then derive three optimal sets of power allocation, which…
The multicast capacity of the Gaussian two-hop relay network with one source, $N$ relays, and $L$ destinations is studied. It is shown that a careful modification of the partial decode--forward coding scheme, whereby the relays cooperate…
We consider a wireless network with a set of transmitter-receiver pairs, or links, that share a common channel, and address the problem of emptying finite traffic volume from the transmitters in minimum time. This, so called, minimum-time…
We present an achievable rate for general Gaussian relay networks. We show that the achievable rate is within a constant number of bits from the information-theoretic cut-set upper bound on the capacity of these networks. This constant…
Many modern distributed systems consist of devices that generate more data than what can be transmitted via a communication link in near real time with high-fidelity. We consider the scheduling problem in which a device has access to…
Consider a wireless Gaussian network where a source wishes to communicate with a destination with the help of N full-duplex relay nodes. Most practical systems today route information from the source to the destination using the best path…
Consider a Gaussian relay network where a number of sources communicate to a destination with the help of several layers of relays. Recent work has shown that a compress-and-forward based strategy at the relays can achieve the capacity of…
In this paper, we consider a full duplex wireless powered communication network where multiple users with radio frequency energy harvesting capability communicate to an energy broadcasting hybrid access point. We investigate the minimum…
Given a capacitated communication network $\mathcal{N}$ and a function f that needs to be computed on $\mathcal{N},$ we study the problem of generating a computation and communication schedule in $\mathcal{N}$ to maximize the rate of…
In this paper we present several strategies for multiple relay networks which are constrained by a half-duplex operation, i. e., each node either transmits or receives on a particular resource. Using the discrete memoryless multiple relay…
In this paper we improve the approximation ratio for the problem of scheduling packets on line networks with bounded buffers, where the aim is that of maximizing the throughput. Each node in the network has a local buffer of bounded size…
The capacity region of multi-pair bidirectional relay networks, in which a relay node facilitates the communication between multiple pairs of users, is studied. This problem is first examined in the context of the linear shift deterministic…
In this paper, we investigate a novel minimum length scheduling problem to determine the optimal power control, and scheduling for constant and continuous rate models, while considering concurrent transmission of users, energy causality,…
In Polyamorous Scheduling, we are given an edge-weighted graph and must find a periodic schedule of matchings in this graph which minimizes the maximal weighted waiting time between consecutive occurrences of the same edge. This NP-hard…
Full-duplex (FD) communication has received great interest in recent years due to the potential of doubling the spectral efficiency. However, how to alleviate the detrimental effects of the residual self-interference (RSI) incurred by the…
We study the half-duplex multiple-relay channel (HD-MRC) where every node can either transmit or listen but cannot do both at the same time. We obtain a capacity upper bound based on a max-flow min-cut argument and achievable transmission…
Flexible duplex networks allow users to dynamically employ uplink and downlink channels without static time scheduling, thereby utilizing the network resources efficiently. This work investigates the sum-rate maximization of flexible duplex…
Although extensively investigated, the capacity of the two-hop half-duplex (HD) relay channel is not fully understood. In particular, a capacity expression which can be evaluated straightforwardly is not available and an explicit coding…