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

Amir Minayi Jalil; Vahid Meghdadi; Ali Ghrayeb; Jean Pierre Cances

doi:10.1109/PIMRC.2011.6139811

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

Amir Minayi Jalil^*, Vahid Meghdadi, Ali Ghrayeb, Jean Pierre Cances

^*Corresponding author for this work

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

7 Citations (Scopus)

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	https://doi.org/10.1109/PIMRC.2011.6139811
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 Sept 2011 → 14 Sept 2011

Publication series

Name	IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC

Conference

Conference	2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'11
Country/Territory	Canada
City	Toronto, ON
Period	11/09/11 → 14/09/11

Access to Document

10.1109/PIMRC.2011.6139811

Cite this

Minayi Jalil, A., Meghdadi, V., Ghrayeb, A., & Cances, J. P. (2011). A simple optimal solution for relay assignment in cooperative systems based on the max-min criterion. In 2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'11 (pp. 1768-1772). Article 6139811 (IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC). https://doi.org/10.1109/PIMRC.2011.6139811

Minayi Jalil, Amir ; Meghdadi, Vahid ; Ghrayeb, Ali et al. / A simple optimal solution for relay assignment in cooperative systems based on the max-min criterion. 2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'11. 2011. pp. 1768-1772 (IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC).

@inproceedings{3cb3411ff5374cee932f1a43b981aeba,

title = "A simple optimal solution for relay assignment in cooperative systems based on the max-min criterion",

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.",

author = "{Minayi Jalil}, Amir and Vahid Meghdadi and Ali Ghrayeb and Cances, {Jean Pierre}",

year = "2011",

doi = "10.1109/PIMRC.2011.6139811",

language = "English",

isbn = "9781457713484",

series = "IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC",

pages = "1768--1772",

booktitle = "2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'11",

note = "2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'11 ; Conference date: 11-09-2011 Through 14-09-2011",

}

Minayi Jalil, A, Meghdadi, V, Ghrayeb, A & Cances, JP 2011, A simple optimal solution for relay assignment in cooperative systems based on the max-min criterion. in 2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'11., 6139811, IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC, pp. 1768-1772, 2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'11, Toronto, ON, Canada, 11/09/11. 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 et al.
2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'11. 2011. p. 1768-1772 6139811 (IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC).

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

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

U2 - 10.1109/PIMRC.2011.6139811

DO - 10.1109/PIMRC.2011.6139811

M3 - Conference contribution

AN - SCOPUS:84857511540

SN - 9781457713484

T3 - IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC

SP - 1768

EP - 1772

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

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

Y2 - 11 September 2011 through 14 September 2011

ER -

Minayi Jalil A, Meghdadi V, Ghrayeb A, Cances JP. A simple optimal solution for relay assignment in cooperative systems based on the max-min criterion. In 2011 IEEE 22nd International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC'11. 2011. p. 1768-1772. 6139811. (IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC). doi: 10.1109/PIMRC.2011.6139811

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

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this