scholarly journals Establishment of Real LMIs for the Quasi-Convex Problem of Optimization of the Weighting Functions

2013 ◽  
pp. 251-253
Keyword(s):  
Weighting Functions ◽  
Convex Problem

Sum-Rate Optimization Constrained by Consumed Power for Multi- Antenna Non-Regenerative Relay Network

2020 ◽  
Vol 10 (2) ◽  
pp. 143-152 ◽  
Author(s):  
Maryam Alibeigi ◽  
Shahriar S. Moghaddam
Keyword(s):  
Relay Network ◽  
Minimization Algorithm ◽  
Amplify And Forward ◽  
Relay Nodes ◽  
Convex Problem ◽  
Semidefinite Programming Problem ◽  
Total Leakage ◽  
Sum Rate ◽  
Rate Optimization ◽  
Novel Algorithm

Background & Objective: This paper considers a multi-pair wireless network, which communicates peer-to-peer using some multi-antenna amplify-and-forward relays. Maximizing the throughput supposing that the total relay nodes’ power consumption is constrained, is the main objective of this investigation. We prove that finding the beamforming matrix is not a convex problem. Methods: Therefore, by using a semidefinite relaxation technique we find a semidefinite programming problem. Moreover, we propose a novel algorithm for maximizing the total signal to the total leakage ratio. Numerical analyses show the effectiveness of the proposed algorithm which offers higher throughput compared to the existing total leakage minimization algorithm, with much less complexity. Results and Conclusion: Furthermore, the effect of different parameters such as, the number of relays, the number of antennas in each relay, the number of transmitter/receiver pairs and uplink and downlink channel gains are investigated.

scholarly journals Physical layer security transmission scheme based on artificial noise in cooperative SWIPT NOMA system

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Yong Jin ◽  
Zhentao Hu ◽  
Dongdong Xie ◽  
Guodong Wu ◽  
Lin Zhou
Keyword(s):  
Interference Cancellation ◽  
Physical Layer Security ◽  
High Energy ◽  
Physical Layer ◽  
Base Station ◽  
Artificial Noise ◽  
Transmitted Power ◽  
Transmission Scheme ◽  
Convex Problem ◽  
Security Problem

AbstractAiming at high energy consumption and information security problem in the simultaneous wireless information and power transfer (SWIPT) multi-user wiretap network, we propose a user-aided cooperative non-orthogonal multiple access (NOMA) physical layer security transmission scheme to minimize base station (BS) transmitted power in this paper. In this scheme, the user near from BS is adopted as a friendly relay to improve performance of user far from BS. An energy harvesting (EH) technology-based SWIPT is employed at the near user to collect energy which can be used at cooperative stage. Since eavesdropper in the downlink of NOMA system may use successive interference cancellation (SIC) technology to obtain the secrecy information of receiver, to tackle this problem, artificial noise (AN) is used at the BS to enhance security performance of secrecy information. Moreover, semidefinite relaxation (SDR) method and successive convex approximation (SCA) technique are combined to solve the above non-convex problem. Simulation results show that in comparison with other methods, our method can effectively reduce the transmitted power of the BS on the constraints of a certain level of the secrecy rates of two users.

scholarly journals Joint optimization of computing ratio and access points’ density for mixed mobile edge/cloud computing

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Tianqi Jing ◽  
Shiwen He ◽  
Fei Yu ◽  
Yongming Huang ◽  
Luxi Yang ◽  
...  
Keyword(s):  
Cloud Computing ◽  
Coverage Probability ◽  
Optimization Problem ◽  
Mobile Cloud Computing ◽  
Low Complexity ◽  
Mixed Integer ◽  
Joint Optimization ◽  
Mobile Cloud ◽  
Convex Problem

AbstractCooperation between the mobile edge computing (MEC) and the mobile cloud computing (MCC) in offloading computing could improve quality of service (QoS) of user equipments (UEs) with computation-intensive tasks. In this paper, in order to minimize the expect charge, we focus on the problem of how to offload the computation-intensive task from the resource-scarce UE to access point’s (AP) and the cloud, and the density allocation of APs’ at mobile edge. We consider three offloading computing modes and focus on the coverage probability of each mode and corresponding ergodic rates. The resulting optimization problem is a mixed-integer and non-convex problem in the objective function and constraints. We propose a low-complexity suboptimal algorithm called Iteration of Convex Optimization and Nonlinear Programming (ICONP) to solve it. Numerical results verify the better performance of our proposed algorithm. Optimal computing ratios and APs’ density allocation contribute to the charge saving.

scholarly journals The Effects of Weighting Functions on the Performances of Robust Control Systems

Proceedings ◽  
2020 ◽  
Vol 63 (1) ◽  
pp. 46
Author(s):  
Mircea Dulau ◽  
Stelian-Emilian Oltean
Keyword(s):  
Robust Control ◽  
Control Systems ◽  
Tracking Error ◽  
Weighting Functions ◽  
Loop Control ◽  
Frequency Sensitivity ◽  
Sensitivity Functions ◽  
Loop Control System ◽  
Robust Control Design ◽  
Robust Control Systems

An important stage in robust control design is to define the desired performances of the closed loop control system using the models of the frequency sensitivity functions S. If the frequency sensitivity functions remain within the limits imposed by these models, the control performances are met. In terms of the sensitivity functions, the specifications include: shape of S over selected frequency ranges, peak magnitude of S, bandwidth frequency, and tracking error at selected frequencies. In this context, this paper presents a study of the effects of the specifications of the weighting functions on the performances of robust control systems.

scholarly journals Parametric weighting functions

2009 ◽  
Vol 144 (3) ◽  
pp. 1102-1118 ◽  
Author(s):  
Enrico Diecidue ◽  
Ulrich Schmidt ◽  
Horst Zank
Keyword(s):  
Weighting Functions

A Dynamics-Based Optimal Trajectory Generation for Controlling an Automated Excavator

2010 ◽  
Vol 224 (10) ◽  
pp. 2109-2119 ◽  
Author(s):  
S Yoo ◽  
C-G Park ◽  
S-H You ◽  
B Lim
Keyword(s):  
Optimal Trajectory ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Linear Constraints ◽  
Control Points ◽  
Weighting Functions ◽  
B Splines ◽  
Finite Dimensional ◽  
Motion Optimization ◽  
Save Energy

This article presents a new methodology to generate optimal trajectories in controlling an automated excavator. By parameterizing all the actuator displacements with B-splines of the same order and with the same number of control points, the coupled actuator limits, associated with the maximum pump flowrate, are described as the finite-dimensional set of linear constraints to the motion optimization problem. Several weighting functions are introduced on the generalized actuator torque so that the solution to each optimization problems contains the physical meaning. Numerical results showing that the generated motions of the excavator are fairly smooth and effectively save energy, which can prevent mechanical wearing and possibly save fuel consumption, are presented. A typical operator's manoeuvre from experiments is referred to bring out the standing features of the optimized motion.

Sign in / Sign up

Export Citation Format

Share Document