Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Transactions on Vehicular Technology

On the SDoF for Multiple Full-Duplex MIMO Users Pair-Wise Communications

Qingpeng Liang, Linsong Du, Meng Hua, Zheng Ma

Published Mar 24, 2025• 1 citation
Publisher

Abstract

This paper explores the pair-wise secure degree of freedom (SDoF) of a network with multiple full-duplex multiple-input multiple-output nodes, where the nodes communicate with each other while being wiretapped by a multi-antenna eavesdropper. This paper aims to fill the gap in the theoretical analysis of the optimal pair-wise SDoF of multiple full-duplex node systems from an information theory perspective when the channel state information remains unknown to each node at the beginning of the coherence interval. To this end, we first derive an upper bound of the achievable SDoF of the system using the optimal signal structure of the pair-wise secrecy rate. Then, by demonstrating that the upper bound is achievable using Gaussian signals, the optimal SDoF of the system is derived. The numerical results verify that the obtained optimal pair-wise SDoF extends the existing research with two legitimate nodes and increases the optimal SDoF by adjusting the number of out-of-pair transmit antennas appropriately.

DOI
10.1109/tvt.2025.3550467

Related papers

Secure Degrees of Freedom for Wireless Networks With Multiple Full-Duplex Nodes Employing Variable Antennas and Collaborative Pilots

Qingpeng Liang, Shuo Wu, Linsong Du +2 more

This paper examines the secure degree of freedom (SDoF) bound of a wireless network, where multiple legitimate full-duplex nodes communicate with each other while being wiretapped by a multiple antenna eavesdropper. The network adopts the anti-eavesdropping channel estimation (ANECE) scheme to realize physical security by using the channel estimation cost of Eve. Especially, the legitimate node that completes channel estimation first begins receiving messages from its counterpart, such that the eavesdropper requires more time for channel estimation. The secrecy rate and secret-key rate (SKR) bound are shown to be equivalent to the sum of the transmission rate and channel-state-information term. Then we employ the asymptotic limit analysis and properties of mutual information to determine the optimal SDoF of the SKR upper and lower bounds, as well as the optimal SDoF of the secrecy rate of the ANECE scheme. According to the analysis result, the secret-key generation scheme is able to increase the achievable secrecy rate compared to secrecy message transmission. Besides, by treating the number of the active transmit antennas on each node as a variable, the considered scheme with the first-come first-served and feasible transmission antennas outperforms the ANECE scheme with equal transmission and receive antennas. Especially, the SDoF of the considered scheme increases with the number of legitimate nodes, while the existing ANECE scheme tends to zero due to the effect of interference between the legitimate nodes.

IEEE Transactions on Wireless Communications•Jan 1, 2026•0 citations

Secure Degree of Freedom Bound of Secret-Key Capacity for Two-Way Wiretap Channel

Qingpeng Liang, Linsong Du, Yanzhi Wu +1 more

This letter focuses on the optimal sum secure degree of freedom (SDoF) in a two-way wiretap channel (TW-WC), wherein two legitimate full-duplex multiple-antenna nodes cooperate with each other and are wiretapped by a multiple antenna eavesdropper simultaneously. It aims to find the optimal sum SDoF pertaining to secret-key capacity for the TW-WC. First, we analyze the upper bound and lower bounds of the optimal sum SDoF by establishing their equivalence to the expression of the optimal SDoF corresponding to the secrecy rate for the TW-WC. Subsequently, in scenarios where the legitimate nodes are configured with an equal number of transmit and receive antennas, it is elucidated that the upper and lower bounds of the optimal SDoF converge. Furthermore, the findings suggest that a higher SDoF can be achieved than the existing works, thereby heralding an enhancement in secure spectral efficiency.

IEEE Signal Processing Letters•Jan 1, 2025•1 citation

Secure Degrees of Freedom of MIMO Two-Way Wiretap Channel With no CSI Anywhere

Qingpeng Liang, Donglin Liu, Jiangping Hu

This article considers a two-way multiple-input multiple-output (MIMO) Rayleigh block fading wiretap channel with two full-duplex nodes (Alice and Bob) exchanging messages simultaneously and wiretapped by a $ {N}_{ {e}}$ -antennas eavesdropper (Eve). The channel state remains unchanged over a coherence interval T and is unknown to all terminals, including Alice, Bob, and Eve, at the beginning of the coherence interval. We first show the expression of the optimal signal waveform for Alice and Bob, which maximizes the sum secrecy rate, should be the products of independent random diagonal matrices and isotropically distributed unitary matrices. Then, conditioned on large T and small $ {N}_{ {e}}$ , the upper-bound for the secure degree of freedom (s.d.o.f.) of the two-way wiretap channel is derived, and a constant-norm-signaling (CNS) scheme is presented to achieve this theoretical bound. Finally, we formulate an optimization problem of the s.d.o.f. achieved by the CNS scheme for general cases with arbitrary T and $ {N}_{ {e}}$ , and solve this problem by exploring the monotonicity of the achievable s.d.o.f.. Our result shows that the optimal s.d.o.f. can be independent of coherence time T and becomes the product of the numbers of legitimate nodes's transmitter antennas (NLNTA) for large $ {N}_{ {e}}$ and small NLNTA.

