Fan LI Shijin DAI Qihe LIU Guowei YANG
This letter presents a new inter-cluster proximity index for fuzzy partitions obtained from the fuzzy c-means algorithm. It is defined as the average proximity of all possible pairs of clusters. The proximity of each pair of clusters is determined by the overlap and the separation of the two clusters. The former is quantified by using concepts of Fuzzy Rough sets theory and the latter by computing the distance between cluster centroids. Experimental results indicate the efficiency of the proposed index.
Yang WU Weiwei YANG Di ZHANG Xiaoli SUN
Unmanned aerial vehicle (UAV) communication has drawn rising interest recently with the distinctive gains brought by its inherent mobility. In this paper, we investigate the throughput maximization problem in UAV-enabled uplink communication, where multiple ground nodes communicate with a UAV while a group of ground jammers send jamming signals to jam the communications between UAV and the ground nodes. In contrast to the previous works that only considering UAV's transmit power allocation and two-dimension (2D) trajectory design, the ground nodes' transmit power allocation and scheduling along with the UAV's three-dimensional (3D) trajectory design are jointly optimized. The formulated throughput maximization problem is a mixed-integer non-convex programme that hard to be solved in general. Thus, we propose an iterative algorithm to make the problem trackable by applying the block coordinate descent and successive convex optimization techniques. Simulation results show that our proposed algorithm outperforms the benchmark methods that improving the throughput of the system significantly.
Dechuan CHEN Weiwei YANG Jianwei HU Yueming CAI Xin LIU
In this paper, we identify the tradeoff between security and reliability in the amplify-and-forward (AF) distributed beamforming (DBF) cooperative network with K untrusted relays. In particular, we derive the closed-form expressions for the connection outage probability (COP), the secrecy outage probability (SOP), the tradeoff relationship, and the secrecy throughput. Analytical and simulation results demonstrate that increasing K leads to the enhancement of the reliability performance, but the degradation of the security performance. This tradeoff also means that there exists an optimal K maximizing the secrecy throughput.
Kun XU Yuanyuan GAO Xiaoxin YI Weiwei YANG
Joint transmit and receive antenna selection (JTRAS) is proposed for the multiple-input multiple-output (MIMO) two-way relaying channel. A simple and closed-form lower bound on the outage probability of JTRAS is derived. Furthermore, asymptotic analysis reveals that JTRAS can attain the maximum achievable diversity order of the MIMO dual-hop relaying channel.
Li ZENG Xiongwei ZHANG Liang CHEN Weiwei YANG
Presented is a new measuring and reconstruction framework of Compressed Sensing (CS), aiming at reducing the measurements required to ensure faithful reconstruction. A sparse vector is segmented into sparser vectors. These new ones are then randomly sensed. For recovery, we reconstruct these vectors individually and assemble them to obtain the original signal. We show that the proposed scheme, referred to as SegOMP, yields higher probability of exact recovery in theory. It is finished with much smaller number of measurements to achieve a same reconstruction quality when compared to the canonical greedy algorithms. Extensive experiments verify the validity of the SegOMP and demonstrate its potentials.
Kuo CAO Yueming CAI Yongpeng WU Weiwei YANG
This letter studies secure transmission design with finite alphabet input for cooperative jamming network under individual power constraint. By adopting the zero-force scheme, where the jamming signal is fully laid in the null space of the relay-destination channel, the problem of enhancing the achievable secrecy rate is decomposed into two independent subproblems: relay weights design and power control. We reveal that the problem of relay weights design is identical to the problem of minimizing the maximal equivalent source-eavesdropper channel gain, which can be transformed into a semi-definite programming (SDP) problem and thus is tackled using interior point method. Besides, the problem of power control is solved with the fundamental relation between mutual information and minimum mean square error (MMSE). Numerical results show that the proposed scheme achieves significant performance gains compared to the conventional Gaussian design.
Jingjie YAN Wenming ZHENG Minhai XIN Jingwei YAN
In this letter, we research the method of using face and gesture image sequences to deal with the video-based bimodal emotion recognition problem, in which both Harris plus cuboids spatio-temporal feature (HST) and sparse canonical correlation analysis (SCCA) fusion method are applied to this end. To efficaciously pick up the spatio-temporal features, we adopt the Harris 3D feature detector proposed by Laptev and Lindeberg to find the points from both face and gesture videos, and then apply the cuboids feature descriptor to extract the facial expression and gesture emotion features [1],[2]. To further extract the common emotion features from both facial expression feature set and gesture feature set, the SCCA method is applied and the extracted emotion features are used for the biomodal emotion classification, where the K-nearest neighbor classifier and the SVM classifier are respectively used for this purpose. We test this method on the biomodal face and body gesture (FABO) database and the experimental results demonstrate the better recognition accuracy compared with other methods.
Lei WANG Yueming CAI Weiwei YANG
For amplify-and-forward (AF) relaying with imperfect channel estimation, we present the average symbol error rate (SER) and the diversity and multiplexing tradeoff (DMT) analysis for both opportunistic relaying (OPR) and all-participate relaying (APR) schemes. SER comparisons show that when the channel estimation quality order is no larger than 1, OPR will perform worse than APR in high SNR region. Moreover, small channel estimation quality orders will also lead to significant DMT loss.
Yuanhe XUE Wei YAN Xuan LIU Mengxia ZHOU Yang ZHAO Hao MA
Model-based sensorless control of permanent magnet synchronous motor (PMSM) is promising for high-speed operation to estimate motor state, which is the speed and the position of the rotor, via electric signals of the stator, beside the inevitable fact that estimation accuracy is degraded by electromagnet interference (EMI) from switching devices of the converter. In this paper, the simulation system based on Luenberger observer and phase-locked loop (PLL) has been established, analyzing impacts of EMI on motor state estimations theoretically, exploring influences of EMI with different cutoff frequency, rated speeds, frequencies and amplitudes. The results show that Luenberger observer and PLL have strong immunity, which enable PMSM can still operate stably even under certain degrees of interference. EMI produces sideband harmonics that enlarge pulsation errors of speed and position estimations. Additionally, estimation errors are positively correlated with cutoff frequency of low-pass filter and the amplitude of EMI, and negatively correlated with rated speed of the motor and the frequency of EMI. When the frequency is too high, its effects on motor state estimations are negligible. This work contributes to the comprehensive understanding of how EMI affects motor state estimations, which further enhances practical application of sensorless PMSM.
Dechuan CHEN Yunpeng CHENG Weiwei YANG Jianwei HU Yueming CAI Junquan HU Meng WANG
In this letter, we investigate the physical layer security in multi-user multi-relay networks, where each relay is not merely a traditional helper, but at the same time, can become a potential eavesdropper. We first propose an efficient low-complexity user and relay selection scheme to significantly reduce the amount of channel estimation as well as the amount of potential links for comparison. For the proposed scheme, we derive the closed-form expression for the lower bound of ergodic secrecy rate (ESR) to evaluate the system secrecy performance. Simulation results are provided to verify the validity of our expressions and demonstrate how the ESR scales with the number of users and relays.
Jingjie YAN Wenming ZHENG Minghai XIN Jingwei YAN
In this letter, a new sparse locality preserving projection (SLPP) algorithm is developed and applied to facial expression recognition. In comparison with the original locality preserving projection (LPP) algorithm, the presented SLPP algorithm is able to simultaneously find the intrinsic manifold of facial feature vectors and deal with facial feature selection. This is realized by the use of l1-norm regularization in the LPP objective function, which is directly formulated as a least squares regression pattern. We use two real facial expression databases (JAFFE and Ekman's POFA) to testify the proposed SLPP method and certain experiments show that the proposed SLPP approach respectively gains 77.60% and 82.29% on JAFFE and POFA database.
Ming-Der SHIEH Shih-Hao FANG Shing-Chung TANG Der-Wei YANG
Partially parallel decoding architectures are widely used in the design of low-density parity-check (LDPC) decoders, especially for quasi-cyclic (QC) LDPC codes. To comply with the code structure of parity-check matrices of QC-LDPC codes, many small memory blocks are conventionally employed in this architecture. The total memory area usually dominates the area requirement of LDPC decoders. This paper proposes a low-complexity memory access architecture that merges small memory blocks into memory groups to relax the effect of peripherals in small memory blocks. A simple but efficient algorithm is also presented to handle the additional delay elements introduced in the memory merging method. Experiment results on a rate-1/2 parity-check matrix defined in the IEEE 802.16e standard show that the LDPC decoder designed using the proposed memory access architecture has the lowest area complexity among related studies. Compared to a design with the same specifications, the decoder implemented using the proposed architecture requires 33% fewer gates and is more power-efficient. The proposed new memory access architecture is thus suitable for the design of low-complexity LDPC decoders.
Siran ZHANG Zhiwei YAN Yong-Jin PARK Hidenori NAKAZATO Wataru KAMEYAMA Kashif NISAR Ag Asri Ag IBRAHIM
Named Data Networking (NDN) is a promising architecture for the future Internet and it is mainly designed for efficient content delivery and retrieval. However, producer mobility support is one of the challenging problems of NDN. This paper proposes a scheme which aims to optimize the tunneling-based producer mobility solution in NDN. It does not require NDN routers to change their routing tables (Forwarding Information Base) after a producer moves. Instead, the Interest packet can be sent from a consumer to the moved producer using the tunnel. The piggybacked Data packet which is sent back to the consumer will trigger the consumer to send the following Interest packets through the optimized path to the producer. Moreover, a naming scheme is proposed so that the NDN caching function can be fully utilized. An analysis is carried out to evaluate the performance of the proposal. The results indicate that the proposed scheme reduces the network cost compared to related works and supports route optimization for enhanced producer mobility support in NDN.
Xuanxuan TANG Wendong YANG Yueming CAI Weiwei YANG Yuyang ZHANG Xiaoli SUN Yufeng QIAN
This paper studies the secrecy throughput performance of the three-node wireless-powered networks and proposes two secure transmission schemes, namely the half-duplex maximal ratio combining (HD&MRC) scheme and the full-duplex jamming scheme based on time switching simultaneous wireless information and power transfer (FDJ&TS-SWIPT). The closed-form expressions of the secrecy throughput are derived, and intuitive comparison of the two schemes is provided. It is illustrated that the HD&MRC scheme only applies to the low and medium signal-to-noise ratio (SNR) regime. On the contrary, the suitable SNR regime of the FDJ&TS-SWIPT is much wider. It is depicted that FDJ&TS-SWIPT combing with current passive self-interference cancellation (SIC) algorithm outperforms HD&MRC significantly, especially when a medium or high transmit SNR is provided. Numerical simulations are conducted for verifying the validity of the analysis.
Dawei YAN Cong LIU Peng YOU Shaowei YONG Dongfang GUAN Yu XING
In wireless networks, efficient topology improves the performance of network protocols. The previous research mainly focuses on how to construct a cost-efficient network structure from a static and connected topology. Due to lack of continuous connectivity in the underlying topology, most traditional topology control methods are not applicable to the delay or disruption tolerant networks (DTNs). In this paper, we consider the topology control problem in a predictable DTN where the dynamic topology is known a priori or can be predicted over time. First, this dynamic topology is modeled by a directed space-time graph that includes spatial and temporal information. Second, the topology control problem of the predictable DTN is formulated as building a sparse structure. For any pair devices, there is an efficient path connecting them to improve the efficiency of the generated structure. Then, a topology control strategy is proposed for this optimization problem by using a kth shortest paths algorithm. Finally, simulations are conducted on random networks and a real-world DTN tracing date. The results demonstrate that the proposed method can significantly improve the efficiency of the generated structure and reduce the total cost.
Lei WANG Xinrong GUAN Yueming CAI Weiwei YANG Wendong YANG
This work investigates the physical layer security for three cooperative automatic-repeat-request (CARQ) protocols, including the decode-and-forward (DF) CARQ, opportunistic DF (ODF) CARQ, and the distributed space-time code (DSTC) CARQ. Assuming that there is no instantaneous channel state information (CSI) of legitimate users' channel and eavesdropper's channel at the transmitter, the connection outage performance and secrecy outage performance are derived to evaluate the reliability and security of each CARQ protocol. Then, we redefine the concept of the secrecy throughput to evaluate the overall efficiency of the system in terms of maintaining both reliable and secure transmission. Furthermore, through an asymptotic analysis in the high signal-to-noise ratio (SNR) regime, the direct relationship between reliability and security is established via the reliability-security tradeoff (RST). Numerical results verify the analysis and show the efficiency of the CARQ protocols in terms of the improvement on the secrecy throughput. More interestingly, increasing the transmit SNR and the maximum number of transmissions of the ARQ protocols may not achieve a security performance gain. In addition, the RST results underline the importance of determining how to balance the reliability vs. security, and show the superiority of ODF CARQ in terms of RST.
Nan SHA Yuanyuan GAO Xiaoxin YI Wenlong LI Weiwei YANG
A joint continuous phase frequency shift keying (CPFSK) modulation and physical-layer network coding (PNC), i.e., CPFSK-PNC, is proposed for two-way relay channels (TWRCs). This letter discusses the signal detection of the CPFSK-PNC scheme with emphasis on the maximum-likelihood sequence detection (MLSD) algorithm for the relay receiver. The end-to-end error performance of the proposed CPFSK-PNC scheme is evaluated through simulations.
Xushan CHEN Xiongwei ZHANG Jibin YANG Meng SUN Weiwei YANG
Compressive sensing (CS) exploits the sparsity or compressibility of signals to recover themselves from a small set of nonadaptive, linear measurements. The number of measurements is much smaller than Nyquist-rate, thus signal recovery is achieved at relatively expense. Thus, many signal processing problems which do not require exact signal recovery have attracted considerable attention recently. In this paper, we establish a framework for parameter estimation of a signal corrupted by additive colored Gaussian noise (ACGN) based on compressive measurements. We also derive the Cramer-Rao lower bound (CRB) for the frequency estimation problems in compressive domain and prove some useful properties of the CRB under different compressive measurements. Finally, we show that the theoretical conclusions are along with experimental results.
Weiwei YANG Yueming CAI Lei WANG
In this letter, we analyze the outage performance of decode-and-forward relay systems with imperfect MRC receiver at the destination. Unlike the conventional perfect MRC, the weight of each branch of the imperfect MRC receiver is only the conjugate of the channel impulse response, not being normalized by the noise variance. We derive an exact closed-form expression for the outage probability over dissimilar Nakagami-m fading channels. Various numerical examples confirm the proposed analysis.
Yuefeng PENG Wei YANG Candy YIU Yujian ZHANG Hongwen YANG
Heterogeneous networks (HetNets) can provide higher capacity and user throughput than homogeneous networks in Long Term Evolution (LTE)-Advanced systems. However, because of increased interference from neighboring cells and the characteristics of the embedded small cells, handover performance is impacted adversely, especially when the user equipment (UE) moves at medium or high speeds. In this paper, to improve mobility performance, we propose two schemes, i.e., 1) using wideband signal-to-interference noise ratio (SINR) as the handover metric and 2) emergency attaching. The schemes can enhance mobility performance since handovers are performed based on the quality of the radio link. Importantly, the two schemes compliment rather than contradict each other. System-level simulations show that both the individual proposed schemes and the joint schemes can improve mobility performance significantly.