Greedy SINR maximization in collaborative multibase wireless systems
EURASIP Journal on Wireless Communications and Networking - Special issue on multiuser MIMO networks
On the performance of expected transmission count (ETX) for wireless mesh networks
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
A game-theoretic framework for interference avoidance
IEEE Transactions on Communications
Widely-linear filtering and non-cooperative transceiver optimization in wireless data networks
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
Interference avoidance in networks with distributed receivers
IEEE Transactions on Communications
SINR-maximizing spreading code allocation for non-linear serial interference cancellation
IEEE Transactions on Communications
Constructing and decoding GWBE codes using Kronecker products
IEEE Communications Letters
IEEE Transactions on Information Theory
| Hi-index | 754.90 |
Interference avoidance has been shown to reduce total square correlation (TSC) for given ensembles of user signature waveforms (codewords) in a synchronous code-division multiple-access (CDMA) system. In all experiments we have conducted, sequential application of interference avoidance produces an optimal codeword set when starting from randomly chosen initial codewords. Here we provide the first formal proof of convergence to optimal codeword ensembles for greedy interference avoidance algorithms augmented by a technique called “class warfare” whereby users which reside in more heavily loaded areas of the signal space purposely interfere with (attack) the reception of users in less crowded areas. Coordination of deliberate interference by a complete class of aggrieved user is also sometimes necessary. Such “attacks” and subsequent codeword adjustment by attacked users are shown to strictly decrease TSC. Along the way we also show using linear algebra and a variant of stochastic ordering, equivalence between minimization of TSC and maximization of sum capacity