User Pair-Relay Matching in a Multiple User Pair and Multiple Untrusted Relay Network*

Rugui Yao; Doudou Song; Lukun Yao; Theodoros A. Tsiftsis; Nikolaos I. Miridakis; Nan Qi; Xiaoya Zuo; Danian Lou

doi:10.1109/WCSP49889.2020.9299852

User Pair-Relay Matching in a Multiple User Pair and Multiple Untrusted Relay Network*

Rugui Yao, Doudou Song, Lukun Yao, Theodoros A. Tsiftsis, Nikolaos I. Miridakis, Nan Qi, Xiaoya Zuo, Danian Lou

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

Abstract

In this paper, considering a multi-user pair and multi-untrusted relay two-way transmission network, a user pair-relay matching scheme is proposed. To maximize the achievable secrecy rate and reduce the complexity, we model the proposed matching problem as a bipartite graph and utilize the Kuhn-Munkres (KM) algorithm to find the maximum weighted complete matching. Furthermore, considering the fairness among the user pairs, we put a constraint on the minimum quality of service (QoS) requirements into the previous optimization problem. The existence of optimal matching is studied and the corresponding optimal solution is then presented after modifying the weight matrix. Simulation results finally validate that the proposed matching schemes can achieve improvement of average secrecy rate and harvest the diversity with more relays.

Original language	English
Title of host publication	12th International Conference on Wireless Communications and Signal Processing, WCSP 2020
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	149-153
Number of pages	5
ISBN (Electronic)	9781728172361
DOIs	https://doi.org/10.1109/WCSP49889.2020.9299852
Publication status	Published - 21 Oct 2020
Externally published	Yes
Event	12th International Conference on Wireless Communications and Signal Processing, WCSP 2020 - Nanjing, China Duration: 21 Oct 2020 → 23 Oct 2020

Publication series

Name	12th International Conference on Wireless Communications and Signal Processing, WCSP 2020

Conference

Conference	12th International Conference on Wireless Communications and Signal Processing, WCSP 2020
Country/Territory	China
City	Nanjing
Period	21/10/20 → 23/10/20

Keywords

bipartite graph
relay matching
secrecy rate

ASJC Scopus subject areas

Artificial Intelligence
Computer Networks and Communications
Signal Processing
Information Systems and Management
Safety, Risk, Reliability and Quality

Access to Document

10.1109/WCSP49889.2020.9299852

Cite this

Yao, R., Song, D., Yao, L., Tsiftsis, T. A., Miridakis, N. I., Qi, N., Zuo, X., & Lou, D. (2020). User Pair-Relay Matching in a Multiple User Pair and Multiple Untrusted Relay Network*. In 12th International Conference on Wireless Communications and Signal Processing, WCSP 2020 (pp. 149-153). Article 9299852 (12th International Conference on Wireless Communications and Signal Processing, WCSP 2020). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/WCSP49889.2020.9299852

Yao, Rugui ; Song, Doudou ; Yao, Lukun et al. / User Pair-Relay Matching in a Multiple User Pair and Multiple Untrusted Relay Network*. 12th International Conference on Wireless Communications and Signal Processing, WCSP 2020. Institute of Electrical and Electronics Engineers Inc., 2020. pp. 149-153 (12th International Conference on Wireless Communications and Signal Processing, WCSP 2020).

@inproceedings{37c6633af5e049a3a022e8489c988a29,

title = "User Pair-Relay Matching in a Multiple User Pair and Multiple Untrusted Relay Network*",

abstract = "In this paper, considering a multi-user pair and multi-untrusted relay two-way transmission network, a user pair-relay matching scheme is proposed. To maximize the achievable secrecy rate and reduce the complexity, we model the proposed matching problem as a bipartite graph and utilize the Kuhn-Munkres (KM) algorithm to find the maximum weighted complete matching. Furthermore, considering the fairness among the user pairs, we put a constraint on the minimum quality of service (QoS) requirements into the previous optimization problem. The existence of optimal matching is studied and the corresponding optimal solution is then presented after modifying the weight matrix. Simulation results finally validate that the proposed matching schemes can achieve improvement of average secrecy rate and harvest the diversity with more relays.",

keywords = "bipartite graph, relay matching, secrecy rate",

author = "Rugui Yao and Doudou Song and Lukun Yao and Tsiftsis, \{Theodoros A.\} and Miridakis, \{Nikolaos I.\} and Nan Qi and Xiaoya Zuo and Danian Lou",

note = "Publisher Copyright: {\textcopyright} 2020 IEEE.; 12th International Conference on Wireless Communications and Signal Processing, WCSP 2020 ; Conference date: 21-10-2020 Through 23-10-2020",

year = "2020",

month = oct,

day = "21",

doi = "10.1109/WCSP49889.2020.9299852",

language = "English",

series = "12th International Conference on Wireless Communications and Signal Processing, WCSP 2020",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "149--153",

booktitle = "12th International Conference on Wireless Communications and Signal Processing, WCSP 2020",

address = "United States",

}

