• The KIPS Transactions:PartA
• /
• v.10A no.1
• /
• pp.15-24
• /
• 2003

In this paper, an optimization model for the clustered node allocation systems in the distributed computing environment is presented. In the presented model with a distributed file system framework, the dynamics of system behavior over times is carefully thought over the nodes and hence the functionality of the cluster monitor node to check the feasibility of the current set of clustered node allocation is given. The cluster monitor node of the node allocation system capable of distributing the parallel modules to clustered nodes provides a good allocation solution using Genetic Algorithms (GA). As a part of the experimental studies, the solution quality and computation time effects of varying GA experimental parameters, such as the encoding scheme, the genetic operators (crossover, mutations), the population size, and the number of node modules, and the comparative findings are presented.

• 한국정보통신설비학회:학술대회논문집
• /
• 2009.08a
• /
• pp.387-390
• /
• 2009

Wireless Sensor Network (WSN) can easily compromised from attackers because it has the limited resource and deployed in exposed environments. When the sensitive packets are occurred such as enemy's movement or fire alarm, attackers can selectively drop them using a compromised node. It brings the isolation between the basestation and the sensor fields. To detect selective forwarding attack, Xiao, Yu and Gao proposed checkpoint-based multi-hop acknowledgement scheme (CHEMAS). The check-point nodes are used to detect the area which generating selective forwarding attacks. However, CHEMAS has static probability of selecting check-point nodes. It cannot achieve the flexibility to coordinate between the detection ability and the energy consumption. In this paper, we propose the control method for the number fo check-point nodes. Through the control method, we can achieve the flexibility which can provide the sufficient detection ability while conserving the energy consumption.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.5
• /
• pp.1412-1430
• /
• 2024

The soft cancellation list (SCANL) decoding algorithm for polar codes runs L soft cancellation (SCAN) decoders with different decoding factor graphs. Although it can achieve better decoding performance than SCAN algorithm, it has high latency. In this paper, a fast simplified SCANL (Fast-SSCANL) algorithm that runs L independent Fast-SSCAN decoders is proposed. In Fast-SSCANL decoder, special nodes in each factor graph is identified, and corresponding low-latency decoding approaches for each special node is propose first. Then, syndrome check aided Fast-SSCANL (SC-Fast-SSCANL) algorithm is further put forward. The ordinary nodes satisfied the syndrome check will execute hard decision directly without traversing the factor graph, thereby reducing the decoding latency further. Simulation results show that Fast-SSCANL and SC-Fast-SSCANL algorithms can achieve the same BER performance as the SCANL algorithm with lower latency. Fast-SSCANL algorithm can reduce latency by more than 83% compared with SCANL, and SC-Fast-SSCANL algorithm can reduce more than 85% latency compared with SCANL regardless of code length and code rate.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.4
• /
• pp.990-1004
• /
• 1995

A modified 16-node element for composite plate has been proposed and compared with the 20-node element to check the validity of it. The fields of numerical inspection include mode analysis and specific damping analysis. By symetrizing the conventional unsymmetric damping matrix in the analysis of specific damping capacity, we could compute the specific damping capacity and make a program, effectively. In addition, we could predict the errors caused by reduction of integration order in thickness direction depending upon the number of layers.

• Structural Engineering and Mechanics
• /
• v.6 no.6
• /
• pp.711-725
• /
• 1998

Mixed finite element formulations for incompressible materials show pressure oscillations or pressure modes in four-node quadrilateral elements. The criterion for the stability in the pressure solution is the so-called Babu$\check{s}$ka-Brezzi stability condition, and the four-node elements based on mixed variational principles do not appear to satisfy this condition. In this study, a pressure continuity residual based on the pressure discontinuity at element edges proposed by Hughes and Franca is used to study the stabilization of pressure solutions in bilinear displacement-constant pressure four-node quadrilateral elements. Also, a solid mechanics problem is presented by which the stability of mixed elements can be studied. It is shown that the pressure solutions, although stable, are shown to exhibit sensitivity to the stabilization parameters.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5437-5454
• /
• 2016

