A (0, 1)-quadratic programming based relay selection method

In this paper, the problem of relay selection is considered for a wireless network consisting of one transmit source, one destination and R relays. For such a network, assuming that channel state information is available, we propose a new multiple relay selection approach. In our approach, the receive quality-of-service at the destination is maximized while keeping the individual relay transmit power below a predefined threshold. The resultant problem does not have closed-form solutions but can be formulated as a quasi-convex problem which can be efficiently solved using bi-section search method and semidefinite programming (SDP). Simulation results show that the proposed methods provide better performance than the relay selection methods proposed before.