• Magazine of the Korean Society of Agricultural Engineers
• /
• v.36 no.3
• /
• pp.60-66
• /
• 1994

This paper is to validate the proposed models for the real-time forecasting for the Keum river estuary dam such as tidal-level forecasting model, one-dimensional unsteady flood routing model, and Kalman filter models. The tidal-level forecasting model was based on semi-range and phase lag of four tidal constituents. The dynamic wave routing model was based on an implicit finite difference solution of the complete one-dimensional St. Venant equations of unsteady flow. The Kalman filter model was composed of a processing equation and adaptive filtering algorithm. The processng equations are second ordpr autoregressive model and autoregressive moving average model. Simulated results of the models were compared with field data and were reviewed.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.36 no.3
• /
• pp.67-73
• /
• 1994

This paper is to validate the proposed models for the real-time forecasting for the Keum river estuary dam such as tidal-level forecasting model, one-dimensional unsteady flood routing model, and Kalman filter models. The tidal-level forecasting model was based on semi-range and phase lag of four tidal constituents. The dynamic wave routing model was based on an implicit finite difference solution of the complete one-dimensional St. Venant equations of unsteady flow. The Kalman filter model was composed of a processing equation and adaptive filtering algorithm. The processng equations are second ordpr autoregressive model and autoregressive moving average model. Simulated results of the models were compared with field data and were reviewed.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1986.04a
• /
• pp.119-124
• /
• 1986

This paper describes the development of the KORNET that may be regarded as the latest public packet-swiched computer communication network. The KORNET project included the development of the network management center (NMC), a network concentrator. For the KORNET we use the virtual circuit(VC) method, a distributed adaptive routing algorithm, and a dynamic buffer management algorithm. The NMC acts as a nerve center of the network, performing such function as network monitoring, subscriber and network management and routing management, etc. As for the NNP and NC hardware, we have implemented them with the 16-bit multitask/multiprocessor technology using MC68000 microprocessors. Softwares have been developed using C language is required for real time processing. All the network protocols we have developed comply completely with the latest CCITT recommendations including X.25, X,3 , X.28 and X.29.

• 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 IEEK Conference
• /
• 2000.06c
• /
• pp.169-172
• /
• 2000

IP Switching is a new routing technology proposed to improve the performance of IP routers. Flow classification is one of the key issues in IP Switching. To achieve better performance, flow classification should be matched to the varying IP traffic and an IP switch should make use of its hardware switching resources as fully as possible. This paper proposes an adaptive flow classification algorithm for IP Switching. By dynamically adjusting the values of its control parameters in response to the present usage of the hardware switching resources, this adaptive algorithm can efficiently match the varying IP traffic and thus improve the performance of an IP switch.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.408-418
• /
• 2007

In this paper, we address the question of dynamic network provisioning for time-varying traffic rates, with the objective of maximizing the system throughput. We assume that the network is capable of providing bandwidth guaranteed traffic tunnels for an ingress-egress pair and present an approach that (1) updates the tunnel routes and (2) adjusts the tunnel bandwidths, in an incremental, adaptive manner, based on the variations in the incoming traffic. First, we consider a simpler scenario where tunnel routes are fixed, and present an approach for adjusting the tunnel bandwidths dynamically. We show, through simulations, that our dynamic bandwidth assignment algorithm significantly outperforms the optimal static bandwidth provisioning policy, and yields a performance close to that of the optimal dynamic bandwidth provisioning policy. We also propose an adaptive route update algorithm, which can be used in conjunction with our dynamic bandwidth assignment policy, and leads to further improvement in the overall system performance.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.17-20
• /
• 2008

A clustering scheme for ad hoc networks is aimed at managing a number of mobile devices by utilizing hierarchical structure of the networks. In order to construct and maintain an effective hierarchical structure in ad hoc networks where mobile devices may move at high mobility, the following requirements must be satisfied. The role of each mobile device for the hierarchical structure is adaptive to dynamic change of the topology of the ad hoc networks. The role of each mobile device should thus change autonomously based on the local information. The overhead for management of the hierarchical structure is small. The number of mobile devices in each cluster should thus be almost equivalent. This paper proposes an adaptive multihop clustering scheme for highly mobile ad hoc networks. The results obtained by extensive simulation experiments show that the proposed scheme does not depend on mobility and node degree of mobile devices in the ad hoc network, which satisfy the above requirements.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2005.11a
• /
• pp.1203-1206
• /
• 2005

현재 무선 센서 네트워크에서 에너지 효율성을 고려한 많은 라우팅 프로토콜이 연구되고 있다. 하지만 기존에 제안된 무선 센서 네트워크 라우팅 프로토콜은 특정 상황 및 응용에 특화되어 있기 때문에, 동적으로 변화하는 네트워크 상에서는 데이터 전달의 정확성 및 에너지 효율성이 떨어지는 문제점이 있다. 본 연구에서는 이러한 문제점을 개선하기 위하여 퍼지 추론 시스템을 이용한 라우팅 프로토콜 선택 기법과 라우팅 프로토콜의 동적 배치 기법을 기반으로 한 퍼지 적응형 라우팅(FAR) 알고리즘을 제안한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.504-521
• /
• 2016

Recently, energy harvesting technology has been integrated into wireless sensor networks to ameliorate the nodes' energy limitation problem. In theory, the wireless sensor node equipped with an energy harvesting module can work permanently until hardware failures happen. However, due to the change of power supply, the traditional hierarchical network routing protocol can not be effectively adopted in energy harvesting wireless sensor networks. In this paper, we improve the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol to make it suitable for the energy harvesting wireless sensor networks. Specifically, the cluster heads are selected according to the estimation of nodes' harvested energy and consumed energy. Preference is given to the nodes with high harvested energy while taking the energy consumption rate into account. The utilization of harvested energy is mathematically formulated as a max-min optimization problem which maximizes the minimum energy conservation of each node. We have proved that maximizing the minimum energy conservation is an NP-hard problem theoretically. Thus, a polynomial time algorithm has been proposed to derive the near-optimal performance. Extensive simulation results show that our proposed routing scheme outperforms previous works in terms of energy conservation and balanced distribution.

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.303-310
• /
• 2008

To increase the lifetime of ad-hoc networks, a ratio of energy consumption for each node should be kept constant by equally distributing network traffic loads into all of the nodes. In this paper, we propose a modified AODV routing protocol to determine a possible route by considering a remaining battery capacity of a node and the degree of its usage. In addition, to reduce the amount of energy consumption during the path rediscovery process due to the huge amount of the AODV control messages the limited number of possible routes are stored into a routing table of a source node. When some links of a route fail, another possible path can be looked up in the table before the route discovery process should be initiated. We have tested our proposed method with a conventional AODV and a MMBCR method which is one of the power-efficient energy routing protocols based on the three performance metrics, i.e., the total remaining battery capacity, network lifetime and the ratio of data packets received by the destination node to compare their performance.