Via multiterminal information theory, we present fundamental rate delay tradeoffs that delay
mitigating codes must have when utilized over multipath routed and network coded …

The throughput of wireless networks is known to scale poorly when the number of users
grows. The rate at which an arbitrary pair of nodes can communicate must decrease to zero …

This work addresses the problem of deriving fundamental trade-off bounds for a 1-relay and
a 2-relay wireless network when multiple performance criteria are of interest. It proposes a …

The time-varying feature of wireless channels usually makes the hard delay bound for data
transmissions unrealistic to guarantee. In contrast, the statistically-bounded delay with a …

We consider a wireless communication system with a single source node, a single
destination node, and multiple relay nodes placed equidistantly between them. We limit our …

We consider communication through a cascade of L identical discrete memoryless channels
(DMCs). The source and destination node are allowed to use coding schemes of arbitrary …

This paper considers network communications under a hard timeliness constraint, where a
source node streams perishable information to a destination node over a directed acyclic …

In a two-way relay network, two terminals exchange information over a shared wireless half-
duplex channel with the help of a relay. Due to its fundamental and practical importance …

This paper deals with the delay-throughput analysis of a single-hop wireless network with n
transmitter/receiver pairs. All channels are assumed to be block Rayleigh fading with …

We investigate rate selection methods to maximize a utility function of a multihop relay
network adopting a Chase combining-type hybrid automatic repeat request scheme. For …