• Journal of electromagnetic engineering and science
• /
• v.12 no.2
• /
• pp.135-141
• /
• 2012

In this paper, we propose a novel cooperative routing protocol (NCRP) for wireless networks. The proposed protocol uses cooperative transmission to improve end-to-end outage probability. The broadcast nature ensures that the destination can receive a packet from the source or from the relays and if it cannot correctly decode the packet, the successful relays will start a retransmission. The NCRP protocol can skip some transmissions from the intermediate relays, thereby reducing the total power consumption. Theoretical results are derived and verified by simulation results.

• Journal of Korea Multimedia Society
• /
• v.14 no.5
• /
• pp.658-668
• /
• 2011

Over the past decade, the improvement of communications technologies and the rapid spread of www (World Wide Web) have brought on the exponential growth of users using Internet and real time multimedia multicast services like video conferencing, tele-immersive virtual reality, and Internet games. The dense-wavelength division multiplexing (DWDM) networks have been widely accepted as a promising approach to meet the ever-increasing bandwidth demands of Internet users, especially in next generation Internet backbone networks for nation-wide or global coverage. A major challenge in the next generation Internet backbone networks based on DWDM technologies is the resolution of the multicasting RWA (Routing and Wavelength Assignment) problem; given a set of wavelengths in the DWDM network, we set up light-paths by routing and assigning a wavelength for each connection so that the multicast connections are set-upped as many as possible. Finding such optimal multicast connections has been proven to be Non-deterministic Polynomial-time-complete. In this paper, we suggest a new heuristic multicast routing and wavelength assignment method for multicast sessions called DVS-PMIPMR (Differentiated Virtual Source-based Priority Minimum Interference Path Multicast Routing algorithm). We measured the performance of the proposed algorithm in terms of number of wavelength and wavelength channel. The simulation results demonstrate that DVS-PMIPMR algorithm is superior to previous multicast routing algorithms.

• Water Engineering Research
• /
• v.2 no.2
• /
• pp.113-121
• /
• 2001

The objective of this study is to develop a prediction mode for a flood forecasting system in the downstream of the Nakdong river basin. Ranging from the gauging station at Jindong to the Nakdong estuary barrage, the hydraulic flood routing model(DWOPER) based on the Saint Venant equation was calibrated by comparing the calculated river stage with the observed river stages using four different flood events recorded. The upstream boundary condition was specified by the measured river stage data at Jindong station and the downstream boundary condition was given according to the tide level data observed at he Nakdong estuary barrage. The lateral inflow from tributaries were estimated by the rainfall-runoff model. In the calibration process, the optimum roughness coefficients for proper functions of channel reach and discharge were determined by minimizing the sum of the differences between the observed and the computed stage. In addition, the forecasting lead time on the basis of each gauging station was determined by a numerical simulation technique. Also, we suggested a model structure for a real-time flood forecasting system and tested it on the basis of past flood events. The testing results of the developed system showed close agreement between the forecasted and observed stages. Therefore, it is expected that the flood forecasting system we developed can improve the accuracy of flood forecasting on the Nakdong river.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2144-2165
• /
• 2016

In a vehicular ad hoc network, the communication links are unsteady due to the rapidly changing topology, high mobility and traffic density in the urban environment. Most of the existing geographical routing protocols rely on the continuous transmission of beacon messages to update the neighbors' presence, leading to network congestion. Source-based approaches have been proven to be inefficient in the inherently unstable network. To this end, we propose an opportunistic beaconless packet forwarding approach based on a modified handshake mechanism for the urban vehicular environment. The protocol acts differently between intersections and at the intersection to find the next forwarder node toward the destination. The modified handshake mechanism contains link quality, forward progress and directional greedy metrics to determine the best relay node in the network. After designing the protocol, we compared its performance with existing routing protocols. The simulation results show the superior performance of the proposed protocol in terms of packet delay and data delivery ratio in realistic wireless channel conditions.

• Journal of Korea Water Resources Association
• /
• v.31 no.3
• /
• pp.235-242
• /
• 1998

