• Korean Journal of Remote Sensing
• /
• v.29 no.2
• /
• pp.263-274
• /
• 2013

In this study we evaluated the hydrological applicability of multi-satellite precipitation estimates. Three high-resolution global multi-satellite precipitation products, the Tropical Rainfall Measuring Mission (TRMM) Multi-satellite Precipitation Analysis (TMPA), the Global Satellite Mapping of Precipitation (GSMaP), and the Climate Precipitation Center (CPC) Morphing technique (CMORPH), were applied to the Coupled Routing and Excess Storage (CREST) model for the evaluation of their hydrological utility. The CREST model was calibrated from 2002 to 2005 and validated from 2006 to 2009 in the Chungju Dam watershed, including two years of warm-up periods (2002-2003 and 2006-2007). Areal-averaged precipitation time series of the multi-satellite data were compared with those of the ground records. The results indicate that the multi-satellite precipitation can reflect the seasonal variation of precipitation in the Chungju Dam watershed. However, TMPA overestimates the amount of annual and monthly precipitation while GSMaP and CMORPH underestimate the precipitation during the period from 2002 to 2009. These biases of multi-satellite precipitation products induce poor performances in hydrological simulation, although TMPA is better than both of GSMaP and CMORPH. Our results indicate that advanced rainfall algorithms may be required to improve its hydrological applicability in South Korea.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.1
• /
• pp.61-69
• /
• 2012

Smart Grid is the next-generation intelligent power grid that maximizes energy efficiency with the convergence of IT technologies and the existing power grid. Smart Grid is created solution for standardization and interoperability. Smart Grid industry enables consumers to check power rates in real time for active power consumption. It also enables suppliers to measure their expected power generation load, which stabilizes the operation of the power system. Smart industy was ecolved actively cause Wireless communication is being considered for AMI system and wireless communication using ZigBee sensor has been applied in various industly. In this paper, we proposed efficient addressing scheme for improving the performance of the routing algorithm using ZigBee in Smart Grid environment. A distributed address allocation scheme used an existing algorithm has wasted address space. Therefore proposing x, y coordinate axes from divide address space of 16 bit to solve this problem. Each node was reduced not only bitwise but also multi hop using the coordinate axes while routing than Cskip algorithm. I compared the performance between the standard and the proposed mechanism through the numerical analysis. Simulation verify performance about decrease averaging multi hop count that compare proposing algorithm and another. The numerical analysis results show that proposed algorithm reduce multi hop than ZigBee distributed address assignment and another.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.550-554
• /
• 2002

In this paper, we design the CORBA-based Mobile-Agent Model (CMAM) which has the capability of the efficient work processing in distributed environment through sensing network traffic and searching the optimal path for migration nodes of mobile agent. In case existing mobile agent model is given various works from user, the network overhead and traffic are increased by increasing of execution module size. Also, if it happens a large quantity of traffics due to migration of nodes according to appointment of the passive host(node) muting schedule by user, it needs much cost for node search time by traffic. Therefore, in this paper, we design a new mobile agent model that assures the reliability of agent's migration through dynamic act on the specific situation according to appointment of the active routing schedule and can minimize agent's work processing time through optimal path search. The proposed model assigns routing schedule of the migration nodes actively using an extended MAFFinder. Also, for decreasing overhead of network by agent's size, it separated by mobile agent including oかy agent calling module and push agent with work executing module based on distributed object type of CORBA. Also, it can reduce the required time for round works of mobile agent through the optimal path search of migration nodes.

• Journal of Korea Water Resources Association
• /
• v.52 no.2
• /
• pp.107-113
• /
• 2019

The flood forecasting model currently used in Korea calculates the runoff of basin using the lumped rainfall-runoff model and estimates the river level using the river and reservoir routing models. The lumped model assumes homogeneous drainage zones in the basin. Therefore, it can not consider various spatial characteristics in the basin. In addition, the rainfall data used in lumped model also has the same limitation because of using the point scale rainfall data. To overcome the limitations as mentioned above, many researchers have studied to apply the distributed rainfall-runoff model to flood forecasting system. In this study, to apply the Grid-based Rainfall-Runoff Model (GRM) to the Korean flood forecasting system, the optimal resolution is determined by analyzing the difference of the results of the runoff according to the various resolutions. If the grid size is to small, the computation time becomes excessive and it is not suitable for applying to the flood forecasting model. Even if the grid size is too large, it does not fit the purpose of analyzing the spatial distribution by applying the distributed model. As a result of this study, the optimal resolution which satisfies the accuracy of the bsin runoff prediction and the calculation speed suitable for the flood forecasting was proposed. The accuracy of the runoff prediction was analyzed by comparing the Nash-Sutcliffe model efficiency coefficient (NSE). The optimal resolution estimated from this study will be used as basic data for applying the distributed rainfall-runoff model to the flood forecasting system.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.17 no.1
• /
• pp.129-143
• /
• 2014

