Learn More
In this paper, we characterize the information-theoretic capacity scaling of wireless ad hoc networks with randomly distributed nodes. By using an exact channel model from Maxwell's equations, we successfully resolve the conflict in the literature between the linear capacity scaling by Özgür and the degrees of freedom limit given as the(More)
In many known examples where compress-and-forward (CF) for relay networks is capacity achieving, it is only trivially so, i.e., it falls back to hashing without quantization. A potentially better strategy is to decode as much as possible and to compress the residual information, i.e., a combination of decode-and-forward (DF) and CF (Cover and El Gamal's(More)
In this paper, we study the capacity scaling of wireless ad hoc networks considering the effect of a finite wavelength, which gives a unified view on two seemingly contradictory results on the capacity scaling. Recently, it was shown that the order-optimal linear throughput scaling is achievable for some networks using hierarchical cooperation (HC) by(More)
In this paper, we propose a noisy network coding integrated with partial decode-and-forward relaying for single-source multicast discrete memoryless networks (DMN's). Our coding scheme generalizes the partial-decode-compress-and-forward scheme (Theorem 7) by Cover and El Gamal. This is the first time the theorem is generalized for DMN's such that each relay(More)
We consider streaming data transmission over a discrete memoryless channel. A new message is given to the encoder at the beginning of each block and the decoder decodes each message sequentially, after a delay of T blocks. In this streaming setup, we study the fundamental interplay between the rate and error probability in the central limit and moderate(More)
In this paper, we consider the Gaussian diamond-wiretap channel that consists of an orthogonal broadcast channel from a source to two relays and a Gaussian fast-fading multiple access-wiretap channel from the two relays to a legitimate destination and an eavesdropper. For the multiple access part, we consider both the case with full channel state(More)
A hierarchical cooperative multiple-input multiple-output (MIMO) transmission can greatly improve the throughput scaling in wireless networks as shown in [1]. In this paper, we analyze the effect of channel correlation on the throughput scaling in wireless networks by focusing on an achievable rate of the cooperative MIMO transmission between two clusters(More)
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. We apply our achievability to two cases. First, we characterize the capacity region of some classes of discrete(More)
In this paper, we characterize the capacity of a new class of discrete memoryless multicast networks having a tree topology. For achievability, a novel coding scheme is constructed where some relays employ a combination of decode-and-forward and compress-and-forward and the other relays perform a random binning such that codebook constructions and relay(More)