Abstract:

This paper studies the problem of multiple relay selection in multiple parallel dual-hop amplify-and-forward（AF） relay networks.The problem is first formulated as a nonlinear integer programming （NLIP）problem,with the objective of maximizing signal-to-noise ratio（SNR）at destination node.This problem is NP-hard and optimal solution via exhaustive scheme is obviously time-inefficient for its intolerable exponential complexity.Then,a ε-global optimal solution algorithm based on a branch-and-bound architecture is proposed to resolve the NLIP problem with the employment the reformulation-linearization technique（RLT）.Numerical results indicate that the proposed algorithm can achieve global optimal solution with predefined accuracy ε.The solution via this proposed algorithm can work as a benchmark for other algorithms.

Key words: multiple relay selection, SNR maximization, nonlinear integral programming, branch-and-bound, reformulation-linearization technique