Digital Communication: Third Edition
Digital Communication: Third Edition
Algorithmic aspects of communication in ad-hoc networks with smart antennas
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Characterization and analysis of multi-hop wireless MIMO network throughput
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
IEEE Transactions on Signal Processing
On the achievable throughput of a multiantenna Gaussian broadcast channel
IEEE Transactions on Information Theory
Sum capacity of the vector Gaussian broadcast channel and uplink-downlink duality
IEEE Transactions on Information Theory
Duality, achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels
IEEE Transactions on Information Theory
Sum capacity of Gaussian vector broadcast channels
IEEE Transactions on Information Theory
Gaussian Interference Channel Capacity to Within One Bit
IEEE Transactions on Information Theory
Downlink capacity evaluation of cellular networks with known-interference cancellation
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
This paper considers the problem of scheduling the maximum number of streams in a single time slot under the MIMO degrees of freedom (DOF) model, when all links are in a single collision domain. In the DOF model, nodes can use degrees of freedom provided by their antenna arrays to multiplex multiple streams on a single link and/or cancel interference between concurrently transmitting links. Given a set of links with data to transmit that are free of primary interference, we provide optimal constructions for both the case where only spatial reuse (from interference cancellation) is allowed and the case where both spatial reuse and spatial multiplexing can be done simultaneously. Our analysis allows deriving clean throughput performance trends when the number of available DOFs is arbitrarily increased. These trends show that combining spatial multiplexing with spatial reuse can arbitrarily increase throughput compared to spatial reuse only, and that close to two-fold throughput increases can be achieved compared to spatial multiplexing only. Finally, we show how the approach can be extended to deal with primary interference and optimally solve the one-shot stream scheduling problem for an arbitrary set of MIMO links in a single collision domain.