• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37B no.9
• /
• pp.760-766
• /
• 2012

In this paper, we propose an efficient flooding process on link-state routing protocol. It is possible to exchange information using typical link-state routing protocol; for example, OSPF(Open Short Path First) or IS-IS(Intermediate system routing protocol) that floods LSA between nodes when the network topology change occurs. However, while the scale of network is getting bigger, it affects the network extensibility because of the unnecessary LSA that causes the increasing utilization of CPU, memory and bandwidth. An existing algorithm based on the Minimum spanning tree has both network instability and inefficient flooding problem. So, we propose algorithm for efficient flooding while maintaining network stability. The simulation results show that the flooding of proposed algorithm is more efficient than existing algorithm.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2014.06a
• /
• pp.36-37
• /
• 2014

It is necessary to develop highly sophisticated Modeling & Simulation (M&S) system for the scientific investigation of marine accident causes and for the systematic reproduction of accidental damage procedure. To ensure an accurate and reasonable prediction of marine accidental causes, such as collision, grounding and flooding, full-scale ship M&S simulations would be the best approach using hydrocode, such as LS-DYNA code, with its Fluid-Structure Interaction (FSI) analysis technique. The objectivity of this paper is to present three full-scale ship collision, grounding and flooding simulation results of marine accidents, and to show the possibility of the scientific investigation of marine accident causes using highly sophisticated M&S system.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.38 no.2
• /
• pp.261-268
• /
• 2018

The study used the simplified flooding analysis model, SIMOD, to distribute the total flood discharge by time, so research on flooding in urban areas can be conducted. The conventional flooding analysis models have limitations in constructing input data and take a long time for analysis. However, SIMOD is useful because it supports rapid decision-making process using quick modeling based on simple hydrological data, such as topography and inflow flood of the study area, to analyze submerged routes formed by flooding. Therefore, the study used the SIMOD model to analyze flooding in urban areas before conducting a comparative study with the outputs from FLO-2D, which is one of the conventional flooding analysis models, to identify the model's applicability. Seongseoje was selected as the study area, as it is located downstream the Geumho river where streams flow in the adjacent areas, and dikes are high enough to apply the "Overflow and Break" scenario for urban areas. With regard to topography, the study applied DEM data for the conventional flooding analysis and DSM data to represent urban building communities, distribution of roads, etc. Input flood discharge was calculated by applying the rectangular weir equation under the bank and break scenario through a 200-year return period of a design flood level. Comparative analysis was conducted in a flooded area with a simulation time of 1-24 hours. The time for the 24-hour simulation in SIMOD was less than 7 minutes. Compared with FLO-2D, the difference in flooded areas was less than 20%. Furthermore, the study identified the need for topography data using DSM for urban areas, as the analysis result that applies DSM showed the influence of roads and buildings.

• Journal of Information Technology Applications and Management
• /
• v.10 no.2
• /
• pp.61-71
• /
• 2003

Ad-hoc networks are characterized by multi-hop wireless links, frequently changing network topology and the need for efficient dynamic routing protocols. In an Ad-hoc network, each host assumes the role of a router and relays packets toward final destinations Because a packet is broadcast to all neighboring nodes, the optimality criteria of wireless network routing is different from that of wired network routing. tn this paper 1 point out the more important cost factor than the number of links in the Ad-hoc network. A class routing protocols called on-demand protocols has recently found attention because of their low routing overhead since it performs a blind flooding to look for a path. In this paper, 1 propose the method which reduces overhead by using the information of neighboring nodes and doing a selective flooding. Simulation results demonstrate better reduction of routing overheads with this scheme.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.14 no.3
• /
• pp.113-121
• /
• 2019

Algorithms for geographical routing and location update attract the researchers' interests in wireless ad hoc networks. Even though many various schemes have been proposed, most of them cause scalability problem in small groups of nodes. To defeat this problem, flooding algorithm is widely utilized due to low complexity. However, there is no previous research work to evaluate flooding algorithm through implementation instead of simulation. In this paper, we present implementation of flooding algorithm on Raspberry Pi and performance evaluation results.

