• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.921-940
• /
• 2015

In this paper, we investigate the multi-resource allocation problem, a unique feature of which is that the multiple resources can compensate each other while achieving the desired system performance. In particular, power and time allocations are jointly optimized with the target of energy efficiency under the resource-limited constraints. Different from previous studies on the power-time tradeoff, we consider a multi-server case where the concurrent serving users are quantitatively restricted. Therefore user selection is investigated accompanying the resource allocation, making the power-time tradeoff occur not only between the users in the same server but also in different servers. The complex multivariate optimization problem can be modeled as a variant of 2-Dimension Bin Packing Problem (V2D-BPP), which is a joint non-linear and integer programming problem. Though we use state decomposition model to transform it into a convex optimization problem, the variables are still coupled. Therefore, we propose an Iterative Dual Optimization (IDO) algorithm to obtain its optimal solution. Simulations show that the joint multi-resource allocation algorithm outperforms two existing non-joint algorithms from the perspective of energy efficiency.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4603-4624
• /
• 2016

In this paper, a new reversible watermarking algorithm with adaptive embedding threshold matrix is proposed. Firstly, to avoid the overflow and underflow, two flexible thresholds, TL and TR, are applied to preprocess the image histogram with least histogram shift cost. Secondly, for achieving an optimal or near optimal tradeoff between the embedding capacity and imperceptibility, the embedding threshold matrix, composed of the embedding thresholds of all blocks, is determined adaptively by the combination between the composite chaos and the average energy of Integer Wavelet Transform (IWT) block. As a non-liner system with good randomness, the composite chaos is suitable to search the optimal embedding thresholds. Meanwhile, the average energy of IWT block is calculated to adjust the block embedding capacity, and more data are embedded into those IWT blocks with larger average energy. The experimental results demonstrate that compared with the state-of-the-art reversible watermarking schemes, the proposed scheme has better performance for the tradeoff between the embedding capacity and imperceptibility.

• Proceedings of the KIEE Conference
• /
• 1991.07a
• /
• pp.738-743
• /
• 1991

A multiobjective analysis technique was applied for the optimum operation of pumps and reservoirs in service water transmission systems. Three major objectives were identified and assessed on the normally operating service water transmission systems. They are, 1) stability of pump operation; 2) economic point of view in minimizing the energy cost for pumping; 3) reliability in meeting the stochasticaly varying demands. The measures of these objectives were required times of pump on-offs in stability, required total energy cost in economics, and minimum required storage during the operating horizon in reliability. In order to find the best meeting solution to the decision maker, a set of non-dominated solutions which show the tradeoff relationships between the considering objectives were generated. The DM selects the best solution from this explicit tradeoff relationships using his heuristic decision rules or experience. The theory was verified by applying to the Kumi Service Water System. A combined technique of the ${\varepsilon}-constraint$ and the weighting methods was used to generate the nondominated solutions, and the dynamic programming algorithm was applied to find the optimal solution for the discretized multi-objective analysis problems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.12
• /
• pp.1045-1053
• /
• 2013

In this paper, we propose a new power-saving mechanism (PSM) for Long-Term Evolution (LTE) systems by considering a round-trip delay between a user equipment (UE) and its correspondence node. The proposed PSM changes the order of the operational procedures of the legacy LTE PSM by taking the traffic arrival pattern suffering the round-trip delay into account. After modeling the round-trip delay, we numerically analyze the proposed PSM with respect to energy consumption and buffering delay. Then, we characterize these performances by employing a simple energy-delay tradeoff (EDT) curve according to the operational parameters. The resulting EDT curve clearly shows that the proposed PSM outperforms the legacy LTE PSM in terms of both the energy consumption and buffering delay.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.58 no.4
• /
• pp.410-415
• /
• 2009

With the implementation of electric power industry reform, the utilities are looking for effective ways to improve the economic efficiency. One area in particular, the equipment maintenance, is being scrutinized for reducing costs while keeping a reasonable level of the reliability in the overall system. Here the conventional RCM requires the tradeoff between the upfront maintenance costs and the potential costs of losing loads. In this paper we describe the issues related to applying so-called the "Reliability-centered Maintenance" (RCM) method in managing electric power distribution equipment. The RCM method is especially useful as it explicitly incorporates the cost-tradeoff of interest, i.e. the upfront maintenance costs and the potential interruption costs, in determining which equipment to be maintained and how often. In comparison, the "Time-based Maintenance" (TBM) method, the traditional method widely used, only takes the lifetime of equipment into consideration. In this paper, the modified Markov model for maintenance is developed. First, the existing Markov model for maintenance is explained and analyzed about transformer and circuit breaker, so on. Second, developed model is introduced and described. This model has two different points compared with existing model: TVFR and nonlinear customer interruption cost (CIC). That is, normal stage at the middle of bathtub curve has not CFR but the gradual increasing failure rate and the unit cost of CIC is increasing as the interruption time is increasing. The results of case studies represent the optimal maintenance interval to maintain the equipment with minimum costs. A numerical example is presented for illustration purposes.

