• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2709-2734
• /
• 2020

The growing demand to make wireless data services 5G compatible has necessitated the development of an energy-efficient approach for an effective new wireless environment. In this paper, we first propose a cognitive sensor node (CSN) based game theory for deriving energy via a primary user-transmitted radio frequency signal. Cognitive users' time was segmented into three phases based on a time switching protocol: energy harvest, spectrum sensing and data transmission. The proposed model chooses the optimal energy-harvesting phase as the effected factor. We further propose a distributed energy-harvesting model as a utility function via pricing techniques. The model is a non-cooperative game where players can increase their net benefit in a selfish manner. Here, the price is described as a function pertaining to transmit power, which proves that the proposed energy harvest game includes Nash Equilibrium and is also unique. The best response algorithm is used to achieve the green connection between players. As a result, the results obtained from the proposed model and algorithm show the advantages as well as the effectiveness of the proposed study. Moreover, energy consumption was reduced significantly (12%) compared to the benchmark algorithm because the proposed algorithm succeeded in delivering energy in micro which is much better compared to previous studies. Considering the reduction and improvement in power consumption, we could say the proposed model is suitable for the next wireless environment represented in 5G.

• Journal of Advanced Marine Engineering and Technology
• /
• v.35 no.6
• /
• pp.820-828
• /
• 2011

Energy saving is one of the most important factors for profits in marine transportation. In order to reduce the specific fuel oil consumption, the ship's propulsion efficiency must be increased as much as possible. The propulsion efficiency depends upon a combination of propulsion engine and propeller that has better efficiency as lower rotational speed. As the engine has lower speed the variation of rotational torque become larger because of the longer delay time in fuel oil injection process. In this study, robust control theory is applied to the design of engine speed controllers which are sub-optimal $H_{\infty}$ controller, $H_{\infty}$ loop-shaping controller and ${\mu}$-synthesis controller considering robust stability and robust performance. And the validity of these three controllers is investigated through the results of computer simulation.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.4
• /
• pp.320-328
• /
• 2007

This paper presents a stiffness modeling of a low-DOF parallel robot, which takes into account of elastic deformations of joints and links, A low-DOF parallel robot is defined as a spatial parallel robot which has less than six degrees of freedom. Differently from serial chains in a full 6-DOF parallel robot, some of those in a low-DOF parallel robot may be subject to constraint forces as well as actuation forces. The reaction forces due to actuations and constraints in each serial chain can be determined by making use of the theory of reciprocal screws. It is shown that the stiffness of an F-DOF parallel robot can be modeled such that the moving platform is supported by 6 springs related to the reciprocal screws of actuations (F) and constraints (6-F). A general $6{\times}6$ stiffness matrix is derived, which is the sum of the stiffness matrices of actuations and constraints, The compliance of each spring can be precisely determined by modeling the compliance of joints and links in a serial chain as follows; a link is modeled as an Euler beam and the compliance matrix of rotational or prismatic joint is modeled as a $6{\times}6$ diagonal matrix, where one diagonal element about the rotation axis or along the sliding direction is infinite. By summing joint and link compliance matrices with respect to a reference frame and applying unit reciprocal screw to the resulting compliance matrix of a serial chain, the compliance of a spring is determined by the resulting infinitesimal displacement. In order to illustrate this methodology, the stiffness of a Tricept parallel robot has been analyzed. Finally, a numerical example of the optimal design to maximize stiffness in a specified box-shape workspace is presented.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 1999.12a
• /
• pp.21-25
• /
• 1999

