TY - GEN
T1 - On transceiver beamformer design for multi-source multi-destination wireless networks
AU - Chen, Fuyu
AU - Su, Weifeng
AU - Batalama, Stella N.
AU - Matyjas, John D.
PY - 2011
Y1 - 2011
N2 - In this paper, we consider the problem of designing transceiver beamforming vectors for multi-source multi-destination (MSMD) wireless networks such that the transmission power of each source is minimized while the signal-to-interference plus noise ratio (SINR) requirements of all source-destination pairs are satisfied. We propose an efficient iterative algorithm to design the transceiver beamforming vectors and address the convergence of the algorithm. We determine a necessary condition as well as a sufficient condition for the algorithm to converge to a generalized Nash equilibrium solution. Especially, if each destination has only one antenna, we obtain a necessary and sufficient condition for the algorithm to converge to a unique generalized Nash equilibrium solution. Simulation results show that the proposed iterative algorithm has higher probability of convergence compared to an iterative waterfilling (IWF) approach. For example, for a system with three source-destination pairs and SINR requirement of 2dB, the probability of convergence is 84% with the proposed algorithm while it is only 66% with the IWF algorithm.
AB - In this paper, we consider the problem of designing transceiver beamforming vectors for multi-source multi-destination (MSMD) wireless networks such that the transmission power of each source is minimized while the signal-to-interference plus noise ratio (SINR) requirements of all source-destination pairs are satisfied. We propose an efficient iterative algorithm to design the transceiver beamforming vectors and address the convergence of the algorithm. We determine a necessary condition as well as a sufficient condition for the algorithm to converge to a generalized Nash equilibrium solution. Especially, if each destination has only one antenna, we obtain a necessary and sufficient condition for the algorithm to converge to a unique generalized Nash equilibrium solution. Simulation results show that the proposed iterative algorithm has higher probability of convergence compared to an iterative waterfilling (IWF) approach. For example, for a system with three source-destination pairs and SINR requirement of 2dB, the probability of convergence is 84% with the proposed algorithm while it is only 66% with the IWF algorithm.
KW - game theory
KW - generalized Nash equilibrium
KW - MIMO interference channel
KW - Multi-source multi-destination (MSMD) wireless network
KW - transceiver beamforming
UR - https://www.scopus.com/pages/publications/84857209316
U2 - 10.1109/GLOCOM.2011.6133850
DO - 10.1109/GLOCOM.2011.6133850
M3 - Conference contribution
AN - SCOPUS:84857209316
SN - 9781424492688
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - 2011 IEEE Global Telecommunications Conference, GLOBECOM 2011
T2 - 54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011
Y2 - 5 December 2011 through 9 December 2011
ER -