Noncooperative Eigencoding for MIMO Ad hoc Networks

A new noncooperative eigencoding algorithm is introduced for MIMO Ad hoc networks. The algorithm performs generalized waterfilling with respect to its transmit covariance matrix and the receiving node covariance matrix, both of which can be estimated locally. The algorithm is first developed for narrow band MIMO networks, and then extended to frequency selective fading channels. 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. For the frequency selective fading case, two new algorithms are proposed in the form of space-time waveform design and MIMO-OFDM precoding. The two corresponding greedy algorithms are also presented. Simulation results also show that the generalized eigencoding approach provides better performance than its greedy counterparts. An iterative form of the noncooperative algorithm and gam...

• Type: Journal
• Year: 2008
• Where: TSP
• Authors: Duong A. Hoang, Ronald A. Iltis
• Keywords: Algorithm, Noncooperative Algorithm, Noncooperative Eigencoding Algorithm, TSP 2008