Yang Yang

Learn More
In this paper, we characterize the throughput of a broadcast network with n receivers using rateless codes with block size K. We assume that the underlying channel is a Markov modulated erasure channel that is i.i.d. across users, but can be correlated in time. We characterize the system throughput asymptotically in n. Specifically, we explicitly show how(More)
—Recent breakthroughs in wireless communication show that by using new signal processing techniques, a wireless node is capable of transmitting and receiving simultaneously on the same frequency band by activating both of its RF chains, thus achieving full-duplex communication and potentially doubling the link throughput. However, with two sets of RF(More)
—Recent work has shown that retransmission-s can cause heavy-tailed transmission delays even when packet sizes are light-tailed. Moreover, the impact of heavy tailed delays persist even when packets are of finite size. The key question we study in this paper is how the use of coding techniques to transmit information could mitigate delays. To investigate(More)
—OFDMA has been selected as the multiple access scheme for emerging broadband wireless communication systems. However, designing efficient resource allocation algorithms for OFDMA systems is a challenging task, especially in the uplink, due to the combinatorial nature of subcarrier assignment and the distributed power budget for different users. Inspired by(More)
—The recent breakthrough in wireless full-duplex communication makes possible a brand new way of multi-hop wireless communication, namely full-duplex cut-through transmission, where for a traffic flow that traverses through multiple links, every node along the route can receive a new packet and simultaneously forward the previously received packet. This(More)
—A major challenge of wireless multicast is to be able to support a large number of users while simultaneously maintaining low delay and low feedback overhead. In this paper, we develop a joint coding and feedback scheme named Moving Window Network Coding with Anonymous Feedback (MWNC-AF) that simultaneously achieves constant decoding delay and constant(More)
For a multicast group of <i>n</i> receivers, existing techniques either achieve high throughput at the cost of prohibitively large (e.g., <i>O</i>(<i>n</i>)) feedback overhead, or achieve low feedback overhead but without either optimal or near-optimal throughput guarantees. Simultaneously achieving good throughput guarantees and low feedback overhead has(More)
— In recent years, there has been a growing interest in equipping base-stations with renewable resources and batteries , with an aim to reduce the energy-related operational cost for cellular networks. To fully leverage the cost-saving potential of such base-stations, the design of joint resource-allocation and energy-control algorithms that take both the(More)
—Recent studies have shown that retransmis-sions can cause heavy-tailed transmission delays even when packet sizes are light-tailed. Moreover, the impact of heavy-tailed delays persists even when packets size are upper bounded. The key question we study in this paper is how the use of coding techniques to transmit information, together with different system(More)
  • 1