• Journal of Korea Water Resources Association
• /
• v.53 no.8
• /
• pp.597-604
• /
• 2020

Muskingum, a hydrologic channel flood routing, is a method of predicting outflow by using the relationship between inflow, outflow, and storage. As many studies for Muskingum model were suggested, parameters were gradually increased and the calculation process was complicated by many parameters. To solve this problem, an optimization algorithm was applied to the parameter estimation of Muskingum model. This study applied the Advanced Nonlinear Muskingum Model considering continuous flow (ANLMM-L) to Wilson flood data and Sutculer flood data and compared results of the Linear Nonsingum Model incorporating Lateral flow (LMM-L), and Kinematic Wave Model (KWM). The Sum of Squares (SSQ) was used as an index for comparing simulated and observed results. Exponential Bandwidth Harmony Search with Centralized Global Search (EBHS-CGS) was applied to the parameter estimation of ANLMM-L. In Wilson flood data, ANLMM-L showed more accurate results than LMM-L. In the Sutculer flood data, ANLMM-L showed better results than KWM, but SSQ was larger than in the case of Wilson flood data because the flow rate of Sutculer flood data is large. EBHS-CGS could be appplied to be appplicable to various water resources engineering problems as well as Muskingum flood routing in this study.

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.123-131
• /
• 2006

Several distributed architectures, incorporating mobile agent technology, have been recently proposed to answer the scalability limitations of their centralized counterparts. However, these architectures fail to address scalability problems, when distributed tasks requiring the employment of itinerant agents is considered. This is because they lack mechanisms that guarantee optimization of agents' itineraries so as to minimize the total migration cost in terms of the round-trip latency and the incurred traffic. This is of particular importance when MAs itineraries span multiple subnets. The work presented herein aspires to address these issues. To that end, we have designed and implemented an algorithm that adapts methods usually applied for addressing network design problems in the specific area of mobile agent itinerary planning. The algorithm not only suggests the optimal number of mobile agents that minimize the overall cost but also constructs optimal itineraries for each of them. The algorithm implementation has been integrated into our mobile agent framework research prototype and tested in real network environments, demonstrating significant cost savings.

• Journal of IKEEE
• /
• v.6 no.1 s.10
• /
• pp.87-93
• /
• 2002

In this paper, an advanced load balancing algorithm in nth order Hypercube distributed system has been proposed. The new algorithm uses centralized load-balancing to avoid blocking phenomenon and processor thrashing, and shows the results which makes loads to approach average value of loads. The new algorithm is compared with several other algorithm and it shows a merit in cost function value.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.153-154
• /
• 2006

We propose the dynamic channel allocation (DCA) algorithm for multi-cell OFDMA systems to avoid co-channel interference (CCI). The proposed algorithm is utilized not in a centralized, but in a distributed manner which reduces complexity. The simulation results confirm that the number of overlapping allocated subcarriers is reduced and the average SINR of a sub-carrier is increased by this algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.2
• /
• pp.67-74
• /
• 2019

Since the announcement of bitcoin, new cryptocurrencies have been launched steadily and blockchain technology is also evolving with cryptocurrcies. In particular, security-related technologies such as consensus algorithm and hash algorithm have been improved and transaction processing speed has also been drastically improved to a level that can replace a centralized system. In addition, the advent of smart contract technology and the DApp platform also provides a means for cryptocurrency to decentralize social services beyond just payment. In this paper, we first describe the technologies for implementing cryptocurrency. And the major cryptocurrencies are described with a focus on the technical characteristics. In addition, the development of cryptocurrency technology is expanding the scope of use, so we tried to introduce various cryptocurrencies.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.459-461
• /
• 2022

One of the big differences between Network-on-Chip (NoC) and the existing parallel processing system based on an off-chip network is that data packet routing is performed using a centralized control scheme. In such an environment, the best-effort packet routing problem becomes a real-time assignment problem in which data packet arriving time and processing time is the cost. In this paper, the Hungarian algorithm, a representative computational complexity reduction algorithm for the linear algebraic equation of the allocation problem, is implemented in the form of a hardware accelerator. As a result of logic synthesis using the TSMC 0.18um standard cell library, the area of the circuit designed through case analysis for the cost distribution is reduced by about 16% and the propagation delay of it is reduced by about 52%, compared to the circuit implementing the original operation sequence of the Hungarian algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1982-1985
• /
• 2003

Future cellular networks will mainly be driven by, high quality channels, high band with utilization, low power consumption and efficient network management. For a given channel allocation, the capacity and quality of communication of cellular radio systems using CDMA(Code Division Multiple Access) can be increased by using a transmitter power control scheme to combat the near-far problem. Centralized power control schemes or distributed ones to maximize the minimum signal-to-interference in each user of CDMA wireless network have been investigated. This paper has proposed a distributed power control algorithm, which employs an adaptive search scheme, in order to solve quickly the linear systems of equations for power update in CDMA cellular radio systems. The simulation results show that the proposed scheme has faster convergence rate than the typical bang-bang type of distributed power control algorithm, which has been much used as a reference algorithm in IS-95A and W-CDMA communication network.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.1
• /
• pp.72-78
• /
• 2009

This paper considers a multiagent scheduling problem under public information where a machine is shared by multiple agents. Each agent has a local objective among the minimization of total completion time and the minimization of maximum. In this problem, it is assumed that scheduling information is public. Therefore an agent can access to complete information of other agents and pursue efficient schedules in a centralized manner. We propose an enumeration scheme to find Pareto optimal schedules and a multiobjective genetic algorithm as a heuristic approach. Experimental results indicate that the proposed genetic algorithm yields close-to Pareto optimal solution under a variety of experimental conditions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1498-1505
• /
• 2009

In centralized control sensor network, tree-based multi-channel communication overcomes the recurrent channel switching and makes possible to transfer data simultaneously from different sources. In our paper, we propose a greedy algorithm named as NIT (Non-Intersecting Tree) that the trees can avoid inter-tree interference. We also propose channel switching technique by which trees can avoid link failure or area blocking due to external interference locally without rerunningthe algorithm and without interrupting the whole network. At first we applied our algorithm for a random topology and then we evaluate the performance of the network using NS-2 simulator. The results show that with the increasing of channel the throughputand delivery ratio are increased significantly. We got better performance than a using a recent proposed Tree-based Multi-Channel Protocol (TMCP).

• Proceedings of the KIPE Conference
• /
• 2019.07a
• /
• pp.416-417
• /
• 2019

In this paper, an effective power flow control strategy (PFCS) based on the centralized control approach and a DC-link (DCV) restoration algorithm for DC microgrid (DCMG) are presented. By investigating the statuses of system power units, eleven operating modes are given to ensure the system power balance under various conditions. To avoid the system power imbalance caused by the delay of grid fault detection, a reliable DCV restoration algorithm is proposed. In the proposed scheme, when an abnormal variation of the DCV is detected, the battery instantly starts a local emergency control mode to restore the DCV to the nominal value regardless of the control mode from the central controller. The simulations and experiments are carried out to prove the effectiveness of the PFCS and the proposed DCV restoration algorithm.