• Journal of Communications and Networks
• /
• v.14 no.3
• /
• pp.296-309
• /
• 2012

In existing middleware for body sensor networks, energy limitations, hardware heterogeneity, increases in node temperature, and the absence of software reusability are major problems. In this paper, we propose an event-based grid middleware component that solves these problems using distributed resources in in vivo sensor nodes. In our multi-hop communication, we use a lightweight rendezvous routing algorithm in a publish/subscribe system of event-based communication. To facilitate software reuse and application development, a modified open services gateway initiative has been implemented in our middleware architecture. We evaluated our grid middleware in a cancer treatment scenario with combined hyperthermia, chemotherapy, and radiotherapy procedures, using in vivo sensors.

• Journal of the Korea Society of Computer and Information
• /
• v.5 no.4
• /
• pp.126-130
• /
• 2000

Recently, the Progress of computer environment has been changed from integration to distribution. This rapid progress makes several novel fields like Jini & Mobile Agent systems. Although these provided the new technology. but not used commonly. Because they have some problems. That is Jini has a problem of giving a heavy load on the service, and the Mobile Agent technology has not supported dynamically routing. This paper will Provide a design of Mobile Agent that routed dynamically, and propose a system which offers a service to client with giving low to the service.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2002.05a
• /
• pp.27-40
• /
• 2002

Developed at Colorado State University, CASC2D-SED is a physically-based model simulating the hydrologic response of a watershed to a distributed rainfall field. The time-dependent processes include: precipitation, interception, infiltration, surface runoff and channel routing, upland erosion, transport and sedimentation. CASC2D-SED is applied to Goodwin Creek, Mississippi. The watershed covers 21 $\textrm{km}^2$ and has been extensively monitored both at the outlet and at several internal locations by the ARS-NSL at Oxford, MS. The model has been calibrated and validated using rainfall data from 16 meteorological stations,6 stream gaging stations and 6 sediment gaging stations. Sediment erosion/deposition rates by size fraction are predicted both in space and time. Geovisualization, a powerful data exploration technique based on GIS technology, is used to analyze and display the dynamic output time series generated by the CASC2D-SED model.

• Journal of the Korea Society for Simulation
• /
• v.8 no.1
• /
• pp.101-111
• /
• 1999

The Web-based simulation was introduced for conducting simulation experiments in the Internet and the Web. Due to the use of the Java language, the Web-based simulation can have such characteristics as reusability, portability, and the capability of execution on the Web. Most of existing Web-based simulation tools have focused mainly on the development of the runtime simulation libraries and mechanisms on the Web. Thus, the model development work in such Web-based simulation tools still requires hand-written coding of model developers. This paper presents a visual model development environment for the Web-based simulation. The proposed environment provides a framework for model development and animation. To show the effectiveness of the proposed environment, we perform simulation experiments for transaction routing algorithms in a distributed transaction processing system.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.2
• /
• pp.132-139
• /
• 2008

This paper proposes a scatternet topology formation, self-healing, and self-routing path optimization algorithm based on Relative Neighborhood Graph. The performance of the algorithm using ns-2 and extensible Bluetooth simulator called blueware shows that even though RNG-FHR does not have superior performance, it is simpler and easier to implement in deploying the Ad-Hoc network in the distributed dynamic environments due to the exchange of fewer messages and the only dependency on local information. We realize that our proposed algorithm is more practicable in a reasonable size network than in a large scale.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2023.05a
• /
• pp.214-214
• /
• 2023