The purpose of this study is to evaluate the availability of dual-polarization radar rain for flood routing in Chungju Dam watershed($6,625.8km^2$) using KIMSTORM (Grid-based KIneMatic wave STOrm Runoff Model). The Sobaek dual-polarization radar data for 1 heavy rain and 3 typhoon(Khanun, Bolaven, and Sanba) events in 2012 were obtained from Han River Flood Control Office. The spatio-temporal patterns between the two data were similar showing the ratio of radar rain to ground rain with 0.97. The KIMSTORM was set to $500{\times}500m$ resolution and a total of 45,738 cells(198 rows${\times}$231 columns) for the watershed. For radar rain and 41 ground rains, the model was independently calibrated using discharge data at 3 streamflow gauging stations(YW1, YC, and CJD) with coefficient of determination($R^2$), Nash and Sutcliffe Model Efficiency(ME), and Volume Conservation Index(VCI). The $R^2$, ME, and VCI 0.80, 0.62 and 1.08 for radar rain and 0.83, 0.68 and 1.10 for ground rain respectively.

• The KIPS Transactions:PartC
• /
• v.11C no.2
• /
• pp.263-268
• /
• 2004

The end-to-end characteristic Is an important factor for QoS support. Since network users and required bandwidths for applications increase, the efficient usage of networks has been intensively investigated for the better utilization of network resources. The distributed adaptive routing is the typical routing algorithm that is used in the current Internet. The DCLC(Delay Constrained 1.east Cost) path problem has been shown to be NP-hard problem. The path cost of LD path is relatively more expensive than that of LC path, and the path delay of LC path is relatively higher than that of LD path in DCLC problem. In this paper, we investigate the performance of heuristic algorithm for the DCLC problem with new factor which is probabilistic combination of cost and delay. Recently Dr. Salama proposed a polynomial time algorithm called DCUR. The algorithm always computes a path, where the cost of the path is always within 10% from the optimal CBF. Our evaluation showed that heuristic we propose is more than 38% better than DCUR with cost when number of nodes is more than 200. The new factor takes in account both cost and delay at the same time.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.3
• /
• pp.29-45
• /
• 2017

Ad hoc sensor network is characterized by decentralized structure and ad hoc deployment. Sensor networks have all basic features of ad hoc network except different degrees such as lower mobility and more stringent energy requirements. Existing protocols provide different tradeoffs among some desirable characteristics such as fault tolerance, distributed computation, robustness, scalability and reliability. wireless protocols suggested so far are very limited, generally focusing on communication to a single base station or on aggregating sensor data. The main reason having such restrictions is due to maximum lifetime to maintain network activities. The network lifetime is an important design metric in ad hoc networks. Since every node does a router role, it is not possible for other nodes to communicate with each other if some nodes do not work due to energy lack. In this paper, we suggest an experimental ad-hoc on-demand distance vector routing protocol to optimize the communication of energy of the network nodes.The load distribution avoids the choice of exhausted nodes at the route selection phase, thus balances the use of energy among nodes and maximizing the network lifetime. In transmission control phase, there is a balance between the choice of a high transmission power that lead to increase in the range of signal transmission thus reducing the number of hops and lower power levels that reduces the interference on the expense of network connectivity.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.3
• /
• pp.117-124
• /
• 2006

In this paper, we propose the optimal migration path searching method including path adjustment and reassignment techniques for an efficient migration of mobile agent which has an autonomous ability for some task processing. In traditional agent system, if the various and large quantify of task processing were required from the users, it could be derive excessive network traffic and overload due to increasing the size of agent. And also, if an agent migrates from node to node according to routing schedules specified by the user at which the most of network traffic occurs, it could not actively cope with particular situations such as communication loss and node obstacles and required much cost for node traversal Therefore. this paper presents the migration method of agent which can try to adjust and reassign path to the destination automatically through the optimal path search using by network traffic perception in stead of the passive routing schedule by the user. An optimal migration path searching and adjustment methods ensure the migration reliability on distributed nodes and reduce the traversal task processing time of mobile agent by avoiding network traffic paths and node obstacles.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.1
• /
• pp.53-59
• /
• 2009

As a special type of Wireless Ad Hoc Networks, Wireless Mesh Networks (WMNs) have become the comer stone of research issues. Due to the limited operational environment of WMNs, an efficient connected dominating set (CDS) construction scheme is an important concern since it has been found extremely useful in broadcasting, routing and virtual backbone construction. In this paper, we propose a distributed Bandwidth-Interference aware CDS construction scheme to improve the network performance via two parameters such as node's number of neighbor and link bandwidth. Our CDS construction scheme selects the node that has more neighbors and enough bandwidth to support more end-devices in order to enhance overall network throughput and reliability. We confirm through simulations and show that our scheme constructs the CDS with the small subset of DS and the link that has better bandwidth.

• Convergence Security Journal
• /
• v.14 no.7
• /
• pp.53-58
• /
• 2014

MANET can quickly build a network because it is configured with only the mobile node and it is very popular today due to its various application range. However, MANET should solve vulnerable security problem that dynamic topology, limited resources of each nodes, and wireless communication by the frequent movement of nodes have. In this paper, we propose a domain-based distributed cooperative intrusion detection techniques that can perform accurate intrusion detection by reducing overhead. In the proposed intrusion detection techniques, the local detection and global detection is performed after network is divided into certain size. The local detection performs on all the nodes to detect abnormal behavior of the nodes and the global detection performs signature-based attack detection on gateway node. Signature DB managed by the gateway node accomplishes periodic update by configuring neighboring gateway node and honeynet and maintains the reliability of nodes in the domain by the trust management module. The excellent performance is confirmed through comparative experiments of a multi-layer cluster technique and proposed technique in order to confirm intrusion detection performance of the proposed technique.