We consider the discrete memoryless symmetric primitive relay channel, where, a source <inline-formula> <tex-math notation="LaTeX">$X$ </tex-math></inline-formula> wants to send information to aâ€¦ (More)

The cut-set bound developed by Cover and El Gamal in 1979 has since remained the best known upper bound on the capacity of the Gaussian relay channel. We develop a new upper bound on the capacity ofâ€¦ (More)

Motivated by the recent developments in wireless power transfer, we study communication with a remotely powered transmitter. We propose an information-theoretic model where a charger can dynamicallyâ€¦ (More)

Motivated by the recent emergence of energy harvesting and wirelessly powered transceivers, we study communication over a memoryless channel with a transmitter, whose battery is recharged at randomâ€¦ (More)

The data center network (DCN), wired or wireless, features large amounts of many-to-one (M2O) sessions. Each M2O session is currently established using point-to-point (P2P) communications andâ€¦ (More)

This paper investigates the achievable rates of an additive white Gaussian noise energy-harvesting (EH) channel with an infinite battery. The EH process is characterized by a sequence of blocks ofâ€¦ (More)

Consider a memoryless relay channel, where the channel from the relay to the destination is an isolated bit pipe of capacity C<inf>0</inf>. Let C(C<inf>0</inf>) denote the capacity of this channel asâ€¦ (More)