네트워크로 구성된 시스템은 물질, 에너지, 신호 등의 입력(input)이 주어졌을 때, 경로 추적, 즉 라우팅(routing)을 통해 출력(output)으로 연결되고, 이를 반응함수로 나타낼 수 있다. 같은 입력값이라도 네트워크에 따른 연결 구조와 라우팅 과정에서 소요되는 시간차에 따라 출력값이 달라질 수 있다. 좋은 예로 강우에 따른 유출반응함수를 나타내는 자연 하천망을 들 수 있다. 이론적으로 순간의 입력이 주어졌을 때 (입력의 지속시간이 0), 출력은 순간반응함수로 표현된다. 자연 하천망에 대한 선행연구에서는 강우강도에 따라 순간반응함수가 변화한다는 비선형성이 알려졌다. 하지만, 비선형성을 가져오는 물리적 과정에 대해서는 많은 연구가 필요하다. 이 연구는 격자 형태로 주어진 임의의 네트워크에서 각 격자에 대해 순간반응함수를 구하는 분포형 모형을 제시한다. 입력자료와 라우팅 방법에 따른 연결 구조 및 순간반응함수의 변화를 격자 별로 확인하고, 이를 통해 시스템의 비선형성을 고려할 수 있는지 고찰하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1050-1052
• /
• 2010

Locator and Identifier Split is considered as the solution to the scalability problem Internet is facing today. The separation approach of Locator and Identifier requires a third party called mapping system. The mapping system enables the inter-domain routing between two different edge networks. The design of this third party has generated many proposals, among them one approach use Border Gateway Protocol (BGP) for effective mapping information updates distribution. In this paper, we take advantage of this approach by considering the scalability in term of mapping information storage. Our goal is to provide scalability in term of mapping information storage as well as effective mapping information updates distribution.

• International journal of advanced smart convergence
• /
• v.12 no.2
• /
• pp.173-181
• /
• 2023

Data collection is an essential element in the construction and operation of a smart factory. The quality of data collection is greatly influenced by network conditions, and existing wireless network systems for IoT inevitably lose data due to wireless signal strength. This data loss has contributed to increased system instability due to misinformation based on incorrect data. In this study, I designed a distributed MQTT IoT smart sensor and gateway structure that supports wireless multicasting for smooth sensor data collection. Through this, it was possible to derive significant results in the service latency and data loss rate of packets even in a wireless environment, unlike the MQTT QoS-based system. Therefore, through this study, it will be possible to implement a data collection management system optimized for the domestic smart factory manufacturing environment that can prevent data loss and delay due to abnormal data generation and minimize the input of management personnel.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.932-935
• /
• 2007

모바일 기기 사용이 급증함에 따라 모바일환경에서 이루어지는 P2P방식 연구가 활발히 진행되고 있다. 본 논문에서는 기존의 모바일환경에서의 P2P방식이 지닌 peer들 사이의 multi-broadcasting 방식의 문제점을 보완하고, 새로운 routing table을 구축하기 위해 peer들을 2개의 계층으로 구분하였다. 즉, peer들을 super peer들과 각 super peer에 의해 관리되는 sub peer들로 구분하였다. 파일의 탐색과 전송은 super peer들이 관리하므로, 기존의 불필요한 multi-broadcasting 방식을 피할 수 있다. 본 논문에서는 분산 네트워크를 위한 peer의 계층화 작업을 설계하였다. MIS(Maximal Independent Set)알고리즘을 이용하여 peer들의 계층화 작업을 외부의 도움 없이 peer들간의 통신으로 할 수 있게 만들었다. 이처럼 peer들을 super peer와 sub peer로 구분하면 불필요한 broadcasting을 피할 수 있어 시스템 성능이 향상되며, 이를 실험을 통하여 증명하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.632-635
• /
• 2015

Proposal algorithm in this thesis introduced cells, units of router group, for distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm. As a result of performance analysis comparing with existing genetic algorithm through experiments, the proposal algorithm was found superior in terms of costs and delay time. Furthermore, time for routing an alternative path was reduced in proposal algorithm, in case that a network was damaged in existing optimal path algorithm, Dijkstra algorithm, and the proposal algorithm was designed to route an alternative path faster than Dijkstra algorithm, as it has a 2nd shortest path in cells of the damaged network. The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.