Noncooperative Eigencoding for MIMO Ad hoc Networks

A new noncooperative eigencoding algorithm is introduced for multiple-input multiple-output (MIMO) ad hoc networks. The algorithm performs generalized waterfilling with respect to its transmit covariance matrix and the receive node covariance matrix, both of which can be estimated locally. A cooperative algorithm is also developed as a benchmark in simulations. Simulation results show that the noncooperative algorithm performance is close to that of the cooperative method and is much better than greedy optimization. A game theoretic interpretation of the algorithm is also provided.