Downlink SDMA with Limited Feedback in Interference-Limited Wireless Networks

The tremendous capacity gains promised by space division multiple access (SDMA) depend critically on the accuracy of the transmit channel state information. In the broadcast channel, even without any network interference, it is known that such gains collapse due to interstream interference if the feedback is delayed or low rate. In this paper, we investigate SDMA in the presence of interference from many other simultaneously active transmitters distributed randomly over the network. In particular we consider zero-forcing beamforming in a decentralized (ad hoc) network where each receiver provides feedback to its respective transmitter. We derive closed-form expressions for the outage probability, network throughput, transmission capacity, and average achievable rate and go on to quantify the degradation in network performance due to residual self-interference as a function of key system parameters. One particular finding is that as in the classical broadcast channel, the per-user feedback rate must increase linearly with the number of transmit antennas and SINR (in dB) for the full multiplexing gains to be preserved with limited feedback. We derive the throughput-maximizing number of streams, establishing that single-stream transmission is optimal in most practically relevant settings. In short, SDMA does not appear to be a prudent design choice for interference-limited wireless networks.Comment: Submitted to IEEE Transactions on Wireless Communication

On Coding for Reliable Communication over Packet Networks

We present a capacity-achieving coding scheme for unicast or multicast over lossy packet networks. In the scheme, intermediate nodes perform additional coding yet do not decode nor even wait for a block of packets before sending out coded packets. Rather, whenever they have a transmission opportunity, they send out coded packets formed from random linear combinations of previously received packets. All coding and decoding operations have polynomial complexity. We show that the scheme is capacity-achieving as long as packets received on a link arrive according to a process that has an average rate. Thus, packet losses on a link may exhibit correlation in time or with losses on other links. In the special case of Poisson traffic with i.i.d. losses, we give error exponents that quantify the rate of decay of the probability of error with coding delay. Our analysis of the scheme shows that it is not only capacity-achieving, but that the propagation of packets carrying "innovative" information follows the propagation of jobs through a queueing network, and therefore fluid flow models yield good approximations. We consider networks with both lossy point-to-point and broadcast links, allowing us to model both wireline and wireless packet networks.Comment: 33 pages, 6 figures; revised appendi

Multi-Channel Random Access with Replications

This paper considers a class of multi-channel random access algorithms, where contending devices may send multiple copies (replicas) of their messages to the central base station. We first develop a hypothetical algorithm that delivers a lower estimate for the access delay performance within this class. Further, we propose a feasible access control algorithm achieving low access delay by sending multiple message replicas, which approaches the performance of the hypothetical algorithm. The resulting performance is readily approximated by a simple lower bound, which is derived for a large number of channels.Comment: 5 pages, 2 figures, accepted by ISIT 201