• Proceedings of the KIEE Conference
• /
• 2007.07a
• /
• pp.806-807
• /
• 2007

Systematic studies on the dispatch scheduling algorithm and related constraints can enhance the effectiveness of electricity market operation. When System Operator (SO) establishes a dispatch schedule, the bid information should be preserved in the schedule as much as possible. In this paper, we introduce a new type of sensitivity factor called Line Outage Impact Factor (LOIF) to screen a transmission line causing the most severe outage when scheduling the dispatch. This screening can assure the stable system operation and make an efficient feedback between the SO and market participants. We propose a transmission line contingency constrained Pre-dispatch algorithm using sensitivity indices in a suitable Pre-dispatch scheduling. The proposed algorithm has been tested on sample system and the results show more secure operation against critical contingencies.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.3
• /
• pp.113-119
• /
• 2009

In this paper, we proposed an efficient TDMA scheduling algorithm for a clustered Wireless Sensor Network. Since some previous algorithms used unnecessary idle period and schedule period in each frame. It became an overhead that might consume unexpected energy and delay data transmission. To solve this problem, a dynamic scheduling algorithm according to the number of member nodes and node traffic load within a cluster was suggested. Our proposed DS-MAC(Dynamic Scheduling MAC) could save energy and reduce transmission delay Then DS-MAC was analyzed mathematically to compare with the previous algorithms.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.1
• /
• pp.44-52
• /
• 2000

This paper is contented with packet transmission scheduling problem for repeating all-to-all broadcasts in WDM optical passive-star networks in which there are N nodes and k wavelengths. It is assumed that each node has one tunable transmitter and one fixed-tuned receiver, and each transmitter can tune to k different wavelengths. The tuning delay represents the time taken for a transmitter to tune from one wavelength to another and represented as ${\delta}$(>0) in units of packet durations. We define all-to-all broadcast as the one where every node transmits packets to all the other nodes except itself. So, there are in total N(N-1) packets to be transmitted for an all-to-all broadcast. The optimal transmission scheduling is to schedule In such a way that all packets can be transmitted within the minimum time. In this paper, we propose the condition for optimal transmission schedules and present an optimal transmission scheduling algorithm for arbitrary values of N, k, and ${\delta}$ The cycle length of the optimal schedules is $max{[\frac{N}{k}](M-1)$, $k{\delta}+N-1$}.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.2A
• /
• pp.191-197
• /
• 2008

For the efficient transmission of burst data in the time varying wireless channel, opportunistic scheduling is one of the important techniques to maximize multiuser diversity gain. In this paper, we propose a distributed opportunistic scheduling scheme for wireless LAN network. A proportional fair scheduling, which is one of the opportunistic scheduling schemes, is used for centralized networks, whereas we design distributed proportional fair scheduling (DPFS) scheme and medium access control with distributed manner. In the proposed DPFS scheme, each receiver estimates channel condition and calculates independently its own priority with probabilistic manner, which can reduce excessive probing overhead required to gather the channel conditions of all receivers. We evaluate the proposed DPFS using extensive simulation and simulation results show that DPFS obtains higher network throughput than conventional scheduling schemes and has a flexibility to control the fairness and throughput by controlling the system parameter.

• Journal of information and communication convergence engineering
• /
• v.8 no.2
• /
• pp.223-227
• /
• 2010

In this paper, we present a QoS-aware MAC protocol (QA-MAC) for cluster based wireless sensor networks (WSNs). QA-MAC is a TDMA-based scheduling protocol that minimizes the energy consumption in multi-hop WSNs and provides Quality of Service (QoS). A dynamic scheduling algorithm according to the number of member nodes, node traffics, and traffic priorities is suggested. The selected cluster head allocates time slots for all member nodes in the first TDMA schedule period of each round. During the second schedule period in each round, the cluster head makes a schedule for all data transmission. The proposed QA-MAC (QoS-Aware MAC) could save energy, reduce transmission delay, and support QoS.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.7 no.1
• /
• pp.41-52
• /
• 2012

Recently, FlexRay was developed to replace controller area network (CAN) protocol in chassis networking systems, to remedy the shortage of transmission capacity and unsatisfactory real-time transmission delay of conventional CAN. FlexRay network systems require correct synchronization and complex scheduling parameters. However, because platform configuration register (PCR) setting and message scheduling is complex and bothersome task, FlexRay is more difficult to implement in applications than CAN protocol. To assist a network designer for implementing FlexRay cluster, this paper presents an analysis of FlexRay platform configuration register and automatic generation program of PCR. To demonstrate the feasibility of the automatic generation program, we evaluated its performance using experimental testbed.

• Journal of KSNVE
• /
• v.5 no.2
• /
• pp.183-195
• /
• 1995

The mathematical model of the gear reductioner which consists which consists of the geared rotor-bearing system containing case is developed, assuming as the lumped parameter system. Constraints for vibration suppresion as well as strength of gear teeth, and shaft and kinematic conditions in gear pairs are considered. To find the design parameters satisfing the proposed constraints, a direct search method modified by the technique of Taguchi's experimental scheduling is used. One and two stepped gear reductioners are designed so that the criticl speeds due to the gear transmission error are moved out of the operating speed range.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.4
• /
• pp.37-42
• /
• 2021

NOMA (Non-orthogonal multiple Access) system has been focused on the next generation cellular system for higher spectral efficiency. However, this requires user scheduling as the NOMA system is a multi-user system which accesses simultaneously. There are two representative scheduling schemes, proportionate scheduling (FP) and cumulative distribution function (CFD) scheduling. The PF scheduling is applied, the cell edge user is hard to obtain a transmit opportunity. Recently, CDF scheduling is obviously noted that it offers the same possibility of transmission for a user regardless of the location in a cell. We consider an uplink NOMA system with CDF scheduling, and obtain the channel access probabilities, the outage probabilities of the system with different number of users and different kinds of weights through simulation. The results indicate that the likelihood of each user accessing the channel is the same and the probability of failure decreases as the number of users increases. We found that the effect of the probability of failure is negligible as the weight of the cell edge user increases.

• Proceedings of the KIEE Conference
• /
• 1986.07a
• /
• pp.257-260
• /
• 1986

• The KIPS Transactions:PartC
• /
• v.16C no.4
• /
• pp.477-486
• /
• 2009

This paper proposes a dynamic bandwidth allocation (DBA) algorithm with adaptive maximum transmission window (DBA-AMTW) to increase channel utilization in Ethernet passive optical networks (EPONs). A polling mechanism in EPON determines channel utilization and puts constraints on DBA algorithm and scheduling. DBA algorithms based on interleaved polling with stop (IPS) allocate transmission windows to optical network units (ONU) considering requests of all ONUs. However channel idle time when any ONU does not transmit packets decreases channel utilization. Proposed DBA-AMTW improves efficiency of a network and allocates transmission windows effectively by appropriate DBA computation from REPORT messages of all ONUs. An adaptive maximum transmission window for each ONU determined by a DBA computation in the previous scheduling cycle. Simulation results show that the proposed DBA algorithm improves performance of throughput and average delay time.