TY - GEN
T1 - Jointly optimal power assignment for multi-source multi-destination relay networks
AU - Chen, Fuyu
AU - Su, Weifeng
AU - Batalama, Stella N.
AU - Matyjas, John D.
PY - 2010
Y1 - 2010
N2 - In this paper, the total transmission power of a multi-source multi-destination relay network is minimized under the constraint that the signal to interference plus noise ratio (SINR) requirement of each source-destination pair is satisfied. The optimization problem involves K power variables, where K is the number of source-destination pairs in the network, and an exhaustive search is prohibitive for large K. In this work, we develop an asymptotically tight approximation of the SINR that allows us to reformulate the original optimization problem to a single-variable optimization problem, which can be easily solved by numerical search of the single variable. Then, the corresponding optimal transmission power at each source and relay can be calculated directly. The proposed optimization scheme is scalable and leads to a power assignment algorithm that exhibits the same optimization complexity for any number (K) of source-destination pairs in the network. Moreover, for the special case of transmission over orthogonal channels, we derive analytically the solution to the optimization problem. Extensive numerical studies illustrate our theoretical developments.
AB - In this paper, the total transmission power of a multi-source multi-destination relay network is minimized under the constraint that the signal to interference plus noise ratio (SINR) requirement of each source-destination pair is satisfied. The optimization problem involves K power variables, where K is the number of source-destination pairs in the network, and an exhaustive search is prohibitive for large K. In this work, we develop an asymptotically tight approximation of the SINR that allows us to reformulate the original optimization problem to a single-variable optimization problem, which can be easily solved by numerical search of the single variable. Then, the corresponding optimal transmission power at each source and relay can be calculated directly. The proposed optimization scheme is scalable and leads to a power assignment algorithm that exhibits the same optimization complexity for any number (K) of source-destination pairs in the network. Moreover, for the special case of transmission over orthogonal channels, we derive analytically the solution to the optimization problem. Extensive numerical studies illustrate our theoretical developments.
KW - Cooperative networks
KW - Interference relay channel
KW - Multi-source multi-destination relaying
KW - Optimum power allocation
KW - Total power consumption
UR - https://www.scopus.com/pages/publications/79551639534
U2 - 10.1109/GLOCOM.2010.5683266
DO - 10.1109/GLOCOM.2010.5683266
M3 - Conference contribution
AN - SCOPUS:79551639534
SN - 9781424456383
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - 2010 IEEE Global Telecommunications Conference, GLOBECOM 2010
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 53rd IEEE Global Communications Conference, GLOBECOM 2010
Y2 - 6 December 2010 through 10 December 2010
ER -