• ETRI Journal
• /
• v.38 no.5
• /
• pp.941-951
• /
• 2016

In this paper, cognitive radio and simultaneous wireless information and power transfer (SWIPT) are effectively combined to design a spectrum-efficient and energy-efficient transmission paradigm. Specifically, a novel SWIPT-based primary-secondary cooperation model is proposed to increase the transmission rate of energy/spectrum constrained users. In the proposed model, a multi-antenna secondary user conducts simultaneous energy harvesting and information forwarding by means of power splitting (PS), and tries to maximize its own transmission rate under the premise of successfully assisting the data delivery of the primary user. After the problem formulation, joint power splitting and beamforming optimization algorithms for decode-and-forward and amplify-and-forward modes are presented, in which we obtain the optimal PS factor and beamforming vectors using a golden search method and dual methods. Simulation results show that the proposed SWIPTbased primary-secondary cooperation schemes can obtain a much higher level of performance than that of non-SWIPT cooperation and non-cooperation schemes.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.3
• /
• pp.58-66
• /
• 2003

The cut tree approach of Montreuil and Ratliff [16] and eigenvector approach [10] are used to automatically draw a feasible facility layout with aisle structure. The department arrangement can minimize an aisle distance criterion considering door locations and dimension constraints. The aisle distance is measured by the door to door distance between departments. An eigenvector and cut tree approaches [1] are implemented based on the branch and bound technique in Kim et al. [2] in order to obtain feasible layouts. Then, the algorithm to fix the door location of each department is developed. After the door locations are determined, the factory layout is evaluated in terms of aisle distance. The aisle structure is obtained by expanding the original layout. The solution is kept until we will find better factory layout. The proposed approach based on the branch and bound technique, in theory, will provide the optimal solution. If the runs are time and/or node limited, the proposed method is a strong heuristic. The technique is made further practical by the fact that the solution is constrained such that the rectangular shape dimensions length(l) and width(w) are fixed and a perfect fit is generated if a fit is possible.

• Journal of Korea Multimedia Society
• /
• v.22 no.6
• /
• pp.676-683
• /
• 2019

Wireless Sensor Networks (WSNs) consist of multiple tiny and power constrained sensors which use radio frequencies to carry out sensing in a designated sensor area. To effectively design and implement reliable WSN, it is critical to consider models, protocols, and algorithms that can optimize energy consumption of all the sensor nodes with optimal amount of packet delivery. It has been observed that deploying a single sink node comes with numerous challenges especially in a situation with high node density and congestion. Sensor nodes close to a single sink node receive more transmission traffic load compared to other sensors, thus causing quick depletion of energy which finally leads to an energy hole and sink hole problems. In this paper, we proposed the use of multiple energy efficient sink nodes with brute force technique under optimized parameters to improve on the number of packets delivered within a given time. Simulation results not only depict that, deploying N sink nodes in a sensor area has a maximum limit to offer a justifiable improvement in terms of packet delivery ratio but also offers a reduction in End to End delay and reliability in case of failure of a single sink node, and an improvement in the network lifetime rather than deploying a single static sink node.

• Journal of KIISE:Software and Applications
• /
• v.27 no.5
• /
• pp.463-472
• /
• 2000

In this paper, we consider the problem of realizing associative memories via cellular neural network(CNN). After introducing qualitative properties of the CNN model, we formulate the synthesis of CNN that can store given binary vectors with optimal performance as a constrained optimization problem. Next, we observe that this problem's constraints can be transformed into simple inequalities involving linear matrix inequalities(LMIs). Finally, we reformulate the synthesis problem as a generalized eigenvalue problem(GEVP), which can be efficiently solved by recently developed interior point methods. Proposed method can be applied to both space varying template CNNs and space-invariant template CNNs. The validity of the proposed approach is illustrated by design examples.

• Journal of Korean Society of Transportation
• /
• v.27 no.6
• /
• pp.147-156
• /
• 2009

