• 한국멀티미디어학회논문지
• /
• 제10권6호
• /
• pp.745-753
• /
• 2007

The wireless medium is known to be time-varying which could affect and result to a poor network's performance. As a solution, an opportunistic scheduling and power control algorithm based on IEEE 802.11 MAC protocol is proposed in this paper. The algorithm opportunistically exploits the channel condition for better network performance. Convex optimization problems were also formulated i.e. the overall transmission power of the system is minimized and the "net-utility" of he system is maximized. We have proven that an optimal transmission power vector may exist, satisfying the maximum power and SINR constraints at all receivers, thereby minimizing overall transmission power and maximizing net-utility of the system.

• Journal of Power Electronics
• /
• 제18권6호
• /
• pp.1791-1804
• /
• 2018

To achieve a fast dynamic response and to solve the multi-objective control problems of the output currents, capacitor voltages and system constraints, this paper proposes a deadbeat and hierarchical predictive control with space-vector modulation (DB-HPC-SVM) for five-level nested neutral point piloted (NNPP) converters. First, deadbeat control (DBC) is adopted to track the reference currents by calculating the deadbeat reference voltage vector (DB-RVV). After that, all of the candidate switching sequences that synthesize the DB-RVV are obtained by using the fast SVM principle. Furthermore, according to the redundancies of the switch combination and switching sequence, a hierarchical model predictive control (MPC) is presented to select the optimal switch combination (OSC) and optimal switching sequence (OSS). The proposed DB-HPC-SVM maintains the advantages of DBC and SVM, such as fast dynamic response, zero steady-state error and fixed switching frequency, and combines the characteristics of MPC, such as multi-objective control and simple inclusion of constraints. Finally, comparative simulation and experimental results of a five-level NNPP converter verify the correctness of the proposed DB-HPC-SVM.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2000년도 하계학술대회 논문집 A
• /
• pp.391-393
• /
• 2000

This paper presents an new algorithm for the economic load dispatch considering the reliability level constraints of composite power system under deregulated electricity market. It is the traditional ELD problem that generation powers have been dispatched In order to minimize total fuel cost subjected to constraints which sum of powers generated must equal the received load and no violating lower and upper limit constraints on generation. Under deregulated electricity market, however, generation powers of a pool have to be reallocated newly in order to satisfy the reliability differentiated level required at a load point because of a reliability differentiated electricity service which is a part of the priority service. In this study, new economic load dispatch algorithm for reallocating the generation powers of a pool in order to satisfy the reliability differentiated level under deregulated competitive electricity market is proposed. The uncertainties of not only generators but also transmission lines are considered fer the reliability evaluation. The characteristics and effectiveness of this methodology are illustrated by the case studies on MRBTS and IEEE-RTS.

• 경영과학
• /
• 제12권2호
• /
• pp.89-103
• /
• 1995

Traditionally, the scarce and expensive resources in communication networks has been the bandwidth of transmission facilities; accordingly, the techniques used for networking and switching have been chosen so as to optimize the efficient use of that resource. One of them is the packet switching for data communications, which is much different from the circuit switching. It allows multiple users to share the data network facilities and bandwidth, rather than providing specific amounts of dedicated bandwidth to each users. One main challenge therefore has been to design and build cost-effective packet switching networks. In this paper, we develop a mathematical programming medel and heuristic algorithm for designing the packet switching networks with hop-count constraints. To develop an efficient heuristic, we apply the Lagrangian relaxation method. Some valid inequalities, which have been known as the tight constraints, are considered to improve the bound for Lagrangian sub-problem. The computational experiments show that the performance of the proposed heuristic is very satisfactory in both the speed and the quality of design solutions generated.

• 대한전기학회논문지:전력기술부문A
• /
• 제54권3호
• /
• pp.152-157
• /
• 2005

An objected-oriented programming(OOP) technique is introduced to dispatch schedules for TWBP. Some dispatch schedules such as constrained (pre)dispatch, unconstrained (pre)dispatch, and nominal self-dispatch schedule need to be peformed to make power market work. These dispatch schedules are similar but have some differences in required constraints, needed data, and scheduling time. Therefore, it makes the scheduling program simple to introduce the OOP technique to this problem: to have each instance of the OOP perform its own dispatch scheduling. The developed program adopts linear programming(LP) as an optimization tool and could consider some crucial constraints such as power balance, generation power limits, generation ramp-rates, power limitations of transmission lines, and power system security.

• Journal of Communications and Networks
• /
• 제16권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
• /
• 제29권4호
• /
• pp.524-526
• /
• 2007

In this letter, we study the multicast protection problem in sparse-splitting wavelength-division multiplexing (WDM) optical network, and propose a novel multicast protection algorithm called the shared source-leaf path-based protection (SLPP) algorithm. Unlike the proposals in previous studies, the backup paths derived by SLPP can share wavelength with the primary tree in sparse-splitting WDM networks. Simulations are used to evaluate the effectiveness of the SLPP algorithm.

• 대한전기학회논문지
• /
• 제35권12호
• /
• pp.594-602
• /
• 1986

This paper proposes an effective algorithm for short-term generation scheduling for the purpose of economic and secure operation of thermal power systems. Especially, in the procedure of solution by Dynamic Programming, Linear Programming is introduced to promote the possibility of optimal solution and the security of power systems, and evaluation of security function is improved by the application of seven step approximation of normal distribution. Several necessary considerations, that is, time dependent start-up and constant down cost of generating units, demand and spinning reserve constraints, minimum up and sown time constraints, the number of possible start-up of a generating unit in a d and the number of generating units which can be started up at the same time at the same bus, are also incoporated to elevate the usability and flexibility of the algorithm. Finally, the effectiveness of the proposed algorithm has been demonstrated by applying to the 6-gen. 21-bus model power system.

• 전기학회논문지
• /
• 제59권3호
• /
• pp.485-491
• /
• 2010

Total Transfer Capability (TTC) should be pre-determined in order to estimate Available Transfer Capability (ATC). Typically, TTC is determined by considering three categories; voltage, stability and thermal limits. Among these, thermal limits are treated mainly in this paper on the evaluation of TTC due to the relatively short transmission line length of Korea Electric Power Corporation (KEPCO) system. This paper presents a new approach to evaluate the TTC using the Dynamic Line Rating (DLR) for the thermal limit. Since the approach includes not only traditional electrical constraints but also real-time environmental constraints, this paper obtains more cost-effective and exact results. A case study using KEPCO system confirms that the proposed method is useful for real-time operation and the planning of the electricity market.

• 대한전기학회논문지:전력기술부문A
• /
• 제53권10호
• /
• pp.573-580
• /
• 2004

A new real-time constrained dispatch scheduling (CDS) is needed for TWBP. The CDS needs to be performed at every dispatch period to decide generation power of scheduling generators and amounts of scheduling load. Therefore, the CDS is not based on real generation costs but on bidding data of market participants with some constraints such as power balance, generation limits, ancillary service, and transmission line limits. This paper selects linear programming(LP) as an optimization tool for the CDS and presents effective formulae for the LP application. This paper also presents the way of minimizing the number of variables and constraints of the LP to improve real-time applicability.