Download now Free registration required
In this paper, the authors propose a novel semi-distributed algorithm with low overhead and complexity for multi-user cooperative wireless networks with opportunistic relaying. The source is required to satisfy its minimum rate requirement with a feasible relay and help another source as a relay. The optimal solution can be obtained by exhaustive search with intractable computational complexity. Simulation results suggest that the proposed relay selection algorithm has the similar outage probability as the exhaustive search approach but with much less computational burden.
- Format: PDF
- Size: 327.6 KB