We study the problem of optimal packet coding for connections with large delay-bandwidth
products. Generally, for a given loss rate, using a higher coding redundancy achieves a …

In this paper, we establish a new bound tying together the effective length and the maximum
correlation between the outputs of an arbitrary pair of Boolean functions which operate on …

Multi-hop wireless networks are increasingly becoming more relevant to current and
emerging wireless network deployment. The need for understanding the performance of …

In this paper, we consider a wireless network consisting of a source node, a destination
node and multiple relay nodes under Rayleigh fading channels. Cooperative diversity of …

Traffic with self-similar and heavy-tailed characteristics has been widely reported in
communication networks, yet, the state-of-the-art of analytically predicting the delay …

We study delay-universal sequential streaming over discrete memoryless three-terminal
relay networks, and propose a decode-and-forward relaying scheme. We derive upper …

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 …

In this paper, an asymptotic analysis for the delay-throughput of a single-hop wireless
network with n pairs of nodes is presented. The analysis relies on the decentralized on-off …

This paper develops upper bounds on the end-to-end transmission capacity of multihop
wireless networks. Potential source-destination paths are dynamically selected from a pool …

Random coding, along with various standard tech-niques such as coded time-sharing, rate-
splitting, superposition coding, and binning, are traditionally used in obtaining achievable …