Dynamic Programming for Route Selection in Multihop Fixed Gain Amplify-and-Forward Relay Networks

In this paper, an efficient algorithm for selecting a route in a multihop amplify-and-forward (AF) relay network is presented. In particular, a route selection strategy that minimizes the outage probability of the network is proposed. By providing a recursive method to calculate the outage probability, we demonstrate how the algorithm can be implemented based on a dynamic programming approach wherein the relays compute and compare path metrics on a hop-by-hop basis. Simulation results are provided to verify the performance and efficiency of the proposed method relative to other existing approaches.