• Atmosphere
• /
• v.30 no.2
• /
• pp.155-167
• /
• 2020

In order to produce more detailed and accurate information of river discharge and freshwater discharge, global high-resolution hydrodynamic model (CaMa-Flood) is applied to an operational land surface model of global seasonal forecast system. In addition, bias correction to grid runoff for the hydrodynamic model is attempted. CaMa-Flood is a river routing model that distributes runoff forcing from a land surface model to oceans or inland seas along continentalscale rivers, which can represent flood stage and river discharge explicitly. The runoff data generated by the land surface model are bias-corrected by using composite runoff data from UNH-GRDC. The impact of bias-correction on the runoff, which is spatially resolved on 0.5° grid, has been evaluated for 1991~2010. It is shown that bias-correction increases runoff by 30% on average over all continents, which is closer to UNH-GRDC. Two experiments with coupled CaMa-Flood are carried out to produce river discharge: one using this bias correction and the other not using. It is found that the experiment adapting bias correction exhibits significant increase of both river discharge over major rivers around the world and continental freshwater discharge into oceans (40% globally), which is closer to GRDC. These preliminary results indicate that the application of CaMa-Flood as well as bias-corrected runoff to the operational global seasonal forecast system is feasible to attain information of surface water cycle from a coupled suite of atmospheric, land surface, and hydrodynamic model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.8
• /
• pp.1890-1910
• /
• 2013

Routing overlay offers an ideal methodology to improve the end-to-end communication performance by deriving a backup path for any node pair. This paper focuses on a challenging issue of selecting a proper backup path to bypass the failures on the default path with high probability for any node pair. For existing backup path selection approaches, our trace-driven evaluation results demonstrate that the backup and default paths for any node pair overlap with high probability and hence usually fail simultaneously. Consequently, such approaches fail to derive a robust backup path that can take over in the presence of failure on the default path. In this paper, we propose a three-phase RBPS approach to identify a proper and robust backup path. It utilizes the traceroute probing approach to obtain the fine-grained topology information, and systematically employs the grid quorum system and the Bloom filter to reduce the resulting communication overhead. Two criteria, delay and fault-tolerant ability on average, of the backup path are proposed to evaluate the performance of our RBPS approach. Extensive trace-driven evaluations show that the fault-tolerant ability of the backup path can be improved by about 60%, while the delay gain ratio concentrated at 14% after replacing existing approaches with ours. Consequently, our approach can derive a more robust and available backup path for any node pair than existing approaches. This is more important than finding a backup path with the lowest delay compared to the default path for any node pair.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.7
• /
• pp.1-8
• /
• 1999

In this paper, we have proposed and evaluated the performance of the routiong protocols servicing the mobile and fixed subscribers in a large e scale circuit switched telecommunication network, connected by gateways. The large scale network consists of several subnetworks, and a subnetwork is composed of $M{\times}N$ nodes in grid topology. When a call for mobile subscriber occurs, the current routing protocols search the whole large scale network to find a mobile subscriber. Therefore, it causes many redundant packets and long call setup delay. So, we have proposed a new routing protocol, in which the destination subscriber is first searched at the subnetwork where the call is proposed protocol is better than that of the current protocol.

• Journal of KIISE:Information Networking
• /
• v.36 no.4
• /
• pp.322-329
• /
• 2009

Many researches in wireless sensor networks have used a geographic routing to effectively disseminate data between sinks and sources. To know the location information, the geographic routing has proposed two manners. A sink-initiated and a source-initiated are flooding to disseminate its location information in WSN. However, these two manners have two problems. Firstly, whenever they move, they flood their location information. Secondly, their location information is disseminated unnecessary nodes besides nodes which send and receive data in actually. Therefore, this paper proposes a protocol that can solve the two problems and disseminate effectively data between few sinks and few sources. The proposed protocol exploits a location information manager that manages location information of the sinks and the sources. We also compare the performance of the proposed protocol with the existing protocols through a simulation.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.4
• /
• pp.71-81
• /
• 2010

In grid system, Task scheduling based on list scheduling models has showed low complexity and high efficiency in fully connected processor set environment. However, earlier schemes did not consider sufficiently the communication cost among tasks and the composition process of lightpath for communication in optical gird environment. In this thesis, we propose LSOG (Leveling Selection in Optical Grid) which sets task priority after forming a hierarchical directed acyclic graph (DAG) that is optimized in optical grid environment. To determine priorities of task assignment in the same level, proposed algorithm executes the task with biggest communication cost between itself and its predecessor. Then, it considers the shortest route for communication between tasks. This process improves communication cost in scheduling process through optimizing link resource usage in optical grid environment. We compared LSOG algorithm with conventional ELSA (Extended List Scheduling Algorithm) and SCP (Scheduled Critical Path) algorithm. We could see the enhancement in overall scheduling performance through increment in CCR value and smoothing network environment.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.6
• /
• pp.59-69
• /
• 2005