• Journal of Communications and Networks
• /
• v.12 no.4
• /
• pp.334-345
• /
• 2010

In this paper, we study optimal tradeoffs of achievable throughput versus consumed power in wireless ad-hoc networks formed by a collection of multiple antenna nodes. Relying on adaptive modulation and/or dynamic channel coding rate allocation techniques for multiple antenna systems, we examine the maximization of throughput under power constraints as well as the minimization of transmission power under throughput constraints. In our examination, we also consider the impacts of enforcing quality of service requirements expressed in the form of channel coding block loss constraints. In order to properly model temporally correlated loss observed in fading wireless channels, we propose the use of finite-state Markov chains. Details of fading statistics of signal-to-interference-noise ratio, an important indicator of transmission quality, are presented. Further, we objectively inspect complexity versus accuracy tradeoff of solving our proposed optimization problems at a global as oppose to a local topology level. Our numerical simulations profile and compare the performance of a variety of scenarios for a number of sample network topologies.

• The KIPS Transactions:PartA
• /
• v.16A no.3
• /
• pp.181-188
• /
• 2009

Transcoding is one of core techniques that implement VoD services according to QoS. But it consumes a lot of CPU resource. A transcoding proxy transcodes multimedia objects to meet requirements of various mobile devices and caches them to reuse later. In this paper, we propose a service policy that reduces the load of transcoding multimedia objects by degrading QoS in a transcoding proxy. Due to the tradeoff between QoS and the load of a proxy system, a transcoding proxy provides lower QoS than a client's requirement so that it can accomodate more clients.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1279-1300
• /
• 2017

In the interweave cognitive networks, the interference from the primary user degrades the performance of the cognitive user transmissions. In this paper, we propose an adaptive cooperation scheme in the interweave cognitive networks to improve the performance of the cognitive user transmissions. In the proposed scheme for the bidirectional communication of two end-source cognitive users, the bidirectional communication is completed through the non-relay direct transmission, the one-way relaying cooperation transmission, and the two-way relaying cooperation transmission depending on the limited feedback from the end-sources. For the performance analysis of the proposed scheme, we derive the outage probability and the finite-SNR diversity multiplexing tradeoff (f-DMT) in a closed form, considering the imperfect spectrum sensing, the interference from the primary user, and the power allocation between the relay and the end-sources. The results show that compared with the direct transmissions (DT), the pure one-way relaying transmissions (POWRT), and the pure two-way relaying transmissions (PTWRT), the proposed scheme has better outage performance. In terms of the f-DMT, the proposed scheme outperforms the full cooperation transmissions of the POWRT and PTWRT.

• ETRI Journal
• /
• v.39 no.1
• /
• pp.30-40
• /
• 2017

In this study, we investigate topology control as a means of obtaining the best possible compromise between the conflicting requirements of reducing energy consumption and improving network connectivity. A topology design algorithm capable of producing network topologies that minimize energy consumption under a minimum-connectivity constraint is presented. To this end, we define a new topology metric, called connectivity efficiency, which is a function of both algebraic connectivity and the transmit power level. Based on this metric, links that require a high transmit power but only contribute to a small fraction of the network connectivity are chosen to be removed. A connectivity-efficiency-based topology control (CETC) algorithm then assigns a transmit power level to each node. The network topology derived by the proposed CETC heuristic algorithm is shown to attain a better tradeoff between energy consumption and network connectivity than existing algorithms. Simulation results demonstrate the efficiency of the CECT algorithm.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.1
• /
• pp.128-132
• /
• 1996

In [1], it is shown that a subclass of ETBFs, which are self-dual ETBFs, can be expressed as a weighted average of median subfiltered outputs. In this paper, we extend this result to general ETBFs. In particular, we show that any ETBF can be represented as a weighted average of minimum (or maximum) subfiltered outputs. These representations naturally lead to a subclass of ETBF, called the K-th order ETBF (K-ETBF) that employs only those subfilters whose window sizes are less than or equal to K. By designing K-ETBFs under the mean square error criterion for various values of K and applying them to restore noisy signals, the tradeoff between the performance and the complexity of this class of filters is examined.