• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.10
• /
• pp.2382-2388
• /
• 2014

To provide network reliability in indoor wireless communication systems, we should resolve the problem of unexpected network failure rapidly. In this paper, we propose an adaptive resource management (ARM) scheme to support seamless connectivity to users. In consideration of system throughput and user fairness simultaneously, the ARM scheme adaptively determines the set of healing channels, and performs scheduling and power allocation iteratively based on a constrained non-convex optimization technique. Through intensive simulations, we demonstrate the superior performance results of the proposed ARM scheme in terms of the average cell capacity and user fairness.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.4923-4939
• /
• 2019

In this paper, a secure transmission scheme based on the artificial noise is proposed for D2D communications underlaying the full-duplex cellular network, and a secure power allocation scheme to maximize the overall secrecy rate of both the cellular user and D2D transmitter node is presented. Firstly, the full-duplex base station transmits the artificial noise to guarantee the secure communications when it receives signals of cellular uplinks. Under this secure framework, it is found that improving the transmission power of the cellular user or the D2D transmitter node will degrade the secrecy rate of the other, although will improve itself secrecy rate obviously. Hence, a secure power allocation scheme to maximize the overall secrecy rate is presented subject to the security requirement of the cellular user. However, the original power optimization problem is non-convex. To efficiently solve it, we recast the original problem into a convex program problem by utilizing the proper relaxation and the successive convex approximation algorithm. Simulation results evaluate the effectiveness of the proposed scheme.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.697-699
• /
• 2004

Despite many successful spectral clustering algorithm (based on the spectral decomposition of Laplacian(1) or stochastic matrix(2) ) there are several unsolved problems. Most spectral clustering Problems are based on the normalized of algorithm(3) . are close to the classical graph paritioning problem which is NP-hard problem. To get good solution in polynomial time. it needs to establish its convex form by using relaxation. In this paper, we apply a novel optimization technique. semidefinite programming(SDP). to the unsupervised clustering Problem. and present a new multiple Partitioning method. Experimental results confirm that the Proposed method improves the clustering performance. especially in the Problem of being mixed with non-compact clusters compared to the previous multiple spectral clustering methods.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.1
• /
• pp.211-232
• /
• 2024

In this paper, we consider the resource allocation and offloading decisions of device-to-device (D2D) cooperative UAV-assisted mobile edge computing (MEC) system, where the device with task request is served by unmanned aerial vehicle (UAV) equipped with MEC server and D2D device with idle resources. On the one hand, to ensure the fairness of time-delay sensitive devices, when UAV computing resources are relatively sufficient, an optimization model is established to minimize the maximum delay of device computing tasks. The original non-convex objective problem is decomposed into two subproblems, and the suboptimal solution of the optimization problem is obtained by alternate iteration of two subproblems. On the other hand, when the device only needs to complete the task within a tolerable delay, we consider the offloading priorities of task to minimize UAV computing resources. Then we build the model of joint offloading decision and power allocation optimization. Through theoretical analysis based on KKT conditions, we elicit the relationship between the amount of computing task data and the optimal resource allocation. The simulation results show that the D2D cooperation scheme proposed in this paper is effective in reducing the completion delay of computing tasks and saving UAV computing resources.

• Proceedings of the KIEE Conference
• /
• 2011.07a
• /
• pp.648-649
• /
• 2011

This Paper presents an efficient approach for solving the economic dispatch (ED) problems with valve-point effects using an combination of particle swarm optimization and harmony search. To reduce a premature convergence effect of PSO algorithm, We proposed PSO-HS algorithm considering evolutionary using harmony search algorithm. To prove the ability of the PSO-HS in solving nonlinear optimization problems, ED problems with non-convex solution spaces are solved with three different approach(PSO, HS, combination of PSO and HS)

• 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)을 증명했으며 또한 실제 프로그램된 모형을 작은 고안된 네트워크에 적 용했다. 마지막으로는 개발된 해법의 실용성을 실험하기 위해 두 가지의 보다 큰 도로망에 적용 및 분석을 했다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.5
• /
• pp.423-431
• /
• 2000

In this paper, the effect of computing time-delay in the real-time digital fuzzy control systems is investigated and the design methodology of a real-time digital fuzzy controller(DFC) to overcome the problems caused by it is presented. We propose the fuzzy feedback controller whose output is delayed with unit sampling period. The analysis and the design problem considering computing time-delay is very easy because the proposed controller is syncronized with the sampling time. The stabilization problem of the digital fuzzy control system is solved by the linear matrix inequality(LMI) theory. Convex optimization techniques are utilized to find the stable feedback gains and a common positive definite matrix P for the designed fuzzy control system Furthermore, we develop a real-time fuzzy control system for backing up a computer-simulated truck-trailer with the consideration of the computing time-delay. By using the proposed method, we design a DFC which guarantees the stability of the real time digital fuzzy control system in the presence of computing time-delay.

• Journal of Communications and Networks
• /
• v.16 no.1
• /
• pp.36-44
• /
• 2014

Exploiting the energy-delay tradeoff for energy saving is critical for developing green wireless communication systems. In this paper, we investigate the delay-constrained energy-efficient packet transmission. We aim to minimize the energy consumption of multiple randomly arrived packets in an additive white Gaussian noise channel subject to individual packet delay constraints, by taking into account the practical on-off circuit power consumption at the transmitter. First, we consider the offline case, by assuming that the full packet arrival information is known a priori at the transmitter, and formulate the energy minimization problem as a non-convex optimization problem. By exploiting the specific problem structure, we propose an efficient scheduling algorithm to obtain the globally optimal solution. It is shown that the optimal solution consists of two types of scheduling intervals, namely "selected-off" and "always-on" intervals, which correspond to bits-per-joule energy efficiency maximization and "lazy scheduling" rate allocation, respectively. Next, we consider the practical online case where only causal packet arrival information is available. Inspired by the optimal offline solution, we propose a new online scheme. It is shown by simulations that the proposed online scheme has a comparable performance with the optimal offline one and outperforms the design without considering on-off circuit power as well as the other heuristically designed online schemes.

• ETRI Journal
• /
• v.31 no.1
• /
• pp.86-88
• /
• 2009

In this letter, we consider an m-node tandem queue (queues in series) with a Poisson arrival process and either deterministic or non-overlapping service times. With the assumption that each node has a finite buffer except for the first node, we show the non-increasing convex property of stationary waiting time with respect to the finite buffer capacities. We apply it to an optimization problem which determines the smallest buffer capacities subject to probabilistic constraints on stationary waiting times.