There is a natural intuitive match between anonymity and information theory. In particular, the maximal anonymity loss in anonymity protocols can be matched to the information the...
We study the best known general inner bound[1] and outer bound[2] for the capacity region of the two user discrete memory less channel. We prove that a seemingly stronger outer bou...
—This paper addresses three issues in the field of ad hoc network capacity: the impact of i) channel fading, ii) channel inversion power control, and iii) threshold–based sche...
—The cooperative dirty paper coding (DPC) rate region is investigated in a two-transmitter two-receiver network with full channel state information available at all terminals. Th...
Chris T. K. Ng, Nihar Jindal, Andrea J. Goldsmith,...
—This paper studies video multicasting in large scale areas using wireless mesh networks. The focus is on the use of Internet access gateways that allow a choice of alternative r...
Wanqing Tu, Cormac J. Sreenan, Chun Tung Chou, Arc...