• Journal of Korean Society of Forest Science
• /
• v.103 no.4
• /
• pp.583-592
• /
• 2014

This study was carried out to investigate the operational time and productivity of logging operation by chain saw, yarder attached on tractor, tower-yarder, mini-truck, mini-forwarder, and chipping operations by mini-chipper, large-chipper in order to develop the efficient logging operation system for utilization of forest-biomass. As a result, the average felling and bucking time using chain saw at the site 1 and 2 was observed to be 182.7 sec/cycle and 518.5 sec/cycle respectively. The average yarding time was 202.5 sec/cycle using yarder attached on tractor and 295.1 sec/cycle using tower-yarder. The average forwarding time was 2,073 sec/cycle using mini-truck and 2,248.4 sec/cycle using mini-forwarder. The operational time of felling and bucking using chain-saw can be delayed according to the direction of fallen trees. The selection of felling direction is very important to yarding operation because the direction between width-yarding and felling are interrelated. Productivity can be improved through educating and training operators in the yarding operations. Mini-forwarder is needed to use because of higher productivity and lower cost than mini-truck. The operational productivity of felling and bucking by chain saw was $66.96m^3/man{\cdot}day$ and $43.86m^3/man{\cdot}day$ at site 1 and 2 respectively. The yarding productivity was $5.68m^3/man{\cdot}day$ by yarder attached on tractor, $10.74m^3/man{\cdot}day$ by tower-yarder. The forwarding productivity was $21.29m^3/man{\cdot}day$ by mini-truck, $28.57m^3/man{\cdot}day$ by mini-forwarder. The chipping productivity was $4.42m^3/man{\cdot}day$ by mini-chipper, $21.87m^3/man{\cdot}day$ by large-chipper.

• Journal of Navigation and Port Research
• /
• v.32 no.1
• /
• pp.47-56
• /
• 2008

With rapid growing of the Northeastern Asia, the interest for the connection of Infrastructure that was behind of interesting until now is getting larger. In a line of same connection, UN-ESCAP are forwarding transcontinental railway project, asian highway project et al.. And this study aimed at analysis on the effect that extended to a space by Korea-Japan undersea tunnel project. In aspect of a national land balanced-development to solve various problems such as overcrowding in capital region, unbalanced state by regions, weak exchange between South and North Korea, and weakness of national land basis to prepare for unification et al., this study consulted the economic potentiality model as a analysis method to examine an effect. In this analysis, I used 24 scenarios including all cases by combination of 3 scenarios for Korea-Japan undersea tunnel, 4 scenarios for transportation modes in the section of undersea tunnel, and 2 scenarios for adjacency infrastructure. Transportation modes in the section of undersea tunnel are railway, car-train, mixing way of railway and car-train, and mixing way of road and railway. Adjacency infrastructure applied railway and road. In all scenarios, Korea showed higher growth potentiality than Japan. Also, proposal plan C route relatively showed better in national land balanced-development than other proposal plans. The growth potentiality relatively appeared higher by buildup of a connection together with non-capital regions from the construction of Korea-Japan undersea tunnel. In aspect of Northeastern Asia, it resulted in a increasing of trade and chance of network formation in the region of Asia through infrastructure connection. But, in considering passenger and various factors that extended to the economic growth, this analysis have some limitation. Therefore, I hope that deep studies will continuously perform with various factors.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.10
• /
• pp.29-39
• /
• 2008

