• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.461-465
• /
• 2007

MANET(Mobile Ad hoc Networks) is free-mobility formation of mobile nodes in the wireless networks. Generally, wireless networks has two main type of structures which Tree and Mesh. These general structure is difficult to do which connectivity, redundancy transmit and network continuant. In this paper, we would suggest a new ODDMRP(Ontology Doppler effect-based Dynamic Multicast Routing Protocol) technology for effective MANET which Ontology Doppler effect-based. ODDMRP consist of the parameters for node entropy when using Doppler effect which moving position of round node, moving time, and distribution chart in velocity also it express distance of destination node and property structure organization. It would be used to provide improvement to keep the optimal communication routing and also could be improve network stabilization, and continuation durability of connectivity.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.883-892
• /
• 2002

Mobile IP has been designed only to maintain communications as they move from place to place, so it doesn't guarantee Quality of Service (QoS). QoS in mobile IP is important to provide multimedia and real-time applications services in mobile environment, and it is closely related to handoff delay. Therefore, handoff delay problem is actively studied to guarantee QoS as a main issue in mobile IP research area. In this paper, we suggest SNMP Information-based routing that adds keyword management method to Information-based routing in active network in order to resolve such a problem, and then suggest QoS controlled handoff based on SNMP Information-based routing. After modeling of suggested method and existing handoff method, simulations are carried out with NS -2 for performance evaluation. The results of simulations show the some improvement on handoff delay, and therefore on QoS improvement.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.62 no.2
• /
• pp.72-78
• /
• 2013

In this study, samples from the site where there occurred unbalanced current when cable routing were analyzed, and the simulation program for electric power system analysis, PSCAD/EMTDC, was used to calculate the current unbalance on cable routing. Based on electromagnetic finite element analysis(FEA), electromagnetic parameters enabled the interlocking with COMSOL for the calculation of allowable current ampacity and magnetic filed distribution. This then led to modeling unbalanced current between common modes using the unbalanced current analysis program, thereby comparing and discussing the results from both. The analyzed model is a common mode 2 parallel circuit, which is a basic model for cable routing, and by arranging cables in various ways, the arrangement with the least current unbalance was suggested, which would, in the future, prevent earth faults and extend life for the whole cable.

• The Journal of the Korea Contents Association
• /
• v.11 no.1
• /
• pp.404-410
• /
• 2011

For the simulation of one-dimensional unsteady flow, the Taylor-Galerkin finite element method was adopted to the discretization of the Saint Venant equation. The model was applied to the backwater problem in a single channel and the flood routing in dendritic channel networks. The numerical solutions were compared with previously published results of finite difference and finite element methods and good agreement was observed. The model solves the continuity and the momentum equations in a sequential manner and this leads to easy implementation. Since the final system of matrix is tri-diagonal with a few additional entry due to channel junctions, the tri-diagonal matrix solution algorithm can be used with minor modification. So it is fast and economical in terms of memory for storing matrices.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.355-357
• /
• 2005

This paper describes the architecture and modeling of adaptive and reconfigurable OS in wireless distributed sensor networks. Before initial sensor nodes are deployed in a sensor field, minimum functions including basic OS and routing algorithms are required for these nodes to send request messages for dynamic reconfigurations and receive response messages from a task manager. When the downloading is finished, each sensor node can reconfigure the initial state and be ready to start its functions. By applying this reconfigurable modeling, sensor nodes can be easily deployed in the sensor field and dynamically programmed during a bootstrap process.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.563-566
• /
• 2006

In this paper, we studied about AGVs modeling and material handling automation simulation using a virtual AGV. The proposed virtual AGV model that operates independently each other is based on a real AGV. Continuous straight-line and workstation model using vector drawing method that could easily, rapidly work system modeling are suggested. Centralized traffic control, which could collision avoidance in intersection and should not stop AGV as possible, and algorithm for detour routing which performs when another AGV is working in pre-routed path are proposed. The traffic control and the algorithm have been proved efficiently by simulation.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.59-59
• /
• 2000

In this paper, we present a framework for modeling and control of multiple mobile robots which cowork within a bounded workspace and limited resources. To achieve this goal, we adopt a formalism of discrete event system and supervisory control theory based on Petri nets. We can divide our whole story into two parts: first, we search the shortest path using the distance vector algorithm, and then we construct the control scheme from which a number of mobile robots can work within a bounded workspace without any collision. The use of Petri net modeling allows us In synthesize a controller which achieves a control specification for the desired closed-loop behavior efficiently. Finally, the usefulness of the proposed Petri net formalism is illustrated by a simulation study.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.4
• /
• pp.452-474
• /
• 2010

Formidable growth of Internet technologies has revealed challenging issues about its scale and performance evaluation. Modeling and simulation play a central role in the evaluation of the behavior and performance of the large-scale network systems. Large numbers of nodes affect simulation performance, simulation execution time and scalability in a weighty manner. Most of the existing simulators have numerous problems such as size, lack of system theoretic approach and complexity of modeled network. In this work, a scalable discrete-event modeling approach is described for studying networks' scalability and performance traits. Key fundamental attributes of Internet and its protocols are incorporated into a set of simulation models developed using the Discrete Event System Specification (DEVS) approach. Large-scale network models are simulated and evaluated to show the benefits of the developed network models and approaches.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.36 no.2
• /
• pp.79-87
• /
• 1994

A real-time flood forecasting system(FLOFS) was developed for the real-time and predictive determination of flood discharges and stages, and to aid in flood management decisions in the Keum River Estuary Dam. The system consists of three subsystems : data subsystem, model subsystem, and user subsystem. The data subsystem controls and manages data transmitted from telemetering systems and simulated by models. The model subsystem combines various techniques for rainfall-runoff modeling, tidal-level forecasting modeling, one-dimensional unsteady flood routing, Kalman filtering, and autoregressivemovingaverage(ARMA) modeling. The user subsystem in a menu-driven and man-machine interface system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.6
• /
• pp.1490-1495
• /
• 1998

Call packing has been recognized as a routing scheme that significantly reduces the blocking probability of connection requests in a circuit-switched Clos multistage interconnection network. In this paper, for the first time, a general analytical model for the point-to-point blocking probability of the call-packing scheme applied to Clos networks is developed. By introducing a new parameter called the degree of call packing, the model can correctly estimate the blocking probability of both call-packing and random routing schemes. The model is verified by computer simulation for various size networks and traffic conditions.