• Journal of Korea Multimedia Society
• /
• v.8 no.12
• /
• pp.1613-1622
• /
• 2005

Broadcasting is fundamental and effective data dissemination mechanism for route discovery, address resolution, and many other network services in mobile ad hoc networks. Although many approaches for broadcasting have been proposed to minimize the number of retransmissions, none of them guarantee the best-suited bounds of retransmissions. Appropriate use of probabilistic method can lower the chance of contention and collision among neighboring nodes, so that it reduces the number of rebroadcasts. In this paper, we propose a probabilistic approach that dynamically adjusts the rebroadcasting probability according to the distance between the sender and the receiver. While the rebroadcast probabilities of a mobile node close to sender will be set lower, the rebroadcast probabilities of a mobile node far away from sender wi1l be set to higher, The rebroadcast probability of a node wi1l be set according to the distance from sender. We evaluate the performance of proposed approach by comparing it with flooding as well as a fixed probabilistic broadcast approach. Simulation results showed that the performance of proposed scheme outperforms by about $70\%$ than flooding scheme and outperforms by about $20\%$ than fixed probabilistic scheme.

• The KIPS Transactions:PartC
• /
• v.18C no.2
• /
• pp.119-126
• /
• 2011

In wireless sensor networks Time synchronization used to be performed after routing tree is constructed. It results in increasing the number of packets and energy consumption. In this paper, we propose a time synchronization algorithm combined with flooding routing tree construction algorithm, which applies LTS (Lightweight Time Synchronization) information packed into the forwarding and backward routing packets. Furthermore, the proposed algorithm compensates the time error due to clock drift using the round time with fixed period. We prove that the proposed algorithm could synchronize the time of among sensor nodes more accurately compared to TSRA (Time Synchronization Routing Algorithm) using NS2 simulation tool.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.10
• /
• pp.1804-1810
• /
• 2011

It is necessary to adopt some logical techniques and methods of alarm processing for a large complex plant such as nuclear power plants in order to present the occurred alarm messages properly and concisely. Among such alarm processing techniques, the alarm suppressing function is a strong tool to avoid alarm flooding during the sudden transients of plant output power such as turbine trips, reactor trips and other incidents. Unless any suppression or representation technologies are used in an alarm message listing system, it cannot provide quick assistance to plant operators or supervisors during plant upsets because too many alarm messages are presented in an alarm list window. This paper presents the key suppression methods and analysis processes developed for implementing a suppressed alarm message listing function of an integrated alarm system called LogACTs which has been applied to a CANDU nuclear power plant. A simulation testing of the suppressing function conducted with the real plant alarm message list data has demonstrated an effective performance of the developed logics with the high suppression rate.

• Journal of Internet Computing and Services
• /
• v.10 no.1
• /
• pp.43-50
• /
• 2009

Flooding and SPIN, which are well-known WSN(Wireless Sensor Network) proactive protocols, spontaneously disseminate the sensed data without a request from an arbitrary sink node. However, these methods disseminate the data even to some nodes that do not need it, which is energy inefficient. In this paper, we introduce a semi-proactive protocol to disseminate only to pertinent nodes instead of all nodes in order to overcome this weakness. Thus some nodes, such as arbitrary sink nodes that need the sensed data, could easily obtain the data within some hops. The simulation result shows that the proposed protocol has higher average node energy efficiency than that of well-known earlier work, SPIN. If a proactive protocol, such as SPIN, is changed to semi-proactive and has only a 1-hop burden, then the energy efficiency enhancement is up to about 83% compared with SPIN.

• Journal of Korean Society for Geospatial Information Science
• /
• v.25 no.2
• /
• pp.49-56
• /
• 2017

In this study, flood analysis was conducted to prepare for damage caused by typhoons and heavy rain due to abnormal climate and climate change. Two - dimensional flooding analysis using the FLUMEN model, which is widely used for national and international flood risk mapping, was conducted for the Nam River Basin, which is the tributary of the Nakdong River. This study divides the topography into $5m{\times}5m$ DEM by ArcView, so that the accuracy of river repair and hydrological characterization and flood area identification can be maximized. As a result of simulation of water flooding, 163.3ha in section 1, 227.7ha in section 2 and 59.9ha in section 3 were simulated.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.10A
• /
• pp.956-963
• /
• 2008