• Journal of KIISE:Information Networking
• /
• v.32 no.6
• /
• pp.696-704
• /
• 2005

Flooding is usually utilized to find a multi hop route toward the destination which is not within transmission range in Ad Hoc networks. However, existing flooding schemes deteriorate the network performance because of periodic message exchanges, frequent occurrence of collisions, and redundant packet transmission. To resolve this, a flooding scheme using on demand cluster formation is proposed in this paper. The scheme employs ongoing Packets for constructing a cluster architecture as the existing on demand clustering scheme. Unlike to the existing on demand clustering scheme, the scheme makes use of unicast packet transmission to reduce the number of collisions and to find the flooding candidates easily. As a result, the proposed scheme yields fewer flooding nodes than other schemes. Simulation results proved that the proposed scheme reduces the number of transmissions and collisions than those of two other schemes.

• Journal of Convergence for Information Technology
• /
• v.10 no.10
• /
• pp.115-122
• /
• 2020

Due to the climate change, torrential rain downpours unprecedentedly, and urban areas repeatedly suffer from the inundation damages, which cause miserable loss of property and life by flooding. Two major reasons of urban flooding are river inundation and inland submergence. However, most of previous studies ignored the comprehensive mechanism of those two factors, and showed discrepancy and inadequacy due to the linear summation of each analysis result. In this study, river inundation and inland flooding were analyzed at the same time. Petrov-stabilizing scheme was adopted to capture the shock wave accurately by which river inundation can be modularized. In addition, flux-blocking alrotithm was introduced to handle the wet and dry phenomena. Sink/source terms with EGR (Exponentially Growth Rate) concept were incorporated to the shallow water equations to consider inland flooding. Comprehensive simulation implementing inland flooding and river inundation at the same time produced satisfactory results because it can reflect the counterbalancing and superposition effects, which provided accurate prediction in flooding analysis.

• The Journal of the Korea Contents Association
• /
• v.5 no.2
• /
• pp.115-121
• /
• 2005

In the present internet environment, various traffic flooding attacks and worm attacks cause economical loss. If IPv4 is substituted by IPv6 because of the lack of IP address, it will be more serious. Therefore, we design and implement the traffic analysis tool which can detect attacks by expecting them encountered in the IPv6 environment. Proposed tool is composed of packet generation module, packet gathering module, discrimination module, and display module in X-windows. As a simulation result, it is proved that it can effectively detect DAD-NA message attack, TCP SYN flooding attack, UDP flooding attack and ICMP flooding attack in the IPv6 environment.

• Journal of Communications and Networks
• /
• v.12 no.1
• /
• pp.67-73
• /
• 2010

Current on-demand ad-hoc routing protocols are not appropriate for wireless mesh networks (WMNs), because flooding-based route discovery is both redundant and expensive in terms of control message overhead. In this paper, we propose an efficient on-demand routing approach with directional flooding (DF), which is suitable for the WMNs with limited mobility. In the route discovery process to reach a gateway, our DF scheme can reduce the number of route request (RREQ) packets broadcast by using a restricted directional flooding technique. Simulation results show that ad hoc on-demand distance vector (AODV) with DF (AODV-DF) can significantly reduce routing overhead by RREQ packets and enhance overall performance compared with the original AODV.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.4
• /
• pp.32-39
• /
• 2006

MANET is a dynamically reconfigurable wireless network with no fixed infrastructure (base station, or AP). In order to provide the data service in MANET, we need an efficient routing protocol to deliver the data to the wanted destination at a mobile node. A method of routing protocols called reactive routing protocol has recently got attention because of their low routing overhead. But a method of flooding broadcasts the packet to all of its neighbors. For this reason, each of the node has high routing overhead to route and keep path discovery. Accordingly in this paper, I propose an adaptive flooding scheme using N-hop look-ahead in MANET, md an optimal N value of doing flooding the packet to limited area. Because of being basically ignorant about topological changes, each of the node did not spontaneously cope with path alteration. But an efficient flooding scheme applying N-hop look-ahead is more resilient to topology changes than traditional algorithms. And also with this efficient flooding scheme, the simulation results demonstrate excellent reduction of routing overhead.