The objective of this study is to develope a predictive model for flood forecasting in the tidal reaches of the Nakdong river and to analyze the tidal effects of major flood forecasting station of the Nakdong river by using the hydraulic flood routing. In the calibration process the optimum roughness coefficients as functions of channel reach and discharge were determined and the calibration results suggest that the unsteady hydraulic flood routing model simulated with the optimum roughness coefficients showed close agreement between the calculated and observed stage.

• Journal of Communications and Networks
• /
• v.6 no.4
• /
• pp.317-330
• /
• 2004

In this paper, we explore the utility of recently discovered multiple-antenna techniques (namely MIMO techniques) for medium access control (MAC) design and routing in mobile ad hoc networks. Specifically, we focus on ad hoc networks where the spatial diversity technique is used to combat fading and achieve robustness in the presence of user mobility. We first examine the impact of spatial diversity on the MAC design, and devise a MIMO MAC protocol accordingly. We then develop analytical methods to characterize the corresponding saturation throughput for MIMO multi-hop networks. Building on the throughout analysis, we study the impact of MIMO MAC on routing. We characterize the optimal hop distance that minimizes the end-to-end delay in a large network. For completeness, we also study MAC design using directional antennas for the case where the channel has a strong line of sight (LOS) component. Our results show that the spatial diversity technique and the directional antenna technique can enhance the performance of mobile ad hoc networks significantly.

• Korean Journal of Hydrosciences
• /
• v.4
• /
• pp.11-19
• /
• 1993

The peak flood discharge at a downstream station and the flood travel time between a pair of dams due to a specific flood release from the upper reservoir are computed using a hydraulic river channel routing method. The study covered the whole large reservoir system in the Han River, Korea. The computed flood discharges and the travel times between dams were correlated with the duration and the magnitude of flood release rate at the upstream reservoir, and hence a multiple regression model is proposed for each river reach between a pair of dams. The peak flood discharge at a downstream location can be converted to the peak flood stage by a rating curve. Hence, the proposed regression model could be used to forecast the peak flood stage at a downstream location and the flood travel time between dams using the information on the flood travel time, release rate and duration from the upper dam.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.12
• /
• pp.135-146
• /
• 1993

A ner general multi-layer area router, called DINOSAUR, is presented in this paper. DINOSAUR can route various types of routing areas, such as L-shaped channel, switchbox with/without obstacles, and rectilinear area with/without internal modules/terminals. The DINOSAUR algorithm consists of three major stages: layerless maze routing, layering by coloring, and rip-up and reroute. In layerless maze roution stage, the route of each net is determined by modified maze algorithm without taking the conflicts(short. circuits) into account. In layering by coloring stage, the layer of each net is determinde by a heuristic coloring algorithm. When the conflicts are not removed, rip-up and reroute process is invoded. In rip-up and reroute stage, the conflicts are removed iteratively. Many test cases have been run, and on all the benchmark data known in the literature DINOSAUR has performed either better than or comparable to the other routers.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.785-788
• /
• 2012

There has been growing interest in multicast technologies for wireless mesh networks with increasing demand for enjoying seamless multimedia broadcast service such as mobile IPTV anytime anywhere for any content on any device. This paper addressed the factors that should be considered when designing multicast algorithm in WMNs. Several routing metrics which are adapted for WMNs based multicast are described in detail to show that the main design goal for multicast metric is to achieve high throughput. Those metrics that take into account the characteristics of WMNs such as wireless broadcast advantage or channel diversity can arrange load balancing more effectively.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.4
• /
• pp.93-102
• /
• 1995

This paper introduces a general purpose Associative Processor(AP) which is very efficient for search-oriented applications. The proposed architecture consists of three main functional blocks: Content-Addressable Memory(CAM) arry, row logic, and control section. The proposed AP is a Single-Instruction, Multiple-Data(SIMD) device based on a CAM core and an array of high speed processors. As an application for the proposed hardware, we present a parallel algorithm to solve a global routing problem in the layout process utilizing the processing capabilities of a rudimentary logic and the selective matching and writing capability of CAMs, along with basic algorithms such a minimum(maximum) search, less(greater) than search and parallel arithmetic. We have focused on the simultaneous minimization of the desity of the channels and the wire length by sedking a less crowded channel with shorter wire distance. We present an efficient mapping technique of the problem into the CAM structure. Experimental results on difficult examples, on randomly generated data, and on benchmark problems from MCNC are included.