Planning support systems(PSS) add more advanced spatial analysis functions than Geographic information systems(GIS) and intertemporal functions to the functions of spatial decision support systems(SDSS). This paper reports the continuing development of a PSS providing a framework that facilitates urban planners and civil engineers in conducting coherent deliberations about planning, design and operation & maintenance(O&M) of water-distribution networks for urban growth management. The PSS using dynamic optimization model, modeling-to-generate-alternatives, value engineering(VE) and life-cycle cost(LCC) can generate network alternatives in consideration of initial cost and O&H cost. Users can define alternatives by the direct manipulation of networks or by the manipulation of parameters in the models. The water-distribution network analysis model evaluates the performance of the user-defined alternatives. The PSS can be extended to include the functions of generating sewer network alternatives, combining water-distribution and sewer networks, eventually the function of planning, design and O&H of housing sites. Capacity expansion by the dynamic water-distribution network optimization model using MINLP includes three advantages over capacity expansion using optimal control theory(Kim and Hopkins 1996): 1) finds expansion alternatives including future capacity expansion times, sizes, locations, and pipe types of a water-distribution network provided, 2) has the capabilities to do the capacity expansion of each link spatially and intertemporally, and 3) requires less interaction between models. The modeling using MINLP is limited in addressing the relationship between cost, price, and demand, which the optimal control approach can consider. Strictly speaking, the construction and O&M costs of water-distribution networks influence the price charged for the served water, which in turn influence the. This limitation can be justified in rather small area because price per unit water in the area must be same as that of neighboring area, i.e., the price is determined administratively. Planners and engineers can put emphasis on capacity expansion without consideration of the relationship between cost, price, and demand.

• Journal of Astronomy and Space Sciences
• /
• v.14 no.1
• /
• pp.142-149
• /
• 1997

This paper applied one of the well-known optimal control theory, namely, linear quadratic regulator(LQR), to the station-keeping maneuvers(SKM) for a geostationary satellite. The boundary conditions to transfer the system with a good accuracy at a terminal time were based upon the predicted orbital data which are created due to the Earth's non-uniform mass distribution's effect during 14 days and due to luni-solar effect during 28 days. Through the linearization of the nonlinear system equation with respect to reference orbit and the numerical integration of Riccati equation, the optimal trajectories and the corresponding control law have been obtained by using LQR. From the comparison of ${\Delta}V$ obtained by LQR with the ${\Delta}V$ obtained anatically by geometric method, Station Keeping Maneuvers(SKM) via LQR may provide comparable results to a real system. Furthermore it will demonstrate the possibility in fuel optimization and life extension of geostationary satellite.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.107-110
• /
• 2015

In this paper, we propose a coalitonal game theoritic approach to the power control problem in resource-constrained wireless sensor networks, where the objective is to enhance power efficiency of individual sensors while providing the QoS requirements. We model this problem as two-sided one-to-one matching game and deploly deferred acceptance procedure that produces a single matching in the core. Furthermore, we show that, by applying the procedure repeatedly, a certain stable state is achieved where no sensor can anticipate improvements in their power efficiency as far as all of them are subject to their own QoS constraints. We evaluate our proposal by comparing them with cluster-based and the local optimal solution obtained by maximizing the total system energy efficiency, where the objective function is non-convex.

• Journal of the Institute of Convergence Signal Processing
• /
• v.1 no.2
• /
• pp.169-176
• /
• 2000

Deadbeat property is well established in digital control system design in time domain. But in continuous time system, deadbeat is impossible because of it's ripples between sampling points inspite of designs using the related digital control system design theory. But several researchers suggested delay elements. A delay element is made from the concept of finite Laplace Transform. From some specifications such as internal model stability, physical realizations as well as finite time settling, unknown coefficents and poles in error transfer functions with delay elements can be calulted so as to satisfy these specifications. For the application to the real system, robustness property can be added. In this paper, error transfer function is specified with 1 delay element and robustness condition is considered additionally. As the criterion of the robustness, a weighted sensitive function's $H_{infty}$ norm is used. For the minimum value of the criterion, error transfer function's poles are calculated optimally. In this sense, optimal design of the continuous time deadbeat controller is obtained.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.7
• /
• pp.752-765
• /
• 1999

