• Title/Summary/Keyword: non-convex function

Search Result 72, Processing Time 0.026 seconds

Energy Efficiency Maximization for Energy Harvesting Bidirectional Cooperative Sensor Networks with AF Mode

  • Xu, Siyang;Song, Xin;Xia, Lin;Xie, Zhigang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.6
    • /
    • pp.2686-2708
    • /
    • 2020
  • This paper investigates the energy efficiency of energy harvesting (EH) bidirectional cooperative sensor networks, in which the considered system model enables the uplink information transmission from the sensor (SN) to access point (AP) and the energy supply for the amplify-and-forward (AF) relay and SN using power-splitting (PS) or time-switching (TS) protocol. Considering the minimum EH activation constraint and quality of service (QoS) requirement, energy efficiency is maximized by jointly optimizing the resource division ratio and transmission power. To cope with the non-convexity of the optimizations, we propose the low complexity iterative algorithm based on fractional programming and alternative search method (FAS). The key idea of the proposed algorithm first transforms the objective function into the parameterized polynomial subtractive form. Then we decompose the optimization into two convex sub-problems, which can be solved by conventional convex programming. Simulation results validate that the proposed schemes have better output performance and the iterative algorithm has a fast convergence rate.

On Thermal and State-of-Charge Balancing using Cascaded Multi-level Converters

  • Altaf, Faisal;Johannesson, Lars;Egardt, Bo
    • Journal of Power Electronics
    • /
    • v.13 no.4
    • /
    • pp.569-583
    • /
    • 2013
  • In this study, the simultaneous use of a multi-level converter (MLC) as a DC-motor drive and as an active battery cell balancer is investigated. MLCs allow each battery cell in a battery pack to be independently switched on and off, thereby enabling the potential non-uniform use of battery cells. By exploiting this property and the brake regeneration phases in the drive cycle, MLCs can balance both the state of charge (SoC) and temperature differences between cells, which are two known causes of battery wear, even without reciprocating the coolant flow inside the pack. The optimal control policy (OP) that considers both battery pack temperature and SoC dynamics is studied in detail based on the assumption that information on the state of each cell, the schedule of reciprocating air flow and the future driving profile are perfectly known. Results show that OP provides significant reductions in temperature and in SoC deviations compared with the uniform use of all cells even with uni-directional coolant flow. Thus, reciprocating coolant flow is a redundant function for a MLC-based cell balancer. A specific contribution of this paper is the derivation of a state-space electro-thermal model of a battery submodule for both uni-directional and reciprocating coolant flows under the switching action of MLC, resulting in OP being derived by the solution of a convex optimization problem.

Optimum Power Allocation of Cooperative NOMA Systems based on User Relay (사용자 릴레이를 채택한 협동 NOMA 시스템의 최적 전력할당)

  • Kim, Nam-Soo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.5
    • /
    • pp.25-33
    • /
    • 2017
  • NOMA (Non-orthogonal multiple access) system becoming a strong candidate for 5G cellular system of its high spectral efficiency. This paper considers an optimal power allocation scheme to minimize the outage probability of a user relay based cooperative NOMA system. We first derive the outage probabilities of the relay user (RU) and the destination user (DU) with selection combining. Based on these probabilities, the outage probability of the cooperative NOMA system is obtained. The analytical results are verified by Monte Carlo simulation. It is noticed that the outage probability of cooperative NOMA system has a convex function, the optimum power allocation coefficient, which satisfied the minimum outage probability, is calculated. Numerical examples show that the optimal power allocation coefficient increases with the required capacity of DU. While the capacity of DU is fixed, we noticed that the increase of the required capacity of RU decreases the optimal power allocation coefficient.

