TY - GEN
T1 - Wireless MIMO switching with trusted and untrusted relays
T2 - IEEE International Conference on Communications, ICC 2015
AU - Wang, Fanggang
AU - Yuan, Xiaojun
AU - Lee, Jemin
AU - Quek, Tony Q.S.
N1 - Publisher Copyright:
© 2015 IEEE.
Copyright:
Copyright 2016 Elsevier B.V., All rights reserved.
PY - 2015/9/9
Y1 - 2015/9/9
N2 - We investigate the degrees of freedom (DoF) and secrecy DoF for a general framework of multiway relay networks named wireless MIMO switching, where a number of users exchange information via a common relay. Each round of data exchange consists of one uplink transmission from users to relay and one downlink transmission from relay back to users. The data exchange model is unicast, i.e., every user transmits one message and intends to receive one message from one other user. We categorize unicast patterns using the notion of orbit borrowed from abstract algebra. Roughly speaking, an orbit is a minimum subset of users such that data exchange is closed within this subset. We analyze the achievable DoF of wireless MIMO switching with various numbers of orbits. Particularly, the DoF capacity for unicast with one and two orbits are established. Furthermore, we study communication secrecy with an untrusted relay in wireless MIMO switching. We present an achievable secrecy sum rate and the corresponding achievable secrecy DoF by assuming a non-regenerative relay. Then, we focus on unicast patterns with one and two orbits, and show that this achievable lower bound is actually the secrecy DoF capacity based on a novel genie-aided technique. Our results build a bridge between the DoF and the secrecy DoF in multiway relaying. The methodology of the proof can be generally applied to analyze the secrecy DoF in other relay networks.
AB - We investigate the degrees of freedom (DoF) and secrecy DoF for a general framework of multiway relay networks named wireless MIMO switching, where a number of users exchange information via a common relay. Each round of data exchange consists of one uplink transmission from users to relay and one downlink transmission from relay back to users. The data exchange model is unicast, i.e., every user transmits one message and intends to receive one message from one other user. We categorize unicast patterns using the notion of orbit borrowed from abstract algebra. Roughly speaking, an orbit is a minimum subset of users such that data exchange is closed within this subset. We analyze the achievable DoF of wireless MIMO switching with various numbers of orbits. Particularly, the DoF capacity for unicast with one and two orbits are established. Furthermore, we study communication secrecy with an untrusted relay in wireless MIMO switching. We present an achievable secrecy sum rate and the corresponding achievable secrecy DoF by assuming a non-regenerative relay. Then, we focus on unicast patterns with one and two orbits, and show that this achievable lower bound is actually the secrecy DoF capacity based on a novel genie-aided technique. Our results build a bridge between the DoF and the secrecy DoF in multiway relaying. The methodology of the proof can be generally applied to analyze the secrecy DoF in other relay networks.
UR - https://www.scopus.com/pages/publications/84953791290
UR - https://www.scopus.com/pages/publications/84953791290#tab=citedBy
U2 - 10.1109/ICC.2015.7249106
DO - 10.1109/ICC.2015.7249106
M3 - Conference contribution
AN - SCOPUS:84953791290
T3 - IEEE International Conference on Communications
SP - 4943
EP - 4948
BT - 2015 IEEE International Conference on Communications, ICC 2015
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 8 June 2015 through 12 June 2015
ER -