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

The introduction of competition in electricity market emphasizes the importance of sufficient transmission capacities to guarantee various electricity transactions. Therefore, when dispatch scheduling, transmission security constraints should be considered for the economic and stable electric power system operation. In this paper, we propose an optimal dispatch scheduling algorithm incorporating transmission security constraints. For solving these constraints, the dispatch scheduling problem is decomposed into a master problem to calculate a general optimal power flow (OPF) without transmission security constraints and several subproblems to inspect the feasibility of OPF solution under various transmission line contingencies. If a dispatch schedule given by the master problem violates transmission security constraints, then an additional constraint is imposed to the master problem. Through these iteration processes between the master problem and subproblems, an optimal dispatch schedule reflecting the post-contingency rescheduling is derived. Moreover, since interruptible loads can positively participate as generators in the competitive electricity market, we consider these interruptible loads active control variables. Numerical example demonstrates efficiency of the proposed algorithm.

• Journal of Electrical Engineering and Technology
• /
• 제3권2호
• /
• pp.199-206
• /
• 2008

The introduction of competition in electricity markets emphasizes the importance of sufficient transmission capacities to guarantee effective power transactions. Therefore, for the economic and stable electric power system operation, transmission security constrains should be incorporated into the dispatch scheduling problem. With the intent to solve this problem, we decompose a dispatch scheduling problem into a master problem(MP) and several subproblems(SPs) using Benders decomposition. The MP solves a general optimal power flow(OPF) problem while the SPs inspect the feasibility of OPF solution under respective transmission line contingencies. If a dispatch scheduling solution given by the MP violates transmission security constraints, then additional constraints corresponding to the violations are imposed to the MP. Through this iterative process between the MP and SPs, we derive an optimal dispatch schedule incorporating the post-contingency corrective rescheduling. In addition, we consider interruptible loads as active control variables since the interruptible loads can participate as generators in competitive electricity markets. Numerical examples demonstrate the efficiency of the proposed algorithm.

• 대한전기학회논문지:전력기술부문A
• /
• 제50권9호
• /
• pp.424-430
• /
• 2001

A multi-level optimal power flow(OPF) algorithm has been evolved from a simple two stage optimal Power flow algorithm for constrained power economic dispatch control. In the proposed algorithm, we consider various constraints such as ower balance, generation capacity, transmission line capacity, transmission losses, security equality, and security inequality constraints. The proposed algorithm consists of four stages. At the first stage, we solve the aggregated problem that is the crude classical economic dispatch problem without considering transmission losses. An initial solution is obtained by the aggregation concept in which the solution satisfies the power balance equations and generation capacity constraints. Then, after load flow analysis, the transmission losses of an initial generation setting are matched by the slack bus generator that produces power with the cheapest cost. At the second stage we consider transmission losses. Formulation of the second stage becomes classical economic dispatch problem involving the transmission losses, which are distributed to all generators. Once a feasible solution is obtained from the second stage, transmission capacity and other violations are checked and corrected locally and quickly at the third stage. The fourth stage fine tunes the solution of the third stage to reach a real minimum. The proposed approach speeds up the two stage optimization method to an average gain of 2.99 for IEEE 30, 57, and 118 bus systems and EPRI Scenario systems A through D testings.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 하계학술대회 논문집 C
• /
• pp.926-928
• /
• 1998

A fast optimization algorithm has been evolved from a simple two stage optimal power flow(OPF) algorithm for constrained power economic dispatch. In the proposed algorithm, we consider various constraints such as power balance, generation capacity, transmission line capacity, transmission losses, security equality, and security inequality constraints. The proposed algorithm consists of four stages. At the first stage, we solve the aggregated problem that is the crude classical economic dispatch problem without considering transmission losses. An initial solution is obtained by the aggregation concept in which the solution satisfies the power balance equations and generation capacity constraints. Then, after load flow analysis, the transmission losses of an initial generation setting are matched by the slack bus generator that produces power with the cheapest cost. At the second stage we consider transmission losses. Formulation of the second stage becomes classical economic dispatch problem involving the transmission losses, which are distributed to all generators. Once a feasible solution is obtained from the second stage, transmission capacity and other violations are checked and corrected locally and quickly at the third stage. The fourth stage fine tunes the solution of the third stage to reach a real minimum. The proposed approach speeds up the coupled LP based OPF method to an average gain of 53.13 for IEEE 30, 57, and 118 bus systems and EPRI Scenario systems A through D testings.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권12호
• /
• pp.5191-5211
• /
• 2016

