Using a relaying system to provide spatial diversity and improve the system performance is a tendency in the wireless cooperative communications. Amplify-and-forward(AF) mode with a low complexity is easy to be implemented. Under the consideration of cooperative communication systems, the scenario includes one information source, M relay stations and N destinations. This work proposes a relay selection algorithm in the Raleigh fading channel. Based on the exhaustive search method, easily to realize, the optimal selection scheme can be found with a highly complicated calculation. In order to reduce the computational complexity, an approximate optimal solution with a greedy algorithm applied for the relay station selection is proposed. With different situations of the communication systems, the performance evaluation obtained by both the proposed algorithm and the exhaustive search algorithm are given for comparison. It shows the proposed algorithm could provide a solution approach to the optimal one. Using a relaying system to provide spatial diversity and improve the system performance is a tendency in the wireless cooperative communications. Amplify-and-forward (AF) mode with low complexity is easy to be implemented. Under the consideration of cooperative communication systems, the This work proposes a relay selection algorithm in the Raleigh fading channel. Based on the exhaustive search method, easily to realize, the optimal selection scheme can be found with a highly complicated calculation. In order to reduce the computational complexity, an approximate optimal solution with a greedy algorithm applied for the relay station selection is a proposed comparison. It shows the proposed algorithm could provide a solution approach to th e optimal one.