• The KIPS Transactions:PartC
• /
• v.14C no.4
• /
• pp.371-382
• /
• 2007

In this paper, we propose a real-time sensor node platform that efficiently manages periodic and aperiodic tasks. Since existing sensor node platforms available in literature focus on minimizing the usage of memory and power consumptions, they are not capable of supporting the management of tasks that need their real-time execution and fast average response time. We first analyze how to structure periodic or aperiodic task decomposition in the TinyOS-based sensor node platform as regard to guaranteeing the deadlines of ail the periodic tasks and aiming to providing aperiodic tasks with average good response time. Then we present the application and efficiency of the proposed real-time sensor node platform in the sensor node equipped with a low-power 8-bit microcontroller, an IEEE802.15.4 compliant 2.4GHz RF transceiver, and several sensors. Extensive experiments show that our sensor node platform yields efficient performance in terms of three significant, objective goals: deadline miss ratio of periodic tasks, average response time of aperiodic tasks, and processor utilization of periodic and aperiodic tasks.

• Journal of Information Processing Systems
• /
• v.16 no.5
• /
• pp.1113-1128
• /
• 2020

Ad hoc networks play an important role in mobile communications, and the performance of nodes has a significant impact on the choice of communication links. To ensure efficient and secure data forwarding and delivery, an intelligent routing protocol (IAODV) based on learning method is constructed. Five attributes of node energy, rate, credit value, computing power and transmission distance are taken as the basis of segmentation. By learning the selected samples and calculating the information gain of each attribute, the decision tree of routing node is constructed, and the rules of routing node selection are determined. IAODV algorithm realizes the adaptive evaluation and classification of network nodes, so as to determine the optimal transmission path from the source node to the destination node. The simulation results verify the feasibility, effectiveness and security of IAODV.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.7
• /
• pp.101-108
• /
• 2017

A wireless image sensor node collecting image data for environmental monitoring or surveillance requires a large amount of energy to transmit the huge amount of video data. Even though solar energy can be used to overcome the energy constraint, since the collected energy is also limited, an efficient energy management scheme for transmitting a large amount of video data is needed. In this paper, we propose a method to reduce the number of blackout nodes and increase the amount of gathered data by selecting an appropriate video coding method according to the energy condition of the node in a solar-powered wireless video sensor network. This scheme allocates the amount of energy that can be used over time in order to seamlessly collect data regardless of night or day, and selects a high compression coding method when the allocated energy is large and a low compression coding when the quota is low. Thereby, it reduces the blackout of the relay node and increases the amount of data obtained at the sink node by allowing the data to be transmitted continuously. Also, if the energy is lower than operating normaly, the frame rate is adjusted to prevent the energy exhaustion of nodes. Simulation results show that the proposed scheme suppresses the energy exhaustion of the relay node and collects more data than other schemes.

• Journal of the Korean Medical Association
• /
• v.61 no.11
• /
• pp.662-669
• /
• 2018

The cutaneous melanoma has been regarded as rare disease entity in Korea for long time but it shows a silent growth recently. Furthermore the management of cutaneous melanoma including staging system, surgical principle, sentinel lymph node biopsy and subsequent complete node dissection and, most importantly, immunotherapy and target therapy against cutaneous melanoma recently. The incidence of cutaneous melanoma is steadily increasing in Korea but its increase is rapid recent 2 decades to 4.3 times and should be greater soon according to the steeper increase of life expectancy. New staging system proposed by American Joint Committee on Cancer (2017) includes changes in individual TNM category and stage groups, particularly from a prognostic viewpoint. Dermoscopy has been successfully introduced in the differential diagnosis of pigmented skin lesion focusing on cutaneous melanoma by non-invasive simple diagnostic tool. Sentinel lymph node biopsy was a issue of long debate whether survival benefit is real or not. Temporary conclusion about this question is reached after two large scale studies and immediate complete node dissection should be performed in a certain situations. Most important change is drug therapy focusing on immunotherapy and target therapy. Braf- and MEK-inhibitor, immune checkpoint inhibitor and PD-1 blocker has been proved to be effective as a sole or combination regimen against advanced and/or high-risk adjuvant setting of cutaneous melanoma. In conclusion, these remarkable changes will be reviewed shortly here.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.46 no.4
• /
• pp.53-62
• /
• 2023

Effects-Based Operations (EBO) refers to a process for achieving strategic goals by focusing on effects rather than attrition-based destruction. For a successful implementation of EBO, identifying key nodes in an adversary network is crucial in the process of EBO. In this study, we suggest a network-based approach that combines network centrality and optimization to select the most influential nodes. First, we analyze the adversary's network structure to identify the node influence using degree and betweenness centrality. Degree centrality refers to the extent of direct links of a node to other nodes, and betweenness centrality refers to the extent to which a node lies between the paths connecting other nodes of a network together. Based on the centrality results, we then suggest an optimization model in which we minimize the sum of the main effects of the adversary by identifying the most influential nodes under the dynamic nature of the adversary network structure. Our results show that key node identification based on our optimization model outperforms simple centrality-based node identification in terms of decreasing the entire network value. We expect that these results can provide insight not only to military field for selecting key targets, but also to other multidisciplinary areas in identifying key nodes when they are interacting to each other in a network.