We present a methodology for modeling and solving the transit frequency design problem with variable demand. The problem is described as a bi-level model based on a non-cooperative Stackelberg game. The upper-level operator problem is formulated as a non-linear optimization model to minimize net cost, which includes operating cost, travel cost and revenue, with fleet size and frequency constraints. The lower-level user problem is formulated as a capacity-constrained stochastic user equilibrium assignment model with variable demand, considering transfer delay between transit lines. An efficient algorithm is also presented for solving the proposed model. The upper-level model is solved by a gradient projection method, and the lower-level model is solved by an existing iterative balancing method. An application of the proposed model and algorithm is presented using a small test network. The results of this application show that the proposed algorithm converges well to an optimal point. The methodology of this study is expected to contribute to form a theoretical basis for diagnosing the problems of current transit systems and for improving its operational efficiency to increase the demand as well as the level of service.

• Journal of Astronomy and Space Sciences
• /
• v.26 no.2
• /
• pp.171-186
• /
• 2009

Various Earth-Moon transfer trajectories are designed and analyzed to prepare the future Korea's Lunar missions. Minimum fuel trajectory solutions are obtained for the departure year of 2017, 2020, 2022, and every required mission phases are analyzed from Earth departure to the final lunar mission orbit. N-body equations of motion are formulated which include the gravitational effect of the Sun, Earth and Moon. In addition, accelerations due to geopotential harmonics, Lunar J2 and solar radiation pressures are considered. Impulsive high thrust is assumed as the main thrusting method of spacecraft with launcher capability of KSLV-2 which is planned to be developed. For the method of injecting a spacecraft into a trans Lunar trajectory, both direct shooting from circular parking orbit and shooting from the multiple elliptical intermediate orbits are adapted, and their design results are compared and analyzed. In addition, spacecraft's visibility from Deajeon ground station are constrained to see how they affect the magnitude of TLI(Trans Lunar Injection) maneuver. The results presented in this paper includes launch opportunities, required optimal maneuver characteristics for each mission phase as well as the trajectory characteristics and numerous related parameters. It is confirmed that the final mass of Korean lunar explorer strongly depends onto the initial parking orbit's altitude and launcher's capability, rather than mission start time.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.15 no.6
• /
• pp.87-93
• /
• 2007

It is complicate to analysis the systems, dual mode hybrid systems, because they are composed of many planetary gear sets. For the performance test, it needs to define the systems with representative parameters. In this paper, system parameters, $\alpha$, $\beta$, $\zeta$, are introduced to define the systems, and an arbitrary system like E-IVT developed by Renault Motors is converted to the general system having equivalent parameters, such as $\beta'$, $R'_b$. Pontryagin principle and Kuhn-Tucker condition method are applied to solve the constrained problems, by which the methodology for accelerating test is generalized, and the results of the simulation are reported. In addition, the effects of alternative strategies are mentioned. The method of fuel economy test at engine mode is also introduced. The results of test at engine mode is different from the results of optimal trajectory, but the fuel economy of the engine mode is related to the highway driving and optimized operating of the system.

• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.463-472
• /
• 2009

Real-time operating systems must have satisfying various conditions such as effective scheduling policies, minimized interrupt delay, resolved priority inversion problems, and its applications to be completed within desired deadline. The real-time operating systems, therefore, should be designed and developed to be optimal for these requirements. MicroC/OS-II, a kind of Real-time operating systems, uses the basic priority inheritance with a mutex to solve priority inversion problems. For the implementation of mutex, the kernel in an operating system should provide supports for numerous tasks with same priority. However, MicroC/OS-II does not provide this support for the numerous tasks of same priority. To solve this problem, MicroC/OS-II cannot but using priority reservation, which leads to the waste of unnecessary resources. In this study, we have dealt with new design a protocol, so called TPSP(Temporary Priority Swap Protocol), by an effective solution for above-mentioned problem, eventually enabling embedded systems with constrained resources environments to run applications.