• Journal of Korean Society for Geospatial Information Science
• /
• v.19 no.4
• /
• pp.71-80
• /
• 2011

A simple and an improved methods for the assessment of flood damage were used in previous studies, and the Multi-Dimensional Flood Damage Assessment (MD-FDA) has been applied since 2004 in Korea. This study evaluated flood damage of dam downstream using considering MD-FDA method based on GIS data. Firstly, flood water level with FLDWAV (Flood Wave routing) model was input into cross section layer based on enforcement drainage algorithm, water depth grid data were created through spatial calculation with DEM data. The value of asset of building and agricultural land according to local government was evaluated using building layer from digital map and agricultural land map from landcover map. Also, itemized flood damage was calculated by unit price to building shape, evaluated value of housewares to urban type, unit cost to crop, tangible and inventory asset of company connected with building, agricultural land, flooding depth layer. Flood damage in rainfall frequency of 200 year showed 1.19, 1.30 and 1.96 times to flood damage in rainfall frequency of 100 year, 50 year and 10 year respectively by flood damage analysis.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.4
• /
• pp.121-127
• /
• 2011

Many peer-to-peer (p2p) systems have been studied in distributed, ubiquitous computing environments. Distributed hash table (DHT)-based p2p systems can improve load-balancing even though locality utilization and user mobility are not guaranteed. We propose a mobile locality-based hierarchical p2p overlay network (MLH-Net) to address locality problems without any other services. MLH-Net utilizes mobility features in a mobile environment. MLH-Net is constructed as two layers, an upper layer formed with super-nodes and a lower layer formed with normal-nodes. Because super-nodes can share advertisements, we can guarantee physical locality utilization between a requestor and a target during any discovery process. To overcome a node failure, we propose a simple recovery mechanism. The simulation results demonstrate that MLH-Net can decrease discovery routing hops by 15% compared with JXTA and 66% compared with Chord.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.625-634
• /
• 2003

More than a decade after its initial proposal, deployment of IP Multicast has been limited due to the problem of traffic control in multicast routing, multicast address allocation in global internet, reliable multicast transport techniques etc. Lately, according to increase of multicast application service such as internet broadcast, real time security information service etc., overlay multicast is developed as a new internet multicast technology. In this paper, we describe an overlay multicast protocol and propose fast join mechanism that considers switching of the tree. To find a potential parent, an existing search algorithm descends the tree from the root by one level at a time, and it causes long joining latency. Also, it is try to select the nearest node as a potential parent. However, it can't select the nearest node by the degree limit of the node. As a result, the generated tree has low efficiency. To reduce long joining latency and improve the efficiency of the tree, we propose searching two levels of the tree at a time. This method forwards joining request message to own children node. So, at ordinary times, there is no overhead to keep the tree. But the joining request came, the increasing number of searching messages will reduce a long joining latency. Also searching more nodes will be helpful to construct more efficient trees. In order to evaluate the performance of our fast join mechanism, we measure the metrics such as the search latency and the number of searched node and the number of switching by the number of members and degree limit. The simulation results show that the performance of our mechanism is superior to that of the existing mechanism.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.11
• /
• pp.1-11
• /
• 2009

A content based pub/sub (Publish/subscribe) services at the peer-to-peer network has the requirements about how to distribute contents information of subscriber and to delivery the events efficiently. For satisfying the requirements, a DHT(Distributed Hash Table) based pub/sub overlay networking and tree type topology based network construction using filter technique have been proposed. The DHT based technique is suitable for topic based pub/sub service but it's not good contents based service that has the variable requirements. And also filter based tree topology networking is not efficient at the environment where the user requirements are distributed. In this paper we propose the R-Tree algorithm based pub/sub overlay network construction method. The proposed scheme provides cost effective event delivery method by mapping user requirement to multi-dimension and hierarchical grouping of the requirements. It is verified by simulation at the variable environment of user requirements and events.

• The KIPS Transactions:PartC
• /
• v.14C no.2
• /
• pp.171-178
• /
• 2007

In mobile ad hoc networks, an application scenario requires mostly group mobility behavior in the mix of group moving nodes and individually moving nodes. The nodes of those applications tend to belong to the movement group with similar movement behavior. Group mobility is one of the good methods to improve scalability, and reduces the protocol overhead. In this paper, we propose the multicast architecture which regards nodes that have equal group mobility in the heterogeneous group mobility network as the single entity with the multiple interfaces and composes multicast tree, The logical cooperative entity-based multicast architecture accommodates the scalability, the multicast tree simplification, and the protocol overhead reduction which arc obtained from the hierarchical multicast architecture, while it maintains the nat multicast architecture for the data transmission. It also prevents the concentration of the energy consumption dispersing data forwarding load into the several ingress/egress nodes. Results obtained through simulations show that logical cooperative entity based multicast protocol with multiple interfaces offers the protocol scalability and the efficient data transmission.

• Journal of Korea Spatial Information System Society
• /
• v.10 no.1
• /
• pp.51-63
• /
• 2008

Previous studies for routing In USN (Ubiquitous Sensor Networks) appear to be unreliable due to the dependence on non-spatial data and the lack of map overlay analysis. Multiple spatial parameters and radio propagation modeling techniques were integrated to derive RSSI (Received Signal Strength Indicator) value between route nodes and produce a highly reliable path map. It was possible to identify area-wide patterns of USN route subject to many different Influences (e.g. the specific effects of radio blocking factors such as the visible area, road area, cell duplicated area, and building density), which cannot be acquired by traditional non-spatial modeling. The quantitative evidence concerning the USN route for individual cell as well as entire study area would be utilized as major tools to visualize paths in real-time and to select alternative path when failure or audition of route node occurs.

• KIISE Transactions on Computing Practices
• /
• v.21 no.1
• /
• pp.1-12
• /
• 2015

To realize futuristic services with agility, the role of the experimental facility (i.e., testbed) based on integrated resources has become important, so that developers can flexibly utilize the dynamic provisioning power of software-defined networking and cloud computing. Following this trend, an OpenFlow-based SDN testbed environment, denoted as OF@TEIN, connects multiple sites with unique SmartX Racks (i.e., virtualization-enabled converged resources). In this paper, in order to automate the multi-point L2 (i.e., Ethernet) inter-connection of OpenFlow islands, we introduce an automated tool to configure the required Network Virtualization using Generic Routing Encapsulation (NVGRE) tunneling. With the proposed automation tool, the operators can efficiently and quickly manage network inter-connections among multiple OpenFlow sites, while letting developers to control their own traffic flows for service realization experiments.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.12 no.1
• /
• pp.1-11
• /
• 2009

Rapid visualization of flood area of downstream according to the dam effluent in flood season is very important in dam management works. Overlay zone of river bight should be removed to represent flood area efficiently based on flood stage which was modeled in river channels. This study applied drainage enforcement algorithm to visualize flood area considering river bight by coupling Coordinate Operation System for Flood control In Multi-reservoir (COSFIM) and Flood Wave routing model (FLDWAV). The drainage enforcement algorithm is a kind of interpolation which gives to advantage into hydrological process studies by removing spurious sinks of terrain in automatic drainage algorithm. This study presented mapping technique of flood area layer considering river bight in Namgang-Dam downstream, and developed system based on Arcobject component to execute this process automatically. Automatic extraction system of flood area layer could save time-consuming efficiently in flood inundation visualization work which was propelled based on large volume data. Also, flood area layer by coupling with IKONOS satellite image presented real information in flood disaster works.