Download now Free registration required
The authors study the problem of relay selection in a wireless cooperative network. Assuming a single source, a single destination, and N uniformly distributed candidate relays, they seek to select a set of cooperating relays to minimize the total transmission time of a fixed amount of data. They propose two selection methods: Best expectation, which adaptively selects the relays, and Best-m, which selects an optimally pre-determined number of relays. Each method is implemented with a simple and optimal algorithm. They further provide closed-form, analytical approximations of these algorithms' performance, which help simplify the process of finding the optimal number of cooperating relays.
- Format: PDF
- Size: 115.4 KB