Greedy routing which is easy to apply to geographic wireless sensor networks is frequently used. Greedy routing works well in dense networks whereas in sparse networks it may fail. When greedy routing fails, it needs a recovery algorithm to get out of the communication void. However, additional recovery algorithm causes problems that increase both the amount of packet transmission and energy consumption. Communication void is a condition where all neighbor nodes are further away from the destination than the node currently holding a packet and it therefore cannot forward a packet using greedy forwarding. Therefore we propose a VODUA(Virtually Ordered Distance Upgrade Algorithm) as a novel idea to improve and solve the problem of void. In VODUA, nodes exchange routing graphs that indicate information of connection among the nodes and if there exist a stuck node that cannot forward packets, it is terminated using Distance Cost(DC). In this study, we indicate that packets reach successfully their destination while avoiding void through upgrading of DC. We designed the VODUA algorithm to find valid routes through faster delivery and less energy consumption without requirement for an additional recovery algorithm. Moreover, by using VODUA, a network can be adapted rapidly to node's failure or topological change. This is because the algorithm utilizes information of single hop instead of topological information of entire network. Simulation results show that VODUA can deliver packets from source node to destination with shorter time and less hops than other pre-existing algorithms like GPSR and DUA.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.4
• /
• pp.31-40
• /
• 2016

In vehicular ad-hoc networks (VANETs), vehicles sense information on emergency incidents (e.g., accidents, unexpected road conditions, etc.) and propagate this information to following vehicles and a server to share the information. However, this process of emergency message propagation is based on multiple broadcast messages and can lead to broadcast storms. To address this issue, in this work, we use a novel approach to detect the vehicles that are farthest away but within communication range of the transmitting vehicle. Specifically, we discuss a signal-to-noise ratio (SNR)-based linear back-off (SLB) scheme where vehicles implicitly detect their relative locations to the transmitter with respect to the SNR of the received packets. Once the relative locations are detected, nodes that are farther away will set a relatively shorter back-off to prioritize its forwarding process so that other vehicles can suppress their transmissions based on packet overhearing. We evaluate SLB using a realistic simulation environment which consists of a NS-3 VANET simulation environment, a software-based WiFi-IP gateway, and an ITS server operating on a separate machine. Comparisons with other broadcasting-based schemes indicate that SLB successfully propagates emergency messages with latencies and hop counts that is close to the experimental optimal while reducing the number of transmissions by as much as 1/20.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.26 no.2
• /
• pp.113-119
• /
• 2016

Wireless sensor networks are vulnerable to an adversary due to scarce resources and wireless communication. An adversary can compromise a sensor node and launch a variety of attacks such as false report injection attacks. This attack may cause monetary damage resulting in energy drain by forwarding the false reports and false alarms at the base station. In order to address this problem, a number of en-route filtering schemes has been proposed. Notably, a dynamic en-route filtering scheme can save energy by filtering of the false report. In the key dissemination phase of the existing scheme, the nodes closer to the source node may not have matching keys to detect the false report. Therefore, continuous attacks may result in unnecessary energy wastage. In this paper, we propose a key re-distribution scheme to solve this issue. The proposed scheme early detects the false report injection attacks using initially assigned secret keys in the phase of the key pre-distribution. The experimental results demonstrate the validity of our scheme with energy efficiency of up to 26.63% and filtering capacity up to 15.92% as compared to the existing scheme.

• The Journal of the Korea Contents Association
• /
• v.20 no.6
• /
• pp.326-341
• /
• 2020

Based on theoretical background of Situational Theory of Problem Solving(STOPS), we have examined the role of STOPS variables on a group of online public in their issue recognition and communicative behavior on Korea's nationwide civil boycott movement of Japanese goods. Results from 524 survey cases from a Korea's major online community show that two independent variables(Problem Recognition, Referent Criterion) revealed positive in their effect on mediating variable(Situational Motivation in Problem Solving). Situational Motivation also revealed positive in its effect on six dependent variables(Information Forefending, Information Permitting, Information Forwarding, Information Sharing, Information Seeking, Information Attending) of Communicative Behavior. Involvement Recognition and Constraint Recognition revealed positive without proper statistical significance. As a result, study on the case of online public in Korea supports STOPS theory as high-level of Problem Recognition and Referent Criterion effects on Communicative Behavior in positive way via Situational Motivation. Implications from the findings have discussed and proposed suggestions for government public relations and further studies.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.3
• /
• pp.115-124
• /
• 2015