IEEE Transactions on Wireless Communications•Aug 25, 2020•9 citations

Secure Degree of Freedom of Wireless Networks Using Collaborative Pilots

Yingbo Hua, Qingpeng Liang, Md Saydur Rahman

A wireless network of full-duplex nodes/users, using anti-eavesdropping channel estimation (ANECE) based on collaborative pilots, can yield a positive secure degree-of-freedom (SDoF) regardless of the number of antennas an eavesdropper may have. This paper presents novel results on SDoF of ANECE by analyzing secret-key capacity (SKC) of each pair of nodes in a network of multiple collaborative nodes per channel coherence period. Each transmission session of ANECE has two phases: phase 1 is used for pilots, and phase 2 is used for random symbols. This results in two parts of SDoF of ANECE. Both lower and upper bounds on the SDoF of ANECE for any number of users are shown, and the conditions for the two bounds to meet are given. This leads to important discoveries, including: a) The phase-1 SDoF is the same for both multi-user ANECE and pair-wise ANECE while the former may require only a fraction of the number of time slots needed by the latter; b) For a three-user network, the phase-2 SDoF of all-user ANECE is generally larger than that of pair-wise ANECE; c) For a two-user network, a modified ANECE deploying square-shaped nonsingular pilot matrices yields a higher total SDoF than the original ANECE. The multi-user ANECE and the modified two-user ANECE shown in this paper appear to be the best full-duplex schemes known today in terms of SDoF subject to each node using a given number of antennas for both transmitting and receiving.

arXiv:2309.12502•IEEE Transactions on Signal Processing•Jan 1, 2023•5 citations

Secrecy for MIMO wiretap and MIMO broadcast channels with fading eavesdroppers: CSI does not increase the secure DoF

Mohamed Amir, Tamer M. Khattab, Tarek Elfouly +1 more

We investigate the secure degrees of freedom (SDoF) of the wiretap and the K user Gaussian broadcast channels with multiple antennas at the transmitter, the legitimate receivers and an unknown number of eavesdroppers each with a number of antennas less than or equal to a known value NE. The channel matrices between the legitimate transmitter and the receivers are available everywhere, while the legitimate pair have no information about the eavesdroppers' channels. We provide the exact sum SDoF for the considered system. A new comprehensive upperbound is deduced and a new achievable scheme based on utilizing jamming is exploited. We prove that cooperative jamming is SDoF optimal even without the eavesdropper CSI available at the transmitters.

IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)•Aug 1, 2015•6 citations

Secure Degrees of Freedom of the MIMO Multiple Access Channel with Multiple unknown Eavesdroppers

Mohamed Amir, Tamer M. Khattab, Tarek Elfouly +1 more

We investigate the secure degrees of freedom (SDoF) of a two-transmitter Gaussian multiple access channel with multiple antennas at the transmitters, the legitimate receiver with the existence of an unknown number of eavesdroppers each with a number of antennas less than or equal to a known value $N_E$. The channel matrices between the legitimate transmitters and the receiver are available everywhere, while the legitimate pair does not know the eavesdroppers' channels matrices. We provide the exact sum SDoF for the considered system. A new comprehensive upperbound is deduced and a new achievable scheme based on utilizing jamming is exploited. We prove that Cooperative Jamming is SDoF optimal even without the instantaneous eavesdropper CSI available at the transmitters.

