Zhi Xue
Shanghai Jiao Tong University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Zhi Xue.
IEEE Signal Processing Letters | 2014
Yongkai Zhou; Zheng Zheng Xiang; Yan Zhu; Zhi Xue
This letter considers the secure MIMO transmission in a wireless environment, in which one transmitter (Alice), one receiver (Bob) and one eavesdropper (Eve) are involved. Apart from the artificial noise (AN) generated by Alice, Bob can also exploit his remaining antenna resources to emit AN to further impair Eves channel. Such kind of AN can be cancelled by Bob himself by applying the Full-Duplex wireless communication technique. A computable secrecy rate is obtained for this model over a Rayleigh-fading eavesdropping channel. In order to maximize the secrecy rate, a joint optimization scheme is proposed to assign the TX/RX antennas for Bob and to design the beamforming and power allocation for Alices information and AN signal. Simulation is carried out to illustrate the process of the proposed optimization scheme.
IEEE Signal Processing Letters | 2013
Yan Zhu; Yongkai Zhou; Shivani Patel; Xiao Chen; Liang Pang; Zhi Xue
In wireless communication, the transmitter (Alice) can send artificial noise (AN) to interfere with the eavesdropper (Eve). This letter considers the AN MIMO scenario, i.e., both Alice and the legitimate receiver (Bob) are equipped with multiple antennas. A closed-form expression for the lower bound of secrecy capacity is obtained. It is proved that water-filling is the optimal power allocation scheme. An efficient iterative algorithm is proposed to find the optimal power distribution ratio between information and AN so that maximum secrecy capacity can be achieved. Simulation results show that the proposed algorithm converges fast, and multiple antennas can improve the secrecy capacity to some extent compared to the AN MISO case.
Cluster Computing | 2017
Xiao Chen; Liang Pang; Pengze Guo; Xingping Sun; Zhi Xue; N. Arunkumar
We study a general type of multiple-input multiple-output (G-MIMO) relay channels, which consist of two groups (A and B) of source nodes and one relay node. Both groups have arbitrarily many source nodes each of which is in turn equipped with an arbitrary number of antennas. A G-MIMO relay channel engages in two-way transmission of independent information via the relay node. We obtain a tight upper bound on the total degrees of freedom (DoF) for such G-MIMO relay channels. Under the reasonable assumption that the number of antennas at the relay node is no more than the total number of antennas of either Group A or B, we design an efficient transmission scheme to achieve the upper bound by using techniques of signal alignment and joint transceiver design for interference cancellation. At the end of the paper, we propose a future research topic to quantify the relationship between graded levels of network security and the corresponding DoF of the G-MIMO relay channels.
international conference on communications | 2010
J. Gu; Zhi Xue
The main property of the self-healing key distribution scheme is that even if during a certain session some broadcast messages are lost due to network faults, the users are still capable of recovering lost session keys on their own, without requesting additional transmission from the group manager. In this paper, we propose and analyze an efficient self-healing key distribution scheme based on vector space secret sharing and one way hash function. We prove that our scheme achieves both forward and backward secrecy and resists to a collusion attack.
international conference on computational and information sciences | 2012
Xiao Chen; Yan Zhu; Zhi Xue; Fangbiao Li; Jie Gu
Security is an important issue in the field of wireless communication. In this paper, the security problem of Single-input Single-output Multiple-helpers (SISOMH) wireless channel is considered. The SISOMH wireless channel, where artificial noise is utilized, is designed to prevent eavesdropping. But the artificial noise may be invalid due to the inherent security weakness. We point out that the SISOMH scheme is not safe through by matrix analysis. Then, a Helper Transmission Parameter Optimization (HTPO) scheme is proposed to fix the flow.
global communications conference | 2014
Yongkai Zhou; Yan Zhu; Zhi Xue
In this paper, secure communication over a multi-input multi-output multi-eavesdropper (MIMÓME) wiretap channel is considered. We propose an enhanced MIMÓME artificial noise (AN) model in which the receiver (Bob) adopts the latest Full-Duplex MIMO Radio technique to emit AN jointly with the transmitter (Alice). An achievable secrecy rate is obtained for this model over an unfavorable noiseless eavesdropping channel. Optimization problem is formulated to solve the beamforming and power allocation for Alice and Bobs transmitting signals and to determine the dimension allocation between the information and AN signals. Simulations are carried out to illustrate the optimization process, and the results show that the enhanced MIMÓME model outperforms existing AN models for low self-interference regime.
Mathematical Problems in Engineering | 2013
Yongkai Zhou; Yan Zhu; Fangbiao Li; Zachary Imm; Xinxing Yin; Zhi Xue
The paper considers the secure transmission in a wireless environment in which both the transmitter (Alice) and the legitimate receiver (Bob) send artificial noise (AN) to interfere with the eavesdropper (Eve). Optimal design is analyzed in detail for this AN-by-both-side model to deal with Eve’s stochastic channel condition and random spatial distribution. Bipolar-beamforming is first proposed to jointly design Alice and Bob’s transmitting signals. By optimally assigning the transmitting antenna for Bob and allocating the power ratio between Alice’s information and the AN signal, maximum secrecy capacity can be achieved. Simulation is done to illustrate the process of bipolar-beamforming optimization. Results show that the AN-by-both-side model has good secrecy performance on both average and extreme conditions as Eve approaches Alice or Bob.
international conference on computational and information sciences | 2012
Yan Zhu; Xiao Chen; Zhi Xue; Fangbiao Li; Jie Gu
The problem we consider is the security communication in MISO (Multiple-input Single-output) scenario. The scenario is connected via wireless signal between two points: the transmitter and the receiver. We assume that transmitter has multiple antennas while receiver has one. In recent papers, they assume that the useful information can be received by the indeed receiver completely but not the eavesdropper. In this paper we take the identity of active attacker to superimpose the attack signal which uses high power all-directional antennas to inject on the original signal. We do the analysis and research on the defect of MISO wireless channel with the mutual information as the mathematical description quantity. This Paper elicits and defines the concept of wireless channel information loss rate. In the end, the MISO security communication solutions against the active attack are given using null space connection technology.
International Conference of Pioneering Computer Scientists, Engineers and Educators | 2017
Liang Pang; Xiao Chen; Zhi Xue; Rida Khatoun
In wireless networks, jamming attacks are easy to launch and can significantly impact the network performance. The technique which localizes the jamming attacker is useful to address this problem. Some range-based localization schemes depend on the additional hardware of wireless nodes too much, and they can not work in resource-constrained wireless networks. Solutions in range-free localization are being pursued as a cost-effective alternative to more expensive range-based approaches. In this paper, we propose a novel range-free algorithm to localize the source of the attacker. We show that our approach only relies on the positions of each jammed or no-jammed node in the network, PSO algorithm is used to get the minimum covering circle of jammed positions and the circle center is the estimated jammer location. We compare our work with some existing range-free solutions via extensive simulations in two models, which are wireless sensor network (WSN) and vehicular ad hoc network (VANET) respectively. The experimental results suggest that our proposed algorithm achieves higher accuracy than the other solutions, and the localization error goes down with larger number of recorded jammed positions. In additional, when the recorded jammed positions are distributed in a specific constrained area, the localization error goes higher, we also propose an improved PSO algorithm to deal with this issue.
international conference on communications | 2014
Yongkai Zhou; Fangbiao Li; Pengze Guo; Zhi Xue
This paper is concerned with the secure MIMO transmission in a classic three-node network, in which both the transmitter (Alice) and the receiver (Bob) simultaneously send artificial noise (AN) to impact the channel of the eavesdropper (Eve). Only statistical information about the eavesdropper channel is available. Compared to previous works, this paper studies the scenario in which the main channel are also time-varying and goes through Rayleigh fading. Expected secrecy rate is adopted to evaluate the performance of this model. Robust beamforming and power allocation are proposed to maximize the lower bound of the expected secrecy rate. Numerical results show that with the increase of Bobs AN power, the best practice is to allocate more dimensions for emitting AN and at the same time distribute a greater proportion of Alices power to information symbols.