• Journal of Power Electronics
• /
• v.15 no.5
• /
• pp.1348-1357
• /
• 2015

Under traditional unified power quality conditioner (UPQC) control, a UPQC series converter (SC) is mainly used to handle grid-side power quality problems while its parallel converter (PC) is mainly used to handle load-side power quality problems. The SC and PC are relatively independent. The SC is usually in standby mode and it only runs when the grid voltage abruptly changes. In this paper, novel UPQC coordinated control strategies are proposed which use the SC to share the reactive power compensation function of the PC especially without grid-side power quality problems. However, in some cases, there will be a circulating current between the SC and the PC, which will probably influence the compensation fashion, the compensation capacity, or the normal work of the UPQC. Through an active power circulation analysis, strategies with and without a circulating current are presented which fuses the reactive power allocation strategy of the SC and the PC, the composite control strategy of the SC and the compensation strategy of the DC storage unit. Both of the strategies effectively solve the SC long term idle problem, limit the influence of the circulating current, optimize all of the UPQC units and reduce the production cost. An analysis, along with simulation andexperimental results, is presented to verify the feasibility and effectiveness of the proposed control strategies.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.4
• /
• pp.684-690
• /
• 2003

In this paper, a contention-based reservation access control algorithm and a slot allocation algorithm are proposed for non-real-time bursty traffic services in the wireless ATM networks. In order to reduce the collisions of the reservation request packets, the base station scheduler calculates the transmission probability using the number of RAS minislots and the estimated load of the reservation request packets. And it broadcasts the calculated transmission probability over the downlink control channel. Mobile terminals, which have traffic burst, select randomly a RAS minislot and transmit the reservation request packet by the received transmission probability. The reservation request packet contains the number of packets in the buffer. The slot allocation is based on the buffer status of the received reservation request packets. The base station scheduler allocates slots in proportion to the total number of slots that are requested by each terminal.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.5A
• /
• pp.502-510
• /
• 2011

In this paper, we propose a slot scheduling algorithm for balancing power consumption in tree-based sensor networks. In this type of networks, nodes with lower depths tend to consume more energy than those with higher depths, thereby reducing the life time of the network. The proposed algorithm allocates a series of receiving slots first and then a series of sending slots. This way of slot allocation eases packet aggregation and filtering, and thus reduces traffic load on nodes near a sink. We compare the proposed algorithm and the frame-slot allocation algorithm employed in the TreeMAC by resorting to simulation. The simulation results showed that the proposed approach well achieves the balancing of power consumption.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4A
• /
• pp.330-335
• /
• 2007

This paper proposes a multichannel random access channel allocation scheme for multihop cellular networks to guarantee the stable throughput of a random access. The fundamental contribution is a mathematical formula for an optimal partition ratio of shared random access channels between a base station and a relay station. In addition, the proposed scheme controls the retransmission probability of random access packets under heavy load condition. Simulation results show that the proposed scheme can guarantee the required random access channel utilization and packet transmission delay even if the a random access packet arrival rate is higher than 0.1.

• ETRI Journal
• /
• v.34 no.3
• /
• pp.330-340
• /
• 2012

In many applications of wireless sensor actor networks (WSANs) that often run in harsh environments, the reduction of completion times of tasks is highly desired. We present a new time-aware, energy-aware, and starvation-free algorithm called Scate for assigning tasks to actors while satisfying the scalability and distribution requirements of WSANs with semi-automated architecture. The proposed algorithm allows concurrent executions of any mix of small and large tasks and yet prevents probable starvation of tasks. To achieve this, it estimates the completion times of tasks on each available actor and then takes the remaining energies and the current workloads of these actors into account during task assignment to actors. The results of our experiments with a prototyped implementation of Scate show longer network lifetime, shorter makespan of resulting schedules, and more balanced loads on actors compared to when one of the three well-known task-scheduling algorithms, namely, the max-min, min-min, and opportunistic load balancing algorithms, is used.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7B
• /
• pp.620-627
• /
• 2003