It is essential to satisfy class-specific QoS constraints to provide broadband services for new generation networks. The present study proposes a QoS-driven multicast scheme for wireless networks in which the transmission rate and end-to-end delay are assumed to be bounded during a multiple multicast session. A distributed algorithm was used to identify a cost-efficient sub-graph between the source and destination which can satisfy QoS constraints of a multicast session. The model was then modified as to be applied for wireless networks in which satisfying interference constraints is the main challenge. A discrete power control scheme was also applied for the QoS-aware multicast model to accommodate the effect of transmission power level based on link capacity requirements. We also proposed random power allocation (RPA) and gradient power allocation (GPA) algorithms to efficient resource distribution each of which has different time complexity and optimality levels. Experimental results confirm that the proposed power allocation techniques decrease the number of unavailable links between intermediate nodes in the sub-graph and considerably increase the chance of finding an optimal solution.

• 대한전기학회논문지:전력기술부문A
• /
• 제50권10호
• /
• pp.480-488
• /
• 2001

This paper presents a technique that can obtain an optimal solution for the Security-Constrained Economic Dispatch (SCED) problems using the Interior Point Method (IPM) while taking into account of the power flow constraints. The SCED equations are formulated by using only the real power flow equations from the optimal power flow. Then an algorithm is presented that can linearize the SCED equations based on the relationships among generation real power outputs, loads, and transmission losses to obtain the optimal solutions by applying the linear programming (LP) technique. The objective function of the proposed linearization algorithm are formulated based on the fuel cost functions of the power plants. The power balance equations utilize the Incremental Transmission Loss Factor (ITLF) corresponding to the incremental generation outputs and the line constraints equations are linearized based on the Generalized Generation Distribution Factor (GGDF). Finally, the application of the Primal Interior Point Method (PIPM) for solving the optimization problem based on the proposed linearized objective function is presented. The results are compared with the Simplex Method and the promising results ard obtained.

• ETRI Journal
• /
• 제37권5호
• /
• pp.898-905
• /
• 2015

In this paper, we consider a joint beamforming and jamming design to enhance physical layer security against potential multiple eavesdroppers in a multiple-input and single-output cellular broadcast channel. With perfect channel state information at the base station, we propose various design approaches to improve the secrecy of the target user. Among the proposed approaches, the combined beamforming of maximum ratio transmission and zero-forcing transmission with a combination of maximum ratio jamming and zero-forcing jamming (MRT + ZFT with MRJ + ZFJ) shows the best security performance because it utilizes the full transmit antenna dimensions for beamforming and jamming with an efficient power allocation. The simulation results show that the secrecy rate of this particular proposed approach is better than the rates of the considered conventional approaches with quality-of-service and outage probability constraints.

• Journal of Electrical Engineering and Technology
• /
• 제12권3호
• /
• pp.1307-1313
• /
• 2017

Sensor networks are composed of provide low powered, inexpensive distributed devices which can be deployed over enormous physical spaces. Coordination between sensor devices is required to achieve a common communication. In low cost, low power and short-range wireless environment, sensor networks cope with significant resource constraints. Security is one of main issues in wireless sensor networks because of potential adversaries. Several security protocols and models have been implemented for communication on computing devices but deployment these models and protocols into the sensor networks is not easy because of the resource constraints mentioned. Memory intensive encryption algorithms as well as high volume of packet transmission cannot be applied to sensor devices due to its low computational speed and memory. Deployment of sensor networks without security mechanism makes sensor nodes vulnerable to potential attacks. Therefore, attackers compromise the network to accept malicious sensor nodes as legitimate nodes. This paper provides the different security models as a metric, which can then be used to make pertinent security decisions for securing wireless sensor network communication.

• 대한전기학회논문지
• /
• 제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.

• 융합보안논문지
• /
• 제2권2호
• /
• pp.1-8
• /
• 2002

멀티미디어 정보 전송을 위해 RTP(Real-Time Transport Protocol)을 사용하며, 멀티미디어 정보 보안을 위해서는 RPT의 페이로드를 암호화해야 한다. RPT페이로드의 암호화를 위해서 암호화/복호화로 인한 지연이 멀티미디어 정보의 실시간 제약에 미치는 영향을 최소로 하면서 네트워크의 트래픽과 부하에 적응하며 암호화 알고리즘을 변경하기 위한 방법이 필요하다. 또한 멀티미디어 서비스 진행 중 서비스 이용을 중지한 사용자는 RPT 페이로드의 암호화 키를 알고 있기 때문에 페이로드를 보호하기 위해서는 암호화 키를 변경하기 위한 방법이 필요하다. 따라서 본 논문에서는 RPT 페이로드의 암호화를 위해, 암호화 알고리즘과 암호화 키를 변경하기 위한 SCPR(Security Control Protocol for RTP)를 설계하고 구현하였다.