Optimal multiple-relay selection in dual-hop amplify-and-forward cooperative networks

Abstract

Algorithms and rules for the optimal selection of multiple amplify-and-forward relays are developed in a dual-hop cooperative network. A linear fractional programming approach is first formulated. Then, a surprisingly simple water-filling-like closed-form solution is derived, which shows many interesting properties of the optimal relay selection.