Ad hoc network is the network which can be considered without a pre-constructed infrastructure, and a mobile node can join the network freely. However, the participation of the mobile nodes to the ad hoc network brings up much burden of re-computation for new routes, because it leads to losing the connection frequently. And, also, it causes serious security problem to be broadcasted wrong information by the malicious user. Therefore, it needs authentication against the mobile nodes. To make that Possible, we have two methods: single CA and distributed CA. In the case of CA method, the wireless network can be collapsed owing to expose the CA, but still the distributed CA method is a little more safe than previous one because it needs attacks toward a lot of CAs to collapse the network We can consider Secret Share scheme as the method that constructs the distributed CA system, but it is weak when the network size is too large. In this paper, we suggest hierarchical structure for the authentication method to solve this problem, and we will show the results of simulation for this suggestion.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.8
• /
• pp.53-60
• /
• 2010

This paper proposes an efficient path maintaining scheme in the grid based wireless sensor networks. The proposed scheme provides the shortest path from a source node to a mobile sink node in a re-established dissemination path. The shortest path can save energy consumption to deliver data to the destination. The proposed scheme can also reduce the cost for path maintenance by reusing the existing path. The simulation results show that the proposed scheme reduces the path maintenance cost by 60% compared to the conventional schemes.

• Journal of KIISE
• /
• v.42 no.8
• /
• pp.1057-1064
• /
• 2015

The tactical network is system based on wireless networking technologies that ties together surveillance reconnaissance systems, precision strike systems and command and control systems. Several alternative paths exist in the network because it is connected as a grid to improve its survivability. In addition, the network topology changes frequently as forces and combatants change their network access points while conducting operations. However, most Internet routing standards have been designed for use in stable backbone networks. Therefore, tactical networks may exhibit a deterioration in performance when these standards are implemented. In this paper, we propose Priority based Multi-Path routing with Local Optimization(PMPLO) for a tactical backbone network. The PMPLO separately manages the global and local metrics. The global metric propagates to other routers through the use of a routing protocol, and it is used for a multi-path configuration that is guaranteed to be loop free. The local metric reflects the link utilization that is used to find an alternate path when congestion occurs, and it is managed internally only within each router. It also produces traffic that has a high priority privilege when choosing the optimal path. Finally, we conducted a simulation to verify that the PMPLO can effectively distribute the user traffic among available routers.

• Journal of KIISE:Information Networking
• /
• v.33 no.1
• /
• pp.76-90
• /
• 2006

Sensor network consists of a large number of sensor nodes that are densely deployed either inside the phenomenon or very close to it. The life time of each node in the sensor network significantly affects the life time of whole sensor network. A node which drained out its battery may incur the partition of whole network in some network topology The life time of each node depends on the battery capacity of each node. Therefore if all sensor nodes in the network live evenly long, the life time of the network will be longer. In this paper, we propose Cluster-Based Power-Efficient Routing (CBPER) Protocol which provides scalable and efficient data delivery to multiple mobile sinks. Previous r(luting protocols, such as Directed Diffusion and TTDD, need to flood many control packets to support multiple mobile sinks and many sources, causing nodes to consume their battery. In CBPER, we use the fact that sensor nodes are stationary and location-aware to construct and maintain the permanent grid structure, which makes nodes live longer by reducing the number of the flooding control packets. We have evaluated CBPER performance with TTDD. Our results show that CBPER is more power-efficient routing protocol than TTDD.

• Journal of Korea Water Resources Association
• /
• v.41 no.11
• /
• pp.1123-1133
• /
• 2008

It needs to conceptualize watershed with triangular or rectangular elements and to analyze the changes in hydrological components of each element for distributed modeling of rainfall-runoff process. This study is the network analysis of watershed grid for flow routing occurred in each element when analyzing rainfall-runoff process by one-dimensional kinematic wave equation. Single flow direction from D8-method(deterministic eight-neighbors method) is used, and the information of flow direction and flow accumulation are used to determine the computation order of each element. The application theory of finite volume method is suggested for each flow direction pattern between elements, and it is applied it to calculate the flow of each grid. Network analysis method from this study is applied to GRM(Grid based Rainfall-runoff Model) which is physically based distributed rainfall-runoff model, and the results from simplified hypothetical watersheds are compared with $Vflo^{TM}$ to examine the reasonability of the method. It is applied to Jungrangcheon watershed in Han river for verification, and examination of the applicability to real site. The results from Jungrangcheon watershed show good agreement with measured hydrographs, and the application of the network analysis method to real site is proper.