Yao, R, Song, D, Yao, L, Tsiftsis, TA, Miridakis, NI, Qi, N, Zuo, X & Lou, D 2020, User Pair-Relay Matching in a Multiple User Pair and Multiple Untrusted Relay Network*. in 12th International Conference on Wireless Communications and Signal Processing, WCSP 2020., 9299852, 12th International Conference on Wireless Communications and Signal Processing, WCSP 2020, Institute of Electrical and Electronics Engineers Inc., pp. 149-153, 12th International Conference on Wireless Communications and Signal Processing, WCSP 2020, Nanjing, China, 21/10/20. https://doi.org/10.1109/WCSP49889.2020.9299852

User Pair-Relay Matching in a Multiple User Pair and Multiple Untrusted Relay Network*. / Yao, Rugui; Song, Doudou; Yao, Lukun et al.
12th International Conference on Wireless Communications and Signal Processing, WCSP 2020. Institute of Electrical and Electronics Engineers Inc., 2020. p. 149-153 9299852 (12th International Conference on Wireless Communications and Signal Processing, WCSP 2020).

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

TY - GEN

T1 - User Pair-Relay Matching in a Multiple User Pair and Multiple Untrusted Relay Network*

AU - Yao, Rugui

AU - Song, Doudou

AU - Yao, Lukun

AU - Tsiftsis, Theodoros A.

AU - Miridakis, Nikolaos I.

AU - Qi, Nan

AU - Zuo, Xiaoya

AU - Lou, Danian

PY - 2020/10/21

Y1 - 2020/10/21

N2 - In this paper, considering a multi-user pair and multi-untrusted relay two-way transmission network, a user pair-relay matching scheme is proposed. To maximize the achievable secrecy rate and reduce the complexity, we model the proposed matching problem as a bipartite graph and utilize the Kuhn-Munkres (KM) algorithm to find the maximum weighted complete matching. Furthermore, considering the fairness among the user pairs, we put a constraint on the minimum quality of service (QoS) requirements into the previous optimization problem. The existence of optimal matching is studied and the corresponding optimal solution is then presented after modifying the weight matrix. Simulation results finally validate that the proposed matching schemes can achieve improvement of average secrecy rate and harvest the diversity with more relays.

AB - In this paper, considering a multi-user pair and multi-untrusted relay two-way transmission network, a user pair-relay matching scheme is proposed. To maximize the achievable secrecy rate and reduce the complexity, we model the proposed matching problem as a bipartite graph and utilize the Kuhn-Munkres (KM) algorithm to find the maximum weighted complete matching. Furthermore, considering the fairness among the user pairs, we put a constraint on the minimum quality of service (QoS) requirements into the previous optimization problem. The existence of optimal matching is studied and the corresponding optimal solution is then presented after modifying the weight matrix. Simulation results finally validate that the proposed matching schemes can achieve improvement of average secrecy rate and harvest the diversity with more relays.

KW - bipartite graph

KW - relay matching

KW - secrecy rate

UR - https://www.scopus.com/pages/publications/85099457457

U2 - 10.1109/WCSP49889.2020.9299852

DO - 10.1109/WCSP49889.2020.9299852

M3 - Conference contribution

AN - SCOPUS:85099457457

T3 - 12th International Conference on Wireless Communications and Signal Processing, WCSP 2020

SP - 149

EP - 153

BT - 12th International Conference on Wireless Communications and Signal Processing, WCSP 2020

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 12th International Conference on Wireless Communications and Signal Processing, WCSP 2020

Y2 - 21 October 2020 through 23 October 2020

ER -

Yao R, Song D, Yao L, Tsiftsis TA, Miridakis NI, Qi N et al. User Pair-Relay Matching in a Multiple User Pair and Multiple Untrusted Relay Network*. In 12th International Conference on Wireless Communications and Signal Processing, WCSP 2020. Institute of Electrical and Electronics Engineers Inc. 2020. p. 149-153. 9299852. (12th International Conference on Wireless Communications and Signal Processing, WCSP 2020). doi: 10.1109/WCSP49889.2020.9299852

User Pair-Relay Matching in a Multiple User Pair and Multiple Untrusted Relay Network*

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this