In this paper we analyse the previous (Quality of Services) and QoE(Quality of Experience) methods, and propose a high reliable network system framework and its service forwarding method that is able to provide seamless N-Screen services for proliferating disaster informations. The service satisfaction measurement, i.e., QoE, of contents consumers in N-screens services is going to be important the factor in disaster information proliferation because N-Screen services in the previous methods based on multi devices only focused on information transmission. The proposed system around these services is composed of a disaster information process framework for accepting user's service requirement, push service modules for minimizing the number of packets to be caused when carrying out the push service, and a push service controller for maximizing QoE measures. In order to provide a seamless N-Screen service on diverse screens, such as smartphone, PC, and big screen, we also have Open API(Application Programming Interface) functions. Through these results, we expect to evaluate QoS and QoE quality in the seamless N-Screen service.

• Journal of the Korea Society for Simulation
• /
• v.16 no.4
• /
• pp.57-65
• /
• 2007

In many sensor network applications, sensor nodes are deployed in open environments, and hence are vulnerable to physical attacks, potentially compromising the node's cryptographic keys. False sensing report can be injected through compromised nodes, which can lead to not only false alarms but also the depletion of limited energy resource in battery powered networks. Fan Ye et al. proposed that statistical en-route filtering scheme(SEF) can do verify the false report during the forwarding process. In this scheme, the choice of a partition value represents a trade off between resilience and energy where the partition value is the total number of partitions which global key pool is divided. If every partition are compromised by an adversary, SEF disables the filtering capability. Also, when an adversary has compromised a very small portion of keys in every partition, the remaining uncompromised keys which take a large portion of the total cannot be used to filter false reports. We propose a fuzzy-based adaptive partitioning method in which a global key pool is adaptively divided into multiple partitions by a fuzzy rule-based system. The fuzzy logic determines a partition value by considering the number of compromised partitions, the energy and density of all nodes. The fuzzy based partition value can conserve energy, while it provides sufficient resilience.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.251-267
• /
• 2008

In this paper, we present a distributed topology control algorithm for constructing an optimized topology having a minimal search-time in unstructured peer-to-peer network. According to the proposed algorithm, each node selects the best nodes having higher hit-ratio than other nodes as many as the number being exponentially proportional to the hit-ratio of the node itself, and then it connects to them. The ensemble behavior of the proposed algorithm is very similar to the recrystrallizing phenomenon that is observed in nature. There is a partial order relationship among the hit-ratios of most nodes of constructed topology. Therefore once query message visits a node, it has a higher hit-ratio than the node that was visited last by the message. The query message even sent from freeloader can escape to the node having high hit-ratio by one hop forwarding, and it never revisits any freeloader again. Thus the search can be completed within a limited search time. We also propose the Chain-reactive search scheme using the constructed topology. Such a controlled multicasting reduces the query messages by 43 percent compared to that of the naive Gnutella using broadcasting, while it saves the search time by 94 percent. The search success rate of the proposed scheme is 99 percent.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.1020-1030
• /
• 2016

This paper propose an improving relay node selection method for node-to-node connectivity. This concern with the mobility and analysis of deployed for masking operation using highest connectivity node. The major of Delay Tolerant Network (DTN) routing protocols make use of simple forwarding approach to transmit the message depend on the node's mobility. In this cases, the selection of the irrelevant mobile node induced the delay and packet delivery loss caused by limiting buffer size and computational power of node. Also the proposed algorithm provides the node connectivity considering the mobility and direction select the highest connectivity node from neighbor node using masking operation. From the simulation results, the proposed algorithm compared the packet delivery ratio with PROPHET and Epidemic. The proposed Enhanced Prediction-based Context-awareness Matrix(EPCM) algorithm shows an advantage packet delivery ratio even with selecting relay node according to mobility and direction.