THE FIRST EIGENVALUE ESTIMATE ON A COMPACT RIEMANNIAN MANIFOLD

  • Kim, Bang-Ok
    • Bulletin of the Korean Mathematical Society
    • /
    • v.30 no.2
    • /
    • pp.229-238
    • /
    • 1993
  • Let M be an n-dimensional compact Riemannian manifold with boundary .part.M. We consider the Neumann eigenvalue problem on M of the equation (Fig.) where .upsilon. is the unit outward normal vector to the boundary .part.M. due to the importance of Poincare inequality for analysis on manifolds, one wishes to obtain the lower bound of the first non-zero eigenvalue .eta.$_{1}$ of (1.1). For the purpose of applications, it is important to relax the dependency of the lower bound on the geometric quantities. For general compact manifolds with convex boundary, Li-Yau [3] obtained the lower bound of .eta.$_{1}$. Recently, Roger Chen [1] investigated the lower bound of the first Neumann eigenvalue .eta.$_{1}$ on compact manifold M with nonconvex boundary. We investigate the lower bound .eta.$_{1}$ with the same conditions as those of Roger chen. But, using the different auxiliary function, we have the following theorem.

  • PDF

A Simulated Annealing Method for Solving Combined Traffic Assignment and Signal Control Problem (통행배정과 신호제어 결합문제를 풀기위한 새로운 해법 개발에 관한 연구)

  • 이승재
    • Journal of Korean Society of Transportation
    • /
    • v.16 no.1
    • /
    • pp.151-164
    • /
    • 1998
  • 본 논문은 통행배정과 교통신호제어기의 결합문제를 풀기 위한 새로운 해법의 제시를 목적으로 한다. 통행배정과 신호제어 결합모형은 네트웍 디자인 문제(Network Design Problem)로 비선형 비분리 목적함수(Nonlinear and Nonseparable Objective Function)와 비선형제약 및 비컴백스 집합(Nonlinear and Non-Convex Set)형태로 인해 다수의 국지해(Multiple Local Optima)를 갖는 특징이 있다. 따라서 이렇게 복잡하고 난해한 문제를 푸는 해법은 많은 국지해중에 가장 최소한 값(Global Optima)을 찾을수 있는 방법을 제공하여야한다. 전체최적해(Global Optima)를 찾 을 수 있는 기존의 방법들은 확률적최적화방법(Stochastic Optimization Methods)에 속한다. 본연구에서는 이러한 방법중 금속공학에서 발 견된 모의담금빌법(Simulated Annealing Method)에 근거한 해법을 제시한다. 이방법이 통행배정과 신호제어 결합문제에 적용되는지 검토하기 위해 이해법의 수렴성(Convergence)을 증명했으며 또한 실제 프로그램된 모형을 작은 고안된 네트워크에 적 용했다. 마지막으로는 개발된 해법의 실용성을 실험하기 위해 두 가지의 보다 큰 도로망에 적용 및 분석을 했다.

  • PDF

Robust Reactor Power Control System Design by Genetic Algorithm

  • Lee, Yoon-Joon;Cho, Kyung-Ho;Kim, Sin
    • Proceedings of the Korean Nuclear Society Conference
    • /
    • 1997.10a
    • /
    • pp.293-298
    • /
    • 1997
  • The H$_{\infty}$robust controller fur the reactor power control system is designed by use of the mixed weight sensitivity. The system is configured into the typical two-port model with which the weight functions are augmented. Since the solution depends on the weighting functions and the problem is of non-convex, the genetic algorithm is used to determine the weighting functions. The cost function applied in the genetic algorithm permits the direct control of the power tracking performances. In addition, the actual operating constraints such as rod velocity and acceleration can be treated as design parameters. Compared with the conventional approach, the controller designed by the genetic algorithm results in the better performances with the realistic constraints. Also, it is found that the genetic algorithm could be used as an effective tool in the robust design. robust design.

  • PDF

[ $H_{\infty}$ ] Tracking Control of Time-delayed Linear Systems with Saturating Actuators (포화 구동기를 갖는 시간지연 선형시스템의 $H_{\infty}$ 추종 제어기)

  • Yi, Yearn-Gui;Kim, Jin-Hoon
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.57 no.4
    • /
    • pp.668-676
    • /
    • 2008
  • In this paper, we considered the $H_{\infty}$ tracking control for time-delayed linear systems with saturating actuators. The considered time delay is a time varying one having bounded magnitude and rate, and the considered tracking reference is a general one only known its bounds of magnitude and rate. First, we have converted the $H_{\infty}$ tracking control problem into an equivalent $H_{\infty}$ disturbance attenuation problem using two steps of transformations. Next, based on a new Lyapunov-Krasovskii functional, we have derived the result in the form of LMI with two non-convex parameters. Finally, by numerical examples, we have shown the usefulness and effectiveness of our result.

