Robust Beamforming for Secrecy Rate in Cooperative Cognitive Radio Multicast Communications

In this paper, we propose a cooperative approach to improve the security of both primary and secondary systems in cognitive radio multicast communications. During their access to the frequency spectrum licensed to the primary users, the secondary unlicensed users assist the primary system in fortifying security by sending a jamming noise to the eavesdroppers, while simultaneously protect themselves from eavesdropping. The main objective of this work is to maximize the secrecy rate of the secondary system, while adhering to all individual primary users' secrecy rate constraints. In the case of passive eavesdroppers and imperfect channel state information knowledge at the transceivers, the utility function of interest is nonconcave and involved constraints are nonconvex, and thus, the optimal solutions are troublesome. To address this problem, we propose an iterative algorithm to arrive at a local optimum of the considered problem. The proposed iterative algorithm is guaranteed to achieve a Karush-Kuhn-Tucker solution.Comment: 6 pages, 4 figures, IEEE ICC 201

New H∞ control design for polytopic systems with mixed time-varying delays in state and input

This paper concerns with the problem of state-feedback H∞ control design for a class of linear systems with polytopic uncertainties and mixed time-varying delays in state and input. Our approach can be described as follows. We first construct a state-feedback controller based on the idea of parameter-dependent controller design. By constructing a new parameter-dependent Lyapunov-Krasovskii functional (LKF), we then derive new delay-dependent conditions in terms of linear matrix inequalities ensuring the exponential stability of the corresponding closed-loop system with a H∞ disturbance attenuation level. The effectiveness and applicability of the obtained results are demonstrated by practical examples

Joint Fractional Time Allocation and Beamforming for Downlink Multiuser MISO Systems

It is well-known that the traditional transmit beamforming at a base station (BS) to manage interference in serving multiple users is effective only when the number of users is less than the number of transmit antennas at the BS. Non-orthogonal multiple access (NOMA) can improve the throughput of users with poorer channel conditions by compromising their own privacy because other users with better channel conditions can decode the information of users in poorer channel state. NOMA still prefers that the number of users is less than the number of antennas at the BS transmitter. This paper resolves such issues by allocating separate fractional time slots for serving the users with similar channel conditions. This enables the BS to serve more users within the time unit while the privacy of each user is preserved. The fractional times and beamforming vectors are jointly optimized to maximize the system's throughput. An efficient path-following algorithm, which invokes a simple convex quadratic program at each iteration, is proposed for the solution of this challenging optimization problem. Numerical results confirm its versatility.Comment: IEEE Communications Letters (To Appear

Evaluate the Results at Minimum 2-Years of Treating Rotator Cuff Tear by Arthroscopic Surgery

BACKGROUND: Rotator cuff tear (RCT) is a common injury of the shoulder, especially middle-aged people. Nonoperative treatment, cortisone injections are only effective at an early stage. Open surgery causes postoperative atrophy of the deltoid muscle, so results are limited. Arthroscopic rotator cuff repair surgery has been performed in Vietnam for about ten years, with many advantages such as the ability to accurately assess the lesions and less invasive procedure. In order to have a clearer view, we performed a mid-term assessment of the effectiveness of this surgery. AIM: Evaluate results over 2 years of patients with rotator cuff tears treated with arthroscopic surgery and their quality of life. METHOD: A group of 30 patients were diagnosed with RCT and surgery by arthroscopy to treat at Hanoi Medical University Hospital and Saint Paul Hospital between Jun 2015 and April 2017. The results of the surgeries were assessed by the degree of pain, muscle power, motion of the shoulder joint according to UCLA shoulder score. Evaluate the quality of life through the Rotator Cuff-Quality of Life (RC-QoL) index. RESULTS: The average age was 60.7 years. Female / male ratio was 1.3. Thirty-six months ± 6.41 was the average follow-up time (min 27 – max 50 months). The shoulder function is recorded according to UCLA has an average score of 30.9, therein good and excellent result were 90 %. The mean RC-QoL index was 91.5%. CONCLUSION: Treatment of RCT by arthroscopic surgery that has been evaluated for a minimum of 2 years follow-up showed good results and high quality of patient’s life

Joint Information and Jamming Beamforming for Secrecy Rate Maximization in Cognitive Radio Networks

In this paper, we consider the secure beamforming design for an underlay cognitive radio multiple-input singleoutput broadcast channel in the presence of multiple passive eavesdroppers. Our goal is to design a jamming noise (JN) transmit strategy to maximize the secrecy rate of the secondary system. By utilizing the zero-forcing method to eliminate the interference caused by JN to the secondary user, we study the joint optimization of the information and JN beamforming for secrecy rate maximization of the secondary system while satisfying all the interference power constraints at the primary users, as well as the per-antenna power constraint at the secondary transmitter. For an optimal beamforming design, the original problem is a nonconvex program, which can be reformulated as a convex program by applying the rank relaxation method. To this end, we prove that the rank relaxation is tight and propose a barrier interior-point method to solve the resulting saddle point problem based on a duality result. To find the global optimal solution, we transform the considered problem into an unconstrained optimization problem. We then employ Broyden-Fletcher-Goldfarb-Shanno (BFGS) method to solve the resulting unconstrained problem which helps reduce the complexity significantly, compared to conventional methods. Simulation results show the fast convergence of the proposed algorithm and substantial performance improvements over existing approaches