Ethernet passive optical networks (EPONs) are an emerging access network technology that provide a low-cost method of deploying optical access lines between a carrier's central office and customer sites. Dynamic bandwidth allocation (DBA) provides statistical multiplexing between the optical network units for efficient upstream channel utilization. To support dynamic bandwidth distribution, 1 propose an cyclic polling-based DBA algorithm for differentiated classes of service in EPONs. And, I show that an interleaved polling scheme severely decreases downstream channel capacity for user traffics when the upstream network load is low. To obtain realistic simulation results, I used synthetic traffic that exhibits the properties of self-similarity and long-range dependence I then analyzed the network performance under various loads, specifically focusing on packet delays for different classes of traffic.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.5
• /
• pp.187-198
• /
• 2008

This paper develops a framework for efficient resource management within the grid service environment. Resource management is the core element of the grid service; therefore, GridRMF(Grid Resource Management Framework) is modeled and developed in order to respond to such variable characteristics of resources as accordingly as possible. GridRMF uses the participation level of grid resource as a basis of its hierarchical management. This hierarchical management divides managing domains into two parts: VMS(Virtual Organization Management System) for virtual organization management and RMS(Resource Management System) for metadata management. VMS mediates resources according to optimal virtual organization selection mechanism, and responds to malfunctions of the virtual organization by LRM(Local Resource Manager) automatic recovery mechanism. RMS, on the other hand, responds to load balance and fault by applying resource status monitoring information into adaptive performance-based task allocation algorithm.

• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.245-252
• /
• 2001

Multicomputer systems achieve high performance by utilizing a number of computing nodes. Multidimensional meshes have become popular as multicomputer architectures due to their simplicity and efficiency. In this paper we propose an efficient processor allocation scheme for 3D torus based on first-fit approach. The scheme minimizes the allocation time by effectively manipulating the 3D information an 2D information using CST (Coverage Status Table). Comprehensive computer simulation reveals that the allocation time of the proposed scheme is always smaller than the earlier scheme based on best-fit approach, while allowing comparable processor utilization. The difference gets more significant as the input load increases. To investigate the performance of the proposed scheme with different scheduling environment, non-FCFs scheduling policy along with the typical FCFS policy is also studied.

• Journal of the Society of Naval Architects of Korea
• /
• v.52 no.2
• /
• pp.97-103
• /
• 2015

This paper has focused on the middle term process planning around quays based on the prefixed long-term plan of the product mixed ships. Recently, the order rate of high add-value ships in domestic shipyards has been sharply increased and the spending time at quays is accordingly on an increasing trend. For proper and practical process planning related to quays, it has to be closely connected with a long-term plan and product calendar, erection network and result of ship allocation around quays. Moreover, it is also required to include the integrated consideration of the whole process of a yard, each ship, and each team respectively. The most distinguishing feature of this study is that it would run on the ship allocation simulator and GIS framework in order not to be limited to the specific one yard and the readers can figure out the optimization formulation containing the work load leveling and a different approach from PERT/CPM. The proposed approach reflected all requirements from the department of process planning and management in a shipyard, and the analysis of the results has explained its performance of the optimization result with the examples of total 43 ships under construction from 2008 to 2013.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.26 no.3
• /
• pp.297-311
• /
• 1998

Landscaping on artificial ground is currently served as a means to imposing a greenery benefit on high-density and high-rise apartment sites. It functions as a sub-hierarchy in apartment planning such as ornamental element from the past. Major parking space tends to be allocated on the basement area in response to the required parking regulation. Therefore, competitive relatioinship between the parking and greenery space I limited outdoor of apartments leads to the development planning strategy and technology of artificial ground. This study aims at evaluating landscape planning on artificial ground of apartment complex through several approaches such as site survey, plan drawing analysis, and interview with related field experts. 15 survey apartment sites including Bundang Model, Shindaebang-dong, Pyoungchon Hyundai Apartments have been selected for conducting the research. Main results of this study are summarized below : First, scattering allocation of artificial ground between apartment building units is a dominant plan layout type among the survey sites. Even though unifying allocation type has an advantage to maximize underground parking space, it has a difficulty in maintaining proper soil ground base for nurturing plants. Therefore, underground parking space should be planned by unifying allocation type placed separately from apartment units. This plan type can provide a balanced planting between soil and artificial ground on surface level. Second, It is strongly recommended to integrate the whole planting base which involves architectural structure, drainage, and water proofing above the planting design. When considering that process as a professional subject dealing with natural material such as trees and shrubs, those tasks should be directed by landscape architectural divison and landscape architect. And planting area for artificial ground has to be specified in initial phase of architectural design. This step provides an opportunity to make a proper decision on structural load, drainage, and water proof design as an integrated part of the management.