대부분 병렬처리 시스템에서 성능 파라미터는 복잡하고 프로그램의 수행 시 예견할 수 없게 변하기 때문에 컴파일러가 프로그램 수행에 대한 최적의 성능 파라미터들을 컴파일 시에 결정하기가 힘들다. 본 논문은 병렬 처리 시스템의 프로그램 수행 시, 변화하는 시스템 성능 상태에 따라 전체 성능이 최적화로 적응하는 적응 수행 방식을 제안한다. 본 논문에서는 이 적응 수행 방식 중에 적응 프로그램 수행을 위한 이론적인 방법론 및 구현 방법에 대해 제안하고 적응 제어 수행을 위해 프로그램의 데이타 공유 단위에 대한 적응방식(적응 입도 방식)을 사용한다. 적응 프로그램 수행 방식은 프로그램 수행 시 하드웨어와 컴파일러의 도움으로 프로그램 자신이 최적의 성능을 얻을 수 있도록 적응하는 방식이다. 적응 제어 수행을 위해 수행 시에 병렬 분산 공유 메모리 시스템에서 프로세서 간 공유될 수 있은 데이타의 공유 상태에 따라 공유 데이타의 크기를 변화시키는 적응 입도 방식을 적용했다. 적응 입도 방식은 기존의 공유 메모리 시스템의 공유 데이타 단위의 통신 방식에 대단위 데이타의 전송 방식을 사용자의 입장에 투명하게 통합한 방식이다. 시뮬레이션 결과에 의하면 적응 입도 방식에 의해서 하드웨어 분산 공유 메모리 시스템보다 43%까지 성능이 개선되었다. Abstract On parallel machines, in which performance parameters change dynamically in complex and unpredictable ways, it is difficult for compilers to predict the optimal values of the parameters at compile time. Furthermore, these optimal values may change as the program executes. This paper addresses this problem by proposing adaptive execution that makes the program or control execution adapt in response to changes in machine conditions. Adaptive program execution makes it possible for programs to adapt themselves through the collaboration of the hardware and the compiler. For adaptive control execution, we applied the adaptive scheme to the granularity of sharing adaptive granularity. Adaptive granularity is a communication scheme that effectively and transparently integrates bulk transfer into the shared memory paradigm, with a varying granularity depending on the sharing behavior. Simulation results show that adaptive granularity improves performance up to 43% over the hardware implementation of distributed shared memory systems.

• Asian-Australasian Journal of Animal Sciences
• /
• v.21 no.11
• /
• pp.1559-1571
• /
• 2008

A rule was developed to constrain the annual rate of inbreeding to a predefined value in a population with different lifetimes between sires and dams, and to maximize the selection response over generations. This rule considers that the animals in a population should be divided into sex-age classes based on the theory of gene flow, and restricts the increase of average inbreeding coefficient for new offspring by limiting the increase of the mean additive genetic relationship for parents selected. The optimization problem of this rule was formulated as a quadratic programming problem. Inputs for the rule were the BLUP estimated breeding values, the additive genetic relationship matrix of all animals, and the long-term contributions of sex-age classes. Outputs were optimal number and contributions of selected animals. In addition, this rule was combined with the optimization of emphasis given to QTL, and further increased the genetic gain over the planning horizon. Stochastic simulations of closed nucleus schemes for pigs were used to investigate the potential advantages obtained from this rule by combining the standard QTL selection, optimal QTL selection and conventional BLUP selection. Results showed that the predefined rates of inbreeding were actually achieved by this rule in three selection strategies. The rule obtained up to 9.23% extra genetic gain over truncation selection at the same rates of inbreeding. The combination of the extended rule and the optimization of emphasis given to QTL allowed substantial increases in selection response at a fixed annual rate of inbreeding, and solved substantially the conflict between short-term and long-term selection response in QTL-assisted selection schemes.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.9
• /
• pp.461-476
• /
• 2003

Due to the implementation ease and alleviation of memory bottleneck effect, NUMA architecture has dominated in the multiprocessor systems for the past several years. However, because the NUMA system distributes memory in each node, frequent remote memory access is a key factor of performance degradation. Therefore, efficient design of RAC(Remote Access Cache) in NUMA system is critical for performance improvement. In this paper, we suggest Multi-Grain RAC which can adaptively control the RAC line size, with respect to each application behavior Then we simulate NUMA system with multi-grain RAC using MINT, event-driven memory hierarchy simulator. and analyze the performance results. At first, with profile-based determination method, we verify the optimal RAC line size for each application and, then, we compare and analyze the performance differences among NUMA systems with normal RAC, with optimal line size RAC, and with multi-grain RAC. The simulation shows that the worst case can be always avoided and results are very close to optimal case with any combination of application and RAC format.