Learn More
A noisy network coding scheme for communicating messages between multiple sources and destinations over a general noisy network is presented. For multi-message multicast networks, the scheme naturally generalizes network coding over noiseless networks by Ahlswede, Cai, Li, and Yeung, and compress-forward coding for the relay channel by Cover and El Gamal to(More)
— Gupta and Kumar (2000) introduced a random network model for studying the way throughput scales in a wireless network when the nodes are fixed, and showed that the throughput per source-destination pair is throughput scaling per source-destination pair. The focus of this paper is on characterizing the delay and determining the throughput-delay trade-off(More)
Gupta and Kumar (2000) introduced a random model to study throughput scaling in a wireless network with static nodes, and showed that the throughput per source-destination pair is &#920; (1/&#8730;<i>n</i> log <i>n</i>). Grossglauser and Tse (2001) showed that when nodes are mobile it is possible to have a constant throughput scaling per source-destination(More)
Absrmcr-Let {(q, r$)}#L* be a source of independealt identicauy distributed (i.i.d.) disc&e random variables with joint probability mass function p(u,o) and common part w-f(u)=g(u) in the sense of Witsenbawn, Gacs, and Kkner. It is shown that such a source can be sent with arbitrarily small probability of error over a multiple access ChaMel (MAC) {Xl(More)
Upper and lower bounds on the capacity and minimum energy-per-bit for general additive white Gaussian noise (AWGN) and frequency-division AWGN (FD-AWGN) relay channel models are established. First, the max-flow min-cut bound and the generalized block-Markov coding scheme are used to derive upper and lower bounds on capacity. These bounds are never tight for(More)
—The paper considers the problem of minimizing the energy used to transmit packets over a wireless link via lazy schedules that judiciously vary packet transmission times. The problem is motivated by the following observation. With many channel coding schemes, the energy required to transmit a packet can be significantly reduced by lowering transmission(More)
In this paper, we establish the capacity region of a class of deterministic interference channels with common information. For such a class of channels, each sender needs to transmit not only the private information but also certain common information to the corresponding receiver. Moreover, the channel outputs are deterministic with respect to given(More)