• Journal of the Ergonomics Society of Korea
• /
• v.35 no.3
• /
• pp.155-163
• /
• 2016

Objective: This study aims to draw the characteristics of occupational accidents occurred in cabling work, and assess accident severity based on occupational injury data. Background: Accident factors and accident risk are different by the place of work in cabling work. Field managers require information on accident prevention that can be easily understood by workers. However, there has been a lack of studies that focus on cabling work in Korea. Method: This study classifies 450 injured persons caused in cabling work by process, and analyzes the characteristics of occupational injuries from the aspects of age, work experience and accident type. This study also analyzes accident frequency and severity of injury. Results: Results show that preparing/finishing (33.3%) was the most common type of cabling process in injuries, followed by maintenance (28.4%), routing/income (23.1%) and wiring/installation (15.1%) process. The critical incidents in the level of risk management were falls from height in the routing/incoming process, and falls from height in the maintenance process. And, incidents ranked as 'High' level of risk management were slips and trips, fall from height and vehicle incident in the preparing/finishing process, and fall from height in the wiring/installation process. Conclusion and Application: The relative frequency of accident and its severity by working process serve as important information for accident prevention, and are critical for determining priorities in preventive measures.

• Journal of Advanced Navigation Technology
• /
• v.7 no.2
• /
• pp.206-210
• /
• 2003

In this paper, we design standard cell libraries using the 0.18um deep submircom CMOS process, and port them into a P&R (Placement and Routing) CAD tool. A simple test chip has been designed in order to verify the functionalities of the 0.18um standard cell libraries whose technical process was provided by Anam semiconductor. Through these experiments, we have found that the new 0.18um CMOS process can be successfully applied to automatic digital system design.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9A
• /
• pp.728-735
• /
• 2003

It is a mainly issue that provide mobility smoothly in Mobile IP networks. The IP mobility support being standardized in the IETF utilized tunneling of IP packets from a home agent to foreign agent and utilized reverse tunneling of IP packets from foreign agent to home agent. In this paper, We propose that solve the triangular routing problem in IP mobility and that lessen the messages about IETF routing optimization. Through the Mobile Routing Table on the edge router, agent process the message instead of a end node when handoff occur and that lessen the routing path length by sending directly from FA to to Correspond Node's router. This action lessen the message occurrence frequency and the packet drop. We compare the standard IP, Routing Optimization of Mobile IP, Wu's method and the proposed algorithm. Finally, the simulation results are presented.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.3
• /
• pp.37-41
• /
• 2020

In this paper, we propose a routing method to improve the message transmission efficiency between DTN nodes in an environment where communication infrastructure in the city is destroyed. In the situation where a certain size of communication infrastructure can not function, the message transmission process between the nodes is explained. An effective routing method for improving reliability between nodes was proposed and evaluated using DTN simulator. The routing algorithm with improved reliability in urban areas was confirmed by simulation considering the message transmission relationship between nodes on uncertain path due to the destruction of communication infrastructure. We used a routing algorithm that includes all the contact information the node has experienced in the past. In the simulation of delivering messages in a situation where the communication infrastructure was destroyed, relatively better results were obtained than the existing routing algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.8 s.350
• /
• pp.1-14
• /
• 2006

Multi-constraint QoS routing has been seen as crucial network property in the next generation optical Internet based on DWDM Networks. This paper proposes a new QoS routing algorithm based on flooding method, called bounded flooding routing (BFR) algorithm which can meet multi-constraint QoS requirements. Primarily, the BFR algorithm tries to reduce network overhead by accomplishing bounded-flooding to meet QoS requirements, and improve blocking probability and wavelength utilization. Also, as one effort to improve routing performance, we introduce a new concept, ripple count, which does not need any link-state information and computational process. For extensive analysis and simulation study, as a critical concern, in DWDM-based networks we deploy limited wavelength conversion capability within DWDM nodes. And the simulation results demonstrate that the BFR algorithm is superior to other predominant routing algorithms (both original flooding method and source-directed methods) in terms of blocking probability, wavelength channels required and overhead.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.6
• /
• pp.131-138
• /
• 2008