• The Journal of Society for e-Business Studies
• /
• v.2 no.1
• /
• pp.21-37
• /
• 1997

As the complexity in design and manufacturing activities of distributed virtual enterprises rapidly increases, the issue of process management becomes more critical to shorten the time-to-market, reduce the manufacturing cost and improve the product quality. This paper proposes a unified framework to manage design and manufacturing processes in a distributed environment. We present a methodology which utilizes process flow graphs to depict the hierarchical structure of workflows and process grammars to represent various design processes and design tools. To implement the proposed concept, we develop a process management system which mainly consists of a cockpit and manager programs, and we finally address a preliminary implementation procedure based on the Object Modeling Technique. Since the proposed framework can be a formal approach to the process management by providing formalism, parallelism, reusability, and flexibility, it can be effectively applied to further application domains of distributed virtual enterprises.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.15 no.6
• /
• pp.20-26
• /
• 2001

In this paper, we design tunnel inner section displacement measurement system which is composed of potentiometer-type displacement sensors, microcontroller-based intelligent sensing head and host computer for the management system and acquisition data. Multiple node communication bus connects the intelligent sensing heads with the host computer. For safe and re1iab1e network operation we use daisy-chain configuration, termination resistor, fail-safe biasing circuit. For tole enhancement of system utilization, we use modbus protocol. The acquisition data are transmitted to host computer and managed by database. Several data request conditions and sorting conditions are provided by management software. The utilization of designed system is confirmed by experiment.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.1
• /
• pp.83-90
• /
• 2010

DTNs (Delay Tolerant Networks) refer to the networks that can support data transmission in the extreme networking situations such as continuous delay and no connectivity between ends. DTMNs (Delay Tolerant Networks) are a specific range of DTNs, and its chief considerations in the process of message delivery in the routing protocol are the transmission delay, improvement of reliability, and reduction of network loading. This article proposes a new LCN (Largest Common Neighbor) routing algorism to improve Spray and Wait routing protocol that prevents the generation of unnecessary packets in a network by letting mobile nodes limit the number of copies of their messages to all nodes to L. Since higher L is distributed to nodes with directivity to the destination node and the maximum number of common neighbor nodes among the mobile nodes based on the directivity information of each node and the maximum number of common neighbor nodes, more efficient node transmission can be realized. In order to verify this proposed algorism, DTN simulator was designed by using ONE simulator. According to the result of this simulation, the suggested algorism can reduce average delay and unnecessary message generation.

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.439-450
• /
• 2001

Mobile agent is one of the promising ways of overcoming network load and latency. It is also a new software paradigm including those concepts of client/server, applet/servelet, and code-on-demand. In this paper, a new mobile agent concept with flexible replay scheme is proposed, which can deal with embarrassing situation when replying results should be accomplished in various distributed applications. For example, they are 1) a burden of bulky result, 2) a need of different replay scheme dependent on work type, 3) connection failure to the target node, and 4) a need of fast migration to next node to keep the itinerary. Regarding the source node, there may be another situation that it wants to be aware of whether its wi가 is completed or not. Three kinds of reply schemes are proposed for dealing flexibly with such situations. They are based on priority reply list where nodes to be replied are stored according to their priorities. An experimental supply chain management model using the proposed reply schemes is designed and implemented. It is one of good distributed applications appropriate for our reply schemes, because it requires different reply schemes according to work types and it is important to gather required information in time.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.16 no.2
• /
• pp.86-102
• /
• 1991

The purpose of this paper is to present a branch and bound algorithm for the hierarchical transportation network design problem in 2-level directed networks. This problem is to find the least cost of hierarchical transportation networks which consist of a primary path and a secondary path. The primary path is a simple path from a prespecified orgin node to a prespecified terminal node. All nodes must be either a transsipment node on the primary path or connected to that path via secondary arcs. This problem is formulated to a 0-1 inter programming problem with assignment and illegal subtour elimination equations as constaints. We show that the subproblem relaxing subtour elimination constraints is transformed to a linear programming problem by means of the totally unimodularity. Optimal solutions of this subproblem are polynoially obtained by the assignment algorithm and complementary slackness conditions. Therefore, the optimal value of this subproblme is used as a lower bound. When an optimal solution of the subproblem has an illegal subtour, a better disjoint rule is adopted as the branching strategy for reducing the number of branched problems. The computational comparison between the least bound rule and the depth first rule for the search strategy is given.