Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.