Mobile Ad hoc NETworks (MANETs) refer to autonomous networks in which wireless data communications are established between multiple nodes in a given coverage area without a base station or centralized administration. Because of node mobility and limited battery life, the network topology may changes frequently. Selecting the most reliable path during route discovery process is important to improve performance in ad hoc networks. In this paper, an enhanced routing protocol based on AODV(Ad hoc On-demand Distance Vector routing) by monitoring variation of receiving signal strength is proposed. New metric function that consists of node mobility and hops of path is used for routing decision. For preventing route failure by node movement during data transmission, a new route maintenance named as LRC (Local Route Change) is presented. If the node movement is detected, the routing agent switches path to its neighbor node in LRC. Simulation results show that the performance of the proposed routing scheme is superior to previous AODY protocol.

• Journal of Korea Society of Industrial Information Systems
• /
• v.14 no.4
• /
• pp.1-7
• /
• 2009

This paper presents a process routing (PR) algorithm with multiple objectives. PR determines the optimum sequence of operations for transforming a raw material into a completed part within the available machining resources. In any computer aided process planning (CAPP) system, selection of the machining operation sequence is one of the most critical activities for manufacturing a part and for the technical specification in the part drawing. Here, the goal could be to generate the sequence that optimizes production time, production cost, machine utilization or with multiple these criteria. The Pareto Stratum Niche Cubicle (PS NC) GA has been adopted to find the optimum sequence of operations that optimize two conflicting criteria; production cost and production quality. The numerical analysis shows that the proposed PS NC GA is both effective and efficient to the PR problem.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.12
• /
• pp.2211-2217
• /
• 2016

The Locator/Identifier Separation Protocol (LISP) is a new routing architecture that implements a new semantic for IP addressing. It enables the separation of IP addresses into two new numbering spaces: Endpoint Identifiers (EIDs) and Routing Locators (RLOCs). This approach will solve the issue of rapid growth of the Internet's DFZ (default-free zone). In this paper, we propose an algorithm called the Propagated-Mode Mapping System to improve the map request process of LISP-DDT.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.1
• /
• pp.5-24
• /
• 2010

Data fusion is an attractive technology because it allows various trade-offs related to performance metrics, e.g., energy, latency, accuracy, fault-tolerance and security in wireless sensor networks (WSNs). Under a complicated environment, each sensor node must be equipped with more than one type of sensor module to monitor multi-targets, so that the complexity for the fusion process is increased due to the existence of various physical attributes. In this paper, we first investigate the process and performance of multi-attribute fusion in data gathering of WSNs, and then propose a self-adaptive threshold method to balance the different change rates of each attributive data. Furthermore, we present a method to measure the energy-conservation efficiency of multi-attribute fusion. Based on our proposed methods, we design a novel energy equilibrium routing method for WSNs, viz., multi-attribute fusion tree (MAFT). Simulation results demonstrate that MAFT achieves very good performance in terms of the network lifetime.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4A
• /
• pp.369-379
• /
• 2011

During the routing process between nodes on the CR(Cognitive Radio) network conducting for efficient use of limited frequency resources, spectrum handover process due to the appearance of the PU occupies most of the routing latency, and also decreases the reliability of the path. In this paper, a cooperative routing protocol in a multi-channel environment is proposed. The source node broadcasts a message with available channel lists and probability of PU appearance during its route guidance. The intermediate nodes re-transmit the message, received from the source node, and update and maintain the information, status table of the path. The destination node determines the optimal path and sends a reply message to the selected path after it receives the messages from the intermediate nodes. The average probability of the PU appearance and the average time of the PU appearance are updated while transferring data. During data transmission the channel with the lowest probability of appearance of the PU is selected dynamically and if a PU appears on the current channel partial repairment is performed. It is examined that reliability of the selected path considerably is improved and the routing cost is reduced significantly compared to traditional routing methods.