In a multi-hop wireless ad hoc network broadcasting is an elementary operation to support route discovery, address resolution and other application tasks. Broadcasting by flooding may cause serious redundancy, contention, and collision in the network which is referred to as the broadcast storm problem. Many broadcasting schemes have been proposed to give better performance than simple flooding in wireless ad hoc network. How to decide whether re-broadcast or not also poses a dilemma between reachability and efficiency under different host densities. In this paper, we propose enhanced broadcasting schemes, which can reduce re-broadcast packets without loss of reachability. Simulation results show that proposed schemes can offer better reachability as well as efficiency as compared to other previous schemes.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.11
• /
• pp.106-115
• /
• 1998

The performance of morphological image segmentation heavily depends on a proper selection of markers. In this paper, we propose a marker incubator where only a catchment basin that has grown sufficiently large through flooding simulation is registered as a marker. Marker incubator does following things at each flooding level; growing defined marker regions, finding new marker regions, and postponing irrelevant regions to be examined at the next level. The examination for a region to be a valid marker is performed by two size-oriented criterions that are derived from the structuring element size of a morphological filter. The simulation result shows that the image segmentation with the proposed marker incubator achieves the comparable image quality to Wang's method in a less number of markers even without region merging. Additionally, since the proposed method also performs better in terms of image quality and information for transmission, it is well suited for region-based image coding.

• The KIPS Transactions:PartC
• /
• v.18C no.1
• /
• pp.15-22
• /
• 2011

Usually time synchronization is performed after routing tree is constructed. This thesis proposes a time synchronization algorithm combined with single-flooding routing tree construction algorithm in a single path. TSRA (Time Synchronization Routing Algorithm) uses routing packets to construct a routing tree. Two types of time information are added to the routing packet: one is the packet receiving time, and the other is the packet sending time. Time offset and transmission time-delay between parent node and child node could be retrieved from the added time information using LTS (Lightweight Time Synchronization) algorithm. Then parent node sends the time offset and transmission time to children nodes and children nodes can synchronize their time to the parent node time along the routing tree. The performance of proposed algorithm is compared to the TPSN (Timing-sync Protocol for Sensor Networks) which is known to have high accuracy using NS2 simulation tool. The simulation result shows that the accuracy of time synchronization is comparable to TPSN, the synchronization time of all sensor nodes is faster than TPSN, and the energy consumption is less than TPSN.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.11B
• /
• pp.1363-1372
• /
• 2011

Flooding based routing protocols are usually used to disseminate information in wireless sensor networks. Those approaches, however, require message retransmissions to all nodes and induce huge collision rate and high energy consumption. In this paper, HoGoP (Hop based Gossiping Protocol) in which all nodes consider the number of hops from sink node to them, and decide own gossiping probabilities, is introduced. A node can decide its gossiping probability according to the required average reception percentage and the number of parent nodes which is counted with the difference between its hop and neighbors' ones. Therefore the decision of gossiping probability for network topology is adaptive and this approach achieves higher message reception percentage with low message retransmission than the flooding scheme. Through simulation, we compare the proposed protocol with some previous ones and evaluate its performance in terms of average reception percentage, average forwarding percentage, and forwarding efficiency. In addition, average reception percentage is analyzed according to the application requirement.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.66 no.1
• /
• pp.49-66
• /
• 2024

Extreme rainfall will become intense due to climate change, increasing inundation risk to agricultural land. Hydrological and hydraulic simulations for the entire watershed were conducted to analyze the impact of climate change. Rainfall data was collected based on past weather observation and SSP (Shared Socio-economic Pathway)5-8.5 climate change scenarios. Simulation for flood volume, reservoir operation, river level, and inundation of agricultural land was conducted through K-HAS (KRC Hydraulics & Hydrology Analysis System) and HEC-RAS (Hydrologic Engineering Center - River Analysis System). Various scenarios were selected, encompassing different periods of rainfall data, including the observed period (1973-2022), near-term future (2021-2050), mid-term future (2051-2080), and long-term future (2081-2100), in addition to probabilistic precipitation events with return periods of 20 years and 100 years. The inundation area of the Aho-Buin district was visualized through GIS (Geographic Information System) based on the results of the flooding analysis. The probabilistic precipitation of climate change scenarios was calculated higher than that of past observations, which affected the increase in reservoir inflow, river level, inundation time, and inundation area. The inundation area and inundation time were higher in the 100-year frequency. Inundation risk was high in the order of long-term future, near-term future, mid-term future, and observed period. It was also shown that the Aho and Buin districts were vulnerable to inundation. These results are expected to be used as fundamental data for assessing the risk of flooding for agricultural land and downstream watersheds under climate change, guiding drainage improvement projects, and making flood risk maps.