A Wireless Sensor Network (WSN) is composed of several sensor nodes which are severely restricted to energy and memory. Energy is the lifeblood of sensors and thus energy conservation is a critical necessity of WSN. This paper proposes a clustering algorithm namely Energy Efficient Trustworthy Clustering algorithm (EETCA), which focuses on three phases such as chief node election, chief node recycling process and bi-level trust computation. The chief node election is achieved by Dempster-Shafer theory based on trust. In the second phase, the selected chief node is recycled with respect to the current available energy. The final phase is concerned with the computation of bi-level trust, which is triggered for every time interval. This is to check the trustworthiness of the participating nodes. The nodes below the fixed trust threshold are blocked, so as to ensure trustworthiness. The system consumes lesser energy, as all the nodes behave normally and unwanted energy consumption is completely weeded out. The experimental results of EETCA are satisfactory in terms of reduced energy consumption and prolonged lifetime of the network.

• The KIPS Transactions:PartC
• /
• v.17C no.2
• /
• pp.153-158
• /
• 2010

Mobile IPv6 is one of method can keep Mobile node's session. To solve legacy Mobile IPv4's triangular routing problem, in Mobile IPv6, Mobile Node could directly communicate with Correspond node by Binding Update. But, attacker could interfere Return Routability Procedure that is Correspond node check Home address and Care of address reachable. At this result, Attacker is able to hijack Session to correspond node from Mobile node. In This paper, We propose new Binding Update scheme for solving that problem. Our approach is that MN gives association both home token and care of token using onewayness of keyed hash fuction. From security and performance analysis, we can see that proposed binding Update Scheme can achieve stronger security than legacy scheme and at the same time requires minimal computational overhead.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.781-783
• /
• 2014

Mobile ad hoc network(MANET) consists of node that has mobility. MANET has increased overhead that caused by frequent topology changes. For reducing overhead, hierarchical network that communicates through cluster head node has been researched. When traffic is concentrated on cluster head node, cluster member node can't send message. To solve this problem, we proposed Step Parent algorithm. Proposed algorithm, cluster member node checks traffic of cluster head node using route path of other cluster head node in efficient coverage area. When cluster head node has increased traffic, cluster member node make a new route path by route path by routing path to another cluster head node. So cluster member node sends a message to destination node, we check improving delivery ratio.

• The Journal of the Korea Contents Association
• /
• v.8 no.1
• /
• pp.186-194
• /
• 2008

This paper has implemented a ubiquitous healthcare system that can measure and check the electrocardiogram of a human body in anytime and anywhere. The implemented prototype is composed of electrocardiogram measurement terminal, data gathering base node, and medical information server. The implemented node constructs a sensor network using the Zigbee protocol and the TinyOS is installed on each node. The data gathering base node is linux-based node that can transfer sensed medial data through wireless LAN. And, the medical information server stores the processed medical data and can promptly notify the urgent status to the connected medical team. Through experiment, we confirmed the possibility of ubiquitous healthcare system based on sensor network using the Zigbee.

• Structural Engineering and Mechanics
• /
• v.51 no.5
• /
• pp.773-792
• /
• 2014

In this paper, we study the inverse mode shape problem for an Euler-Bernoulli beam, using an analytical approach. The mass and stiffness variations are determined for a beam, having various boundary conditions, which has a prescribed polynomial second mode shape with an internal node. It is found that physically feasible rectangular cross-section beams which satisfy the inverse problem exist for a variety of boundary conditions. The effect of the location of the internal node on the mass and stiffness variations and on the deflection of the beam is studied. The derived functions are used to verify the p-version finite element code, for the cantilever boundary condition. The paper also presents the bounds on the location of the internal node, for a valid mass and stiffness variation, for any given boundary condition. The derived property variations, corresponding to a given mode shape and boundary condition, also provides a simple closed-form solution for a class of non-uniform Euler-Bernoulli beams. These closed-form solutions can also be used to check optimization algorithms proposed for modal tailoring.