• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.20 no.3
• /
• pp.293-301
• /
• 2007

We present a new global-local analysis with the aid of MLS(Moving Least Square) variable-node finite elements which can possess an arbitrary number of nodes on element master domain. It enables us to connect one finite element with a few finite elements without complex remeshing. Compared to other type global-local analysis, it does not require any superimposed mesh or need not solve the equilibrium equation twice. To demonstrate the performance of the proposed scheme, we will show several examples in relation to capturing highly local stress field using global-local analysis.

• Journal of Korea Multimedia Society
• /
• v.7 no.1
• /
• pp.106-112
• /
• 2004

Mobile IP is a solution for mobility on the global Internet. However, it causes service delay incase of frequent movement of mobile node and mobile users. Mobile IP regional registration is Proposed to reduce the service delay. In this paper, we introduce an optimal regional location management mechanism for Mobile IP that reduces the registration delay. The movement of mobile node is described by a discrete analytical model. The proposed model explains analytically average packet rate and registration cost as the size of regional networks with mobility of mobile node.

• Journal of KIISE:Information Networking
• /
• v.34 no.2
• /
• pp.88-99
• /
• 2007

P2P systems are distributed data sharing systems, and each node in them plays the role of client as well as server. There are several studies using Distributed Hash Table, such as Chord, CAN, Tapestry, Pastry, but these systems don't consider the physical latency, therefore they have a weakness of difficulty to guarantee stable performance. To improve this problem, we present the TP2P system. This system is a self-organizing hierarchical overlay system and it uses Chord routing mechanism for lookup data. This system is organized by several subnets, each subnet is organized by physically close nodes, and global network organized by all nodes. In each subnet, one node finds a data, it saves in a node in the subnet, therefore it has higher probability to reduce physical lookup latency than Chord system. And each node has global information of some nodes in its subnet, and it is used to lookup data, therefore the number of hops decrease about 25% as well as the physical lookup latecy are reduced.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.187-188
• /
• 2006

In CDMA based mobile communication network, signaling messages are routed through Signaling Transfer Point(STP) which is responsible for MTP layer 3 switching. As WCDMA based UMTS network is considered as next generation technology allowing global roaming services, all nodes in networks have their own identity number called Global Title(GT). Therefore, it is essential to introduce Signaling Gateway(SG) responsible for SCCP layer switching to solve the problem each node has all GT tables including even all overseas nodes. In this paper, we propose the signaling network architecture in UMTS networks using SG and we show that we can reduce CAPEX and OPEX in each node. To show the validity of the proposed method some simulations are given in which the results can be expected by intuitive observation.

• Journal of Computing Science and Engineering
• /
• v.11 no.2
• /
• pp.49-57
• /
• 2017

This paper proposes a new IPv6 networking paradigm as a counter answer to the rationale for locator/identifier separation. Instead of involving separate number spaces each for node identifiers and locators, the context of the IP address as a node identifier alone is utilized and no additional locators are incorporated. That is, there are only node addresses and no locators, and location information is indirectly derived from neighbor relations between nodes. In order to accomplish this, no subnet IDs are utilized; the ID value is set to zero for all subnets. The paper details how to construct this paradigm through novel choice of operational policies in various IPv6 protocols and some trivial modifications. Especially, inherent provision of intra-domain node- as well as subnet-mobility by use of standard link-state intra-domain routing protocols is discussed. A number of important advantages of this paradigm over the canonical IPv6 networking and various known solutions of locator/identifier separation are discussed. Tailoring for multi-area domains and IPv4 is left for further study.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.05a
• /
• pp.301-304
• /
• 2002

Powertrain simulation is important fur the analysis of a vehicle performance. Automotive powertrain has been considered as the unified system and should be remodeled, whenever a powertrain system is changed. In this study, a new method is proposed for the synthetic modeling for the automotive powertrain. Components are separated from the powertrain system and constructed the matrix through dynamic relationships. The dynamic equation of the total powertrain system can be driven from the combination of each component. In order to combine each component, the superposition method is modified for the powertrain composition.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.10a
• /
• pp.439-442
• /
• 2002

Powertrain simulation is important far the analysis of a vehicle performance. Automotive powertrain has been considered as the unified system and should be remodeled, whenever a powertrain system is changed. In this study, a new method is proposed far the synthetic modeling for the automotive powertrain. Components are separated from the powertrain system and constructed the matrix through dynamic relationships. The dynamic equation of the total powertrain system can be driven from the combination of each component. In order to combine each component, the superposition method is modified for the powertrain composition.

• Journal of IKEEE
• /
• v.22 no.3
• /
• pp.590-598
• /
• 2018

Recently, interest in IoT(Internet of Things) technology, which provides Internet services to objects, is increasing. IoT offers a variety of services in home networks, healthcare, and disaster alerts. IoT with LLN(Low Power & Lossy Networks) feature frequently loses sensor node. RPL, the standard routing protocol of IoT, performs global repair when data loss occurs in a sensor node. However, frequent loss of sensor nodes due to lower sensor nodes causes network performance degradation due to frequent full path reset. In this paper, we propose an additional selection method of the storage mode sensor node to solve the network degradation problem due to the frequent path resetting problem even after selecting the storage mode sensor node, and propose a method of equalizing the total path resetting number of each instance.

• Journal of the Korean Physical Society
• /
• v.73 no.10
• /
• pp.1589-1595
• /
• 2018

Similarity index measures the topological proximity of node pairs in a complex network. Numerous similarity indices have been defined and investigated, but the dependency of structure on the performance of similarity indices has not been sufficiently investigated. In this study, we investigated the relationship between the performance of similarity indices and structural properties of a network by employing a two-state random network. A node in a two-state network has binary types that are initially given, and a connection probability is determined from the state of the node pair. The performances of similarity indices are affected by the number of links and the ratio of intra-connections to inter-connections. Similarity indices have different characteristics depending on their type. Local indices perform well in small-size networks and do not depend on whether the structure is intra-dominant or inter-dominant. In contrast, global indices perform better in large-size networks, and some such indices do not perform well in an inter-dominant structure. We also found that link prediction performance and the performance of similarity are correlated in both model networks and empirical networks. This relationship implies that link prediction performance can be used as an approximation for the performance of the similarity index when information about node type is unavailable. This relationship may help to find the appropriate index for given networks.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2008.04a
• /
• pp.172-176
• /
• 2008

In this paper, three dimensional linear conforming variable-finite elements are presented with the aid of a smoothed integration (a class of stabilized conforming nodal integration), for mnltiscale mechanics problems. These elements meet the desirable properties of an interpolation such as the Kronecker delta condition, the partition of unity condition and the positiveness of interpolation function. The necessary condition of linear exactness is fully relaxed by employing the smoothed integration, which renders us to meet the linear exactness in a straightforward manner. This novel element description extend the category of the conventional finite elements space to ration type function space and give the flexibility on the number of nodes of element which are fixed in the conventional finite elements. Several examples are provided to show the convergence and the accuracy of the proposed elements, and to demonstrate their potential with emphasis on the multiscale mechanics problems such as global/local analysis, nonmatching contact problems, and modeling of composite material with defects.