### Abstract

This paper deals with relay assignment in cooperative networks based on the max-min criterion. A simple algorithm is proposed in order to find the optimum relay assignment permutation to avoid brute-force prohibitive search method. It is assumed that there are N source-destination pairs and M relays in the network. The problem is how to assign each relay to a source-destination pair in order to achieve the highest diversity order. The proposed algorithm achieves the maximum spatial diversity for all of the nodes and leads us to simplify the analysis and simulation of the optimal answer. It is shown that the Probability Density Function (PDF) of the end-to-end signal-to-noise ratio (SNR) after relay assignment can be expressed as a weighted sum of the order statistics of the PDF of individual end-to-end links. Since the analytical calculation of the weighting coefficients in the mentioned weighting sum becomes difficult, we propose an approximation in order to calculate the mentioned weighting coefficients. The validity of this fit is shown through some simulations.

Original language | English |
---|---|

Title of host publication | 2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'11 |

Pages | 1768-1772 |

Number of pages | 5 |

DOIs | |

Publication status | Published - 2011 |

Externally published | Yes |

Event | 2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'11 - Toronto, ON, Canada Duration: 11 Sep 2011 → 14 Sep 2011 |

### Other

Other | 2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'11 |
---|---|

Country | Canada |

City | Toronto, ON |

Period | 11/9/11 → 14/9/11 |

### Fingerprint

### ASJC Scopus subject areas

- Electrical and Electronic Engineering

### Cite this

*2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'11*(pp. 1768-1772). [6139811] https://doi.org/10.1109/PIMRC.2011.6139811

**A simple optimal solution for relay assignment in cooperative systems based on the max-min criterion.** / Minayi Jalil, Amir; Meghdadi, Vahid; Ghrayeb, Ali; Cances, Jean Pierre.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'11.*, 6139811, pp. 1768-1772, 2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'11, Toronto, ON, Canada, 11/9/11. https://doi.org/10.1109/PIMRC.2011.6139811

}

TY - GEN

T1 - A simple optimal solution for relay assignment in cooperative systems based on the max-min criterion

AU - Minayi Jalil, Amir

AU - Meghdadi, Vahid

AU - Ghrayeb, Ali

AU - Cances, Jean Pierre

PY - 2011

Y1 - 2011

N2 - This paper deals with relay assignment in cooperative networks based on the max-min criterion. A simple algorithm is proposed in order to find the optimum relay assignment permutation to avoid brute-force prohibitive search method. It is assumed that there are N source-destination pairs and M relays in the network. The problem is how to assign each relay to a source-destination pair in order to achieve the highest diversity order. The proposed algorithm achieves the maximum spatial diversity for all of the nodes and leads us to simplify the analysis and simulation of the optimal answer. It is shown that the Probability Density Function (PDF) of the end-to-end signal-to-noise ratio (SNR) after relay assignment can be expressed as a weighted sum of the order statistics of the PDF of individual end-to-end links. Since the analytical calculation of the weighting coefficients in the mentioned weighting sum becomes difficult, we propose an approximation in order to calculate the mentioned weighting coefficients. The validity of this fit is shown through some simulations.

AB - This paper deals with relay assignment in cooperative networks based on the max-min criterion. A simple algorithm is proposed in order to find the optimum relay assignment permutation to avoid brute-force prohibitive search method. It is assumed that there are N source-destination pairs and M relays in the network. The problem is how to assign each relay to a source-destination pair in order to achieve the highest diversity order. The proposed algorithm achieves the maximum spatial diversity for all of the nodes and leads us to simplify the analysis and simulation of the optimal answer. It is shown that the Probability Density Function (PDF) of the end-to-end signal-to-noise ratio (SNR) after relay assignment can be expressed as a weighted sum of the order statistics of the PDF of individual end-to-end links. Since the analytical calculation of the weighting coefficients in the mentioned weighting sum becomes difficult, we propose an approximation in order to calculate the mentioned weighting coefficients. The validity of this fit is shown through some simulations.

UR - http://www.scopus.com/inward/record.url?scp=84857511540&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84857511540&partnerID=8YFLogxK

U2 - 10.1109/PIMRC.2011.6139811

DO - 10.1109/PIMRC.2011.6139811

M3 - Conference contribution

AN - SCOPUS:84857511540

SN - 9781457713484

SP - 1768

EP - 1772

BT - 2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'11

ER -