TY - GEN
T1 - Power-efficient spatial multiplexing for multiantenna MANETs
AU - Nguyen, Diep N.
AU - Krunz, Marwan
PY - 2012
Y1 - 2012
N2 - We consider the problem of minimizing network's transmit power for given transmission rate demands of all links in a multi-input multi-output (MIMO) ad hoc network. The problem is nonconvex, hence, challenging to be solved, even in a centralized manner. To derive a distributed solution, we reformulate the problem as a noncooperative game. We then propose a network interference function (NIF) that captures the total interference incurred at unintended receivers by all transmitters. The proposed NIF sets the light for designing transmitter-dependent pricing policies for the above game. A price-based iterative water-filling algorithm (PIWF) is proposed to find MIMO precoding matrices, which determines both beam directions and transmission power allocation among antennas (or data streams) at each transmitter. Simulations show that PIWF is more power-efficient than all existing MIMO precoding methods. Additionally, NIF under PIWF is also the least. Simulations also show the fast convergence of PIWF.
AB - We consider the problem of minimizing network's transmit power for given transmission rate demands of all links in a multi-input multi-output (MIMO) ad hoc network. The problem is nonconvex, hence, challenging to be solved, even in a centralized manner. To derive a distributed solution, we reformulate the problem as a noncooperative game. We then propose a network interference function (NIF) that captures the total interference incurred at unintended receivers by all transmitters. The proposed NIF sets the light for designing transmitter-dependent pricing policies for the above game. A price-based iterative water-filling algorithm (PIWF) is proposed to find MIMO precoding matrices, which determines both beam directions and transmission power allocation among antennas (or data streams) at each transmitter. Simulations show that PIWF is more power-efficient than all existing MIMO precoding methods. Additionally, NIF under PIWF is also the least. Simulations also show the fast convergence of PIWF.
UR - http://www.scopus.com/inward/record.url?scp=84871990753&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84871990753&partnerID=8YFLogxK
U2 - 10.1109/ICC.2012.6364068
DO - 10.1109/ICC.2012.6364068
M3 - Conference contribution
AN - SCOPUS:84871990753
SN - 9781457720529
T3 - IEEE International Conference on Communications
SP - 4016
EP - 4020
BT - 2012 IEEE International Conference on Communications, ICC 2012
T2 - 2012 IEEE International Conference on Communications, ICC 2012
Y2 - 10 June 2012 through 15 June 2012
ER -