arXiv subjects

Junwei Zhang

Publications and source records attributed to Junwei Zhang.

64 records · Page 4Linked to original sources

arXiv2010

Secure Relay Beamforming over Cognitive Radio Channels

In this paper, a cognitive relay channel is considered, and amplify-and-forward (AF) relay beamforming designs in the presence of an eavesdropper and a primary user are studied. Our objective is to optimize the performance of the cognitive relay beamforming system while limiting the interference in the direction of the primary receiver and keeping the transmitted signal secret from the eavesdropper. We show that under both total and individual power constraints, the problem becomes a quasiconvex optimization problem which can be solved by interior point methods. We also propose two sub-optimal null space beamforming schemes which are obtained in a more computationally efficient way.

cs.IT↗

arXiv2010

Optimal Power Allocation for Secrecy Fading Channels Under Spectrum-Sharing Constraints

In the spectrum-sharing technology, a secondary user may utilize the primary user's licensed band as long as its interference to the primary user is below a tolerable value. In this paper, we consider a scenario in which a secondary user is operating in the presence of both a primary user and an eavesdropper. Hence, the secondary user has both interference limitations and security considerations. In such a scenario, we study the secrecy capacity limits of opportunistic spectrum-sharing channels in fading environments and investigate the optimal power allocation for the secondary user under average and peak received power constraints at the primary user with global channel side information (CSI). Also, in the absence of the eavesdropper's CSI, we study optimal power allocation under an average power constraint and propose a suboptimal on/off power control method.

cs.IT↗

arXiv2010

Collaborative Relay Beamforming for Secrecy

In this paper, collaborative use of relays to form a beamforming system and provide physical-layer security is investigated. In particular, decode-and-forward (DF) and amplify-and-forward (AF) relay beamforming designs under total and individual relay power constraints are studied with the goal of maximizing the secrecy rates when perfect channel state information (CSI) is available. In the DF scheme, the total power constraint leads to a closed-form solution, and in this case, the optimal beamforming structure is identified in the low and high signal-to-noise ratio (SNR) regimes. The beamforming design under individual relay power constraints is formulated as an optimization problem which is shown to be easily solved using two different approaches, namely semidefinite programming and second-order cone programming. A simplified and suboptimal technique which reduces the computation complexity under individual power constraints is also presented. In the AF scheme, not having analytical solutions for the optimal beamforming design under both total and individual power constraints, an iterative algorithm is proposed to numerically obtain the optimal beamforming structure and maximize the secrecy rates. Finally, robust beamforming designs in the presence of imperfect CSI are investigated for DF-based relay beamforming, and optimization frameworks are provided

cs.IT↗

arXiv2010

Relay Beamforming Strategies for Physical-Layer Security

In this paper, collaborative use of relays to form a beamforming system and provide physical-layer security is investigated. In particular, amplify-and-forward (AF) relay beamforming designs under total and individual relay power constraints are studied with the goal of maximizing the secrecy rates when perfect channel state information (CSI) is available. In the AF scheme, not having analytical solutions for the optimal beamforming design under both total and individual power constraints, an iterative algorithm is proposed to numerically obtain the optimal beamforming structure and maximize the secrecy rates. Robust beamforming designs in the presence of imperfect CSI are investigated for decode-and-forward (DF) based relay beamforming, and optimization frameworks are provided.

cs.IT↗

arXiv2010

Collaborative Relay Beamforming for Secure Broadcasting

In this paper, collaborative use of relays to form a beamforming system with the aid of perfect channel state information (CSI) and to provide communication in physicallayer security between a transmitter and two receivers is investigated. In particular, we describe decode-and-forward based null space beamforming schemes and optimize the relay weights jointly to obtain the largest secrecy rate region. Furthermore, the optimality of the proposed schemes is investigated by comparing them with the outer bound secrecy rate region

cs.IT↗

arXiv2009

Collaborative Relay Beamforming for Secrecy

In this paper, collaborative use of relays to form a beamforming system with the aid of perfect channel state information (CSI) and to provide physical-layer security is investigated. In particular, a decode-and-forward-based relay beamforming design subject to total and individual relay power constraints is studied with the goal of maximizing the secrecy rate. It is shown that the total power constraint leads to a closed-form solution. The design under individual relay power constraints is formulated as an optimization problem which is shown to be easily solved using two different approaches, namely semidefinite programming and second-order cone programming. Furthermore, a simplified and suboptimal technique which reduces the computation complexity under individual power constraints is presented.

cs.IT↗

arXiv2009

Low-SNR Analysis of Interference Channels under Secrecy Constraints

In this paper, we study the secrecy rates over weak Gaussian interference channels for different transmission schemes. We focus on the low-SNR regime and obtain the minimum bit energy E_b/N_0_min values, and the wideband slope regions for both TDMA and multiplexed transmission schemes. We show that secrecy constraints introduce a penalty in both the minimum bit energy and the slope regions. Additionally, we identify under what conditions TDMA or multiplexed transmission is optimal. Finally, we show that TDMA is more likely to be optimal in the presence of secrecy constraints.

cs.IT↗

arXiv2008

To Cooperate, or Not to Cooperate in Imperfectly-Known Fading Channels

In this paper, communication over imperfectly-known fading channels with different degrees of cooperation is studied. The three-node relay channel is considered. It is assumed that communication starts with the network training phase in which the receivers estimate the fading coefficients of their respective channels. In the data transmission phase, amplify-and-forward and decode-and-forward relaying schemes are employed. For different cooperation protocols, achievable rate expressions are obtained. These achievable rate expressions are then used to find the optimal resource allocation strategies. In particular, the fraction of total time or bandwidth that needs to be allocated to the relay for best performance is identified. Under a total power constraint, optimal allocation of power between the source and relay is investigated. Finally, bit energy requirements in the low-power regime are studied.

cs.IT↗

arXiv2008

Achievable Rates and Optimal Resource Allocation for Imperfectly-Known Fading Relay Channels

In this paper, achievable rates and optimal resource allocation strategies for imperfectly-known fading relay channels are studied. It is assumed that communication starts with the network training phase in which the receivers estimate the fading coefficients of their respective channels. In the data transmission phase, amplify-and-forward and decode-and-forward relaying schemes with different degrees of cooperation are considered, and the corresponding achievable rate expressions are obtained. Three resource allocation problems are addressed: 1) power allocation between data and training symbols; 2) time/bandwidth allocation to the relay; 3) power allocation between the source and relay in the presence of total power constraints. The achievable rate expressions are employed to identify the optimal resource allocation strategies. Finally, energy efficiency is investigated by studying the bit energy requirements in the low-SNR regime.

cs.IT↗

arXiv2007

Achievable Rates and Optimal Resource Allocation for Imperfectly-Known Fading Relay Channels

In this paper, achievable rates of imperfectly-known fading relay channels are studied. It is assumed that communication starts with the network training phase in which the receivers estimate the fading coefficients of their respective channels. In the data transmission phase, amplify-and-forward and decode-and-forward relaying schemes are considered, and the corresponding achievable rate expressions are obtained. The achievable rate expressions are then employed to identify the optimal resource allocation strategies.

cs.IT↗