An Abnormal Breakpoint Data Positioning Method of Wireless Sensor Network Based on Signal Reconstruction

  • Zhijie Liu
    • Journal of Information Processing Systems
    • /
    • v.19 no.3
    • /
    • pp.377-384
    • /
    • 2023
  • The existence of abnormal breakpoint data leads to poor channel balance in wireless sensor networks (WSN). To enhance the communication quality of WSNs, a method for positioning abnormal breakpoint data in WSNs on the basis of signal reconstruction is studied. The WSN signal is collected using compressed sensing theory; the common part of the associated data set is mined by exchanging common information among the cluster head nodes, and the independent parts are updated within each cluster head node. To solve the non-convergence problem in the distributed computing, the approximate term is introduced into the optimization objective function to make the sub-optimization problem strictly convex. And the decompressed sensing signal reconstruction problem is addressed by the alternating direction multiplier method to realize the distributed signal reconstruction of WSNs. Based on the reconstructed WSN signal, the abnormal breakpoint data is located according to the characteristic information of the cross-power spectrum. The proposed method can accurately acquire and reconstruct the signal, reduce the bit error rate during signal transmission, and enhance the communication quality of the experimental object.

Adaptive MAP High-Resolution Image Reconstruction Algorithm Using Local Statistics (국부 통계 특성을 이용한 적응 MAP 방식의 고해상도 영상 복원 방식)

  • Kim, Kyung-Ho;Song, Won-Seon;Hong, Min-Cheol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.12C
    • /
    • pp.1194-1200
    • /
    • 2006
  • In this paper, we propose an adaptive MAP (Maximum A Posteriori) high-resolution image reconstruction algorithm using local statistics. In order to preserve the edge information of an original high-resolution image, a visibility function defined by local statistics of the low-resolution image is incorporated into MAP estimation process, so that the local smoothness is adaptively controlled. The weighted non-quadratic convex functional is defined to obtain the optimal solution that is as close as possible to the original high-resolution image. An iterative algorithm is utilized for obtaining the solution, and the smoothing parameter is updated at each iteration step from the partially reconstructed high-resolution image is required. Experimental results demonstrate the capability of the proposed algorithm.

Resource Allocation and EE-SE Tradeoff for H-CRAN with NOMA-Based D2D Communications

  • Wang, Jingpu;Song, Xin;Dong, Li
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.4
    • /
    • pp.1837-1860
    • /
    • 2020
  • We propose a general framework for studying resource allocation problem and the tradeoff between spectral efficiency (SE) and energy efficiency (EE) for downlink traffic in power domain-non-orthogonal multiple access (PD-NOMA) and device to device (D2D) based heterogeneous cloud radio access networks (H-CRANs) under imperfect channel state information (CSI). The aim is jointly optimize radio remote head (RRH) selection, spectrum allocation and power control, which is formulated as a multi-objective optimization (MOO) problem that can be solved with weighted Tchebycheff method. We propose a low-complexity algorithm to solve user association, spectrum allocation and power coordination separately. We first compute the CSI for RRHs. Then we study allocating the cell users (CUs) and D2D groups to different subchannels by constructing a bipartite graph and Hungrarian algorithm. To solve the power control and EE-SE tradeoff problems, we decompose the target function into two subproblems. Then, we utilize successive convex program approach to lower the computational complexity. Moreover, we use Lagrangian method and KKT conditions to find the global optimum with low complexity, and get a fast convergence by subgradient method. Numerical simulation results demonstrate that by using PD-NOMA technique and H-CRAN with D2D communications, the system gets good EE-SE tradeoff performance.