Assignment methods for spatial reuse TDMA
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Multiuser Detection
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
Fundamentals of wireless communication
Fundamentals of wireless communication
Topology control meets SINR: the scheduling complexity of arbitrary topologies
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 12th annual international conference on Mobile computing and networking
MIMO Wireless Communications
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Opportunistic and cooperative spatial multiplexing in MIMO ad hoc networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Taking the sting out of carrier sense: interference cancellation for wireless LANs
Proceedings of the 14th ACM international conference on Mobile computing and networking
Characterizing the capacity gain of stream control scheduling in MIMO wireless mesh networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Topology control for effective interference cancellation in multi-user MIMO networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Successive interference cancellation: a back-of-the-envelope perspective
Hotnets-IX Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks
IEEE Transactions on Wireless Communications
Transmission Capacity of Wireless Ad Hoc Networks With Successive Interference Cancellation
IEEE Transactions on Information Theory
Hi-index | 0.00 |
In multiuser multiple-input-multiple-output (MIMO) networks, receivers decode multiple concurrent signals using successive interference cancellation (SIC). With SIC, a weak target signal can be deciphered in the presence of stronger interfering signals. However, this is only feasible if each strong interfering signal satisfies a signal-to-noise-plus-interference ratio (SINR) requirement. This necessitates the appropriate selection of a subset of links that can be concurrently active in each receiver's neighborhood; in other words, a subtopology consisting of links that can be simultaneously active in the network is to be formed. If the selected subtopologies are of small size, the delay between the transmission opportunities on a link increases. Thus, care should be taken to form a limited number of subtopologies. We find that the problem of constructing the minimum number of subtopologies such that SIC decoding is successful with a desired probability threshold is NP-hard. Given this, we propose MUSIC, a framework that greedily forms and activates subtopologies in a way that favors successful SIC decoding with a high probability. MUSIC also ensures that the number of selected subtopologies is kept small. We provide both a centralized and a distributed version of our framework. We prove that our centralized version approximates the optimal solution for the considered problem. We also perform extensive simulations to demonstrate that: 1) MUSIC forms a small number of subtopologies that enable efficient SIC operations; the number of subtopologies formed is at most 17% larger than the optimum number of topologies, discovered through exhaustive search (in small networks); 2) MUSIC outperforms approaches that simply consider the number of antennas as a measure for determining the links that can be simultaneously active. Specifically, MUSIC provides throughput improvements of up to four times, as compared to such an approach, in various topological settings. The improvements can be directly attributable to a significantly higher probability of correct SIC based decoding with MUSIC.