arXiv:1404.5007•Apr 20, 2014•5 citations
This paper explores the pair-wise secure degree of freedom (SDoF) of a network with multiple full-duplex multiple-input multiple-output nodes, where the nodes communicate with each other while being wiretapped by a multi-antenna eavesdropper. This paper aims to fill the gap in the theoretical analysis of the optimal pair-wise SDoF of multiple full-duplex node systems from an information theory perspective when the channel state information remains unknown to each node at the beginning of the coherence interval. To this end, we first derive an upper bound of the achievable SDoF of the system using the optimal signal structure of the pair-wise secrecy rate. Then, by demonstrating that the upper bound is achievable using Gaussian signals, the optimal SDoF of the system is derived. The numerical results verify that the obtained optimal pair-wise SDoF extends the existing research with two legitimate nodes and increases the optimal SDoF by adjusting the number of out-of-pair transmit antennas appropriately.
This paper examines the secure degree of freedom (SDoF) bound of a wireless network, where multiple legitimate full-duplex nodes communicate with each other while being wiretapped by a multiple antenna eavesdropper. The network adopts the anti-eavesdropping channel estimation (ANECE) scheme to realize physical security by using the channel estimation cost of Eve. Especially, the legitimate node that completes channel estimation first begins receiving messages from its counterpart, such that the eavesdropper requires more time for channel estimation. The secrecy rate and secret-key rate (SKR) bound are shown to be equivalent to the sum of the transmission rate and channel-state-information term. Then we employ the asymptotic limit analysis and properties of mutual information to determine the optimal SDoF of the SKR upper and lower bounds, as well as the optimal SDoF of the secrecy rate of the ANECE scheme. According to the analysis result, the secret-key generation scheme is able to increase the achievable secrecy rate compared to secrecy message transmission. Besides, by treating the number of the active transmit antennas on each node as a variable, the considered scheme with the first-come first-served and feasible transmission antennas outperforms the ANECE scheme with equal transmission and receive antennas. Especially, the SDoF of the considered scheme increases with the number of legitimate nodes, while the existing ANECE scheme tends to zero due to the effect of interference between the legitimate nodes.
This letter focuses on the optimal sum secure degree of freedom (SDoF) in a two-way wiretap channel (TW-WC), wherein two legitimate full-duplex multiple-antenna nodes cooperate with each other and are wiretapped by a multiple antenna eavesdropper simultaneously. It aims to find the optimal sum SDoF pertaining to secret-key capacity for the TW-WC. First, we analyze the upper bound and lower bounds of the optimal sum SDoF by establishing their equivalence to the expression of the optimal SDoF corresponding to the secrecy rate for the TW-WC. Subsequently, in scenarios where the legitimate nodes are configured with an equal number of transmit and receive antennas, it is elucidated that the upper and lower bounds of the optimal SDoF converge. Furthermore, the findings suggest that a higher SDoF can be achieved than the existing works, thereby heralding an enhancement in secure spectral efficiency.
This article considers a two-way multiple-input multiple-output (MIMO) Rayleigh block fading wiretap channel with two full-duplex nodes (Alice and Bob) exchanging messages simultaneously and wiretapped by a $ {N}_{ {e}}$ -antennas eavesdropper (Eve). The channel state remains unchanged over a coherence interval T and is unknown to all terminals, including Alice, Bob, and Eve, at the beginning of the coherence interval. We first show the expression of the optimal signal waveform for Alice and Bob, which maximizes the sum secrecy rate, should be the products of independent random diagonal matrices and isotropically distributed unitary matrices. Then, conditioned on large T and small $ {N}_{ {e}}$ , the upper-bound for the secure degree of freedom (s.d.o.f.) of the two-way wiretap channel is derived, and a constant-norm-signaling (CNS) scheme is presented to achieve this theoretical bound. Finally, we formulate an optimization problem of the s.d.o.f. achieved by the CNS scheme for general cases with arbitrary T and $ {N}_{ {e}}$ , and solve this problem by exploring the monotonicity of the achievable s.d.o.f.. Our result shows that the optimal s.d.o.f. can be independent of coherence time T and becomes the product of the numbers of legitimate nodes's transmitter antennas (NLNTA) for large $ {N}_{ {e}}$ and small NLNTA.
A wireless network of full-duplex nodes/users, using anti-eavesdropping channel estimation (ANECE) based on collaborative pilots, can yield a positive secure degree-of-freedom (SDoF) regardless of the number of antennas an eavesdropper may have. This paper presents novel results on SDoF of ANECE by analyzing secret-key capacity (SKC) of each pair of nodes in a network of multiple collaborative nodes per channel coherence period. Each transmission session of ANECE has two phases: phase 1 is used for pilots, and phase 2 is used for random symbols. This results in two parts of SDoF of ANECE. Both lower and upper bounds on the SDoF of ANECE for any number of users are shown, and the conditions for the two bounds to meet are given. This leads to important discoveries, including: a) The phase-1 SDoF is the same for both multi-user ANECE and pair-wise ANECE while the former may require only a fraction of the number of time slots needed by the latter; b) For a three-user network, the phase-2 SDoF of all-user ANECE is generally larger than that of pair-wise ANECE; c) For a two-user network, a modified ANECE deploying square-shaped nonsingular pilot matrices yields a higher total SDoF than the original ANECE. The multi-user ANECE and the modified two-user ANECE shown in this paper appear to be the best full-duplex schemes known today in terms of SDoF subject to each node using a given number of antennas for both transmitting and receiving.
We investigate the secure degrees of freedom (SDoF) of the wiretap and the K user Gaussian broadcast channels with multiple antennas at the transmitter, the legitimate receivers and an unknown number of eavesdroppers each with a number of antennas less than or equal to a known value NE. The channel matrices between the legitimate transmitter and the receivers are available everywhere, while the legitimate pair have no information about the eavesdroppers' channels. We provide the exact sum SDoF for the considered system. A new comprehensive upperbound is deduced and a new achievable scheme based on utilizing jamming is exploited. We prove that cooperative jamming is SDoF optimal even without the eavesdropper CSI available at the transmitters.
We investigate the secure degrees of freedom (SDoF) of a two-transmitter Gaussian multiple access channel with multiple antennas at the transmitters, the legitimate receiver with the existence of an unknown number of eavesdroppers each with a number of antennas less than or equal to a known value NEN_ENE​. The channel matrices between the legitimate transmitters and the receiver are available everywhere, while the legitimate pair does not know the eavesdroppers' channels matrices. We provide the exact sum SDoF for the considered system. A new comprehensive upperbound is deduced and a new achievable scheme based on utilizing jamming is exploited. We prove that Cooperative Jamming is SDoF optimal even without the instantaneous eavesdropper CSI available at the transmitters.