• Journal of KIISE:Information Networking
• /
• v.35 no.1
• /
• pp.46-55
• /
• 2008

As a mobility support for IP have studied, Internet Engineering Task Force(IETF) standardized the Mobile IPv6(MIPv6) protocol. When a mobile node moves between subnets, MIPv6 maintains connectivity to network and supports seamless communication, and these processes are called a Handover. Whenever the mobile node moves between subnets, the Handover is performed. The mobile node can not communicate during the Handover. This period is Galled Handover latency. To reduce this latency, mipshop working group standardizes Fast Handovers for Mobile IPv6(FMIPv6), but latency which the mobile node registers its new care-of address to a home agent and a correspondent node is still long. To solve this problem, we propose a scheme that the mobile node registers the new care-of address to the home agent and initiates Return Routability procedure in advance during layer 2 handover, based on FMIPv6 and IEEE 802.11. We analyze MIPv6, FMIPv6 and the proposed scheme in term of packet transmission cost during the Handover. Compared to MIPv6 the proposed scheme gains 79% improvement, while it gains 31% improvement compared to FMIPv6.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.2
• /
• pp.645-655
• /
• 2008

As wireless connectivity is integrated into many handheld devices, streaming multimedia content among mobile ad-hoc peers is becoming a popular application. In this paper, we propose a dynamic service replication algorithm for providing guaranteed continuous streaming services to all nodes in mobile ad-hoc networks (MANETs). First, a MANET is comprised of logical grid hierarchy, and a streaming service is replicated to a lower server region of the logical grid hierarchy by considering the link availability between a mobile node and the streaming server within a server region or the popularity of the streaming service. We evaluate analytically the performance of the proposed algorithm, and compared with that of existing Qin's algorithm. Evaluation results show that our algorithm can achieve better streaming performance than Qin's algorithm. Therefore, the proposed algorithm not only improves the sharing availability of replicated streaming services but also controls efficiently the number of streaming service replications.

• Kyungpook Mathematical Journal
• /
• v.56 no.4
• /
• pp.1191-1205
• /
• 2016

The emergence of various Internet worms, including the stand-alone Code Red worm that caused a distributed denial of service (DDoS), has prompted many studies on their propagation speed to minimize potential damages. Many studies, however, assume the same probabilities for initially infected nodes to infect each node during their propagation, which do not reflect accurate Internet worm propagation modelling. Thus, this paper analyzes how Internet worm propagation speed varies according to the number of vulnerable hosts directly connected to infected hosts as well as the link costs between infected and vulnerable hosts. A mathematical model based on centrality theory is proposed to analyze and simulate the effects of degree centrality values and closeness centrality values representing the connectivity of nodes in a large-scale network environment on Internet worm propagation speed.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1994.04a
• /
• pp.65-72
• /
• 1994

This study presents the application of multi-level substructuring for the effective nonlinear analysis of coupled wall structures. Also, the transition elements with 8 or 12 d. o. f, 5-node plane stress elements and concrete nonlinear model are considered as the basic finite elements of substructuring. In particular, the concept of localized nonlinearity is considered for the probable nonlinear zones of the structure, and the effective bottom-up and top-down process are presented through connectivity trees. The nonlinear analysis based on localized nonlinearity and multi-level substructuring, compared with the complete nonlinear analysis of the structure, gives the greater saving effects in computational efforts and cost.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2006.06a
• /
• pp.219-222
• /
• 2006

In this paper an intrusion detection system technique of wireless Ad Hoc network is explained and the advantage of making them work in IEEE 802.15.4/ZigBee wireless standard is also discussed. The methodology that is mentioned here is intrusion detection architecture based on a local intrusion database [1]. An ad hoc network is a collection of nodes that is connected through a wireless medium forming rapidly changing topologies. Due to increased connectivity (especially on the Internet), and the vast spectrum of financial possibilities that are opening up, more and more systems are subject to attack by intruders. An ideal IDS should able to detect an anomaly caused by the intruders quickly so that the misbehaving node/nodes can be identified and appropriate actions (e.g. punish or avoid misbehaving nodes) can be taken so that further damage to the network is minimized

• Journal of information and communication convergence engineering
• /
• v.14 no.2
• /
• pp.89-96
• /
• 2016

In mobile communication, there are various types of handoff for the support of all forms of mobility. Proxy mobile IPv6 (PMIPv6) enables local network-based mobility management of a mobile node without any effect of mobility-related signaling. Recently, PMIPv6 has been considered for supporting mobility management in LTE/SAE-based mobile networks. To support seamless mobility in heterogeneous mobile networks, the overall cost of handoffs needs to be minimized and the procedure should be guaranteed to be secure. However, the reduction of the authentication cost has not been fully investigated to provide seamless connectivity when mobile users perform a handoff between the PMIPv6 domains. This paper proposes secure pre-authentication schemes, completing an authentication procedure before performing a handoff, for a fast handoff in PMIPv6. Analytic models have been used for measuring the authentication latency and for the overhead cost analysis. In addition to providing fast authentication, the proposed pre-authentication schemes can prevent threats such as replay attacks and key exposure.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.1
• /
• pp.53-60
• /
• 2000

The purpose of this paper is to propose new recovery algorithm for case of a system element raises communication obstacle due to faults in networks, Also we are simulate the algorithm using adjacency matrix. We recover one faulty node per each excution of proposed algorithm so that we can be reconstruct the faulty system gradually to communicatable network. For that, this paper propose a new recovery algorithm named MATRECO which connect the recovery process is simulated by use of adjacency matrix.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.4
• /
• pp.632-638
• /
• 2012

ZigBee network, based on PHY, MAC layer provides a specification for a suite of high level communication protocols using small, low-power digital radio based on an IEEE 802.15.4 standard. Meshing is a type of daisy chaining from one device to another. This technique allows the short range of an individual node to be expanded and multiplied, covering a much larger area. Each wireless technology that makes it to market serves a special purpose or function. Zigbee provides short-range connectivity in what is called a personal-area network (PAN). Within ZigBee PAN coordinator as manages an entire ZigBee network, the short range of frequency band was only selected because the technology allows typically less than 100 kbp or ZigBee troubles in retransmission processing and delaying data tranmission works to create unproductive condition of work. This research was proposed the method, based on short range frequency of zigBee nodes enable to long range of remote data transmission with specific algorithm tools.

• ETRI Journal
• /
• v.31 no.1
• /
• pp.31-41
• /
• 2009

Optical burst switching is a promising switching paradigm for the next IP-over-optical network backbones. However, its burst loss performance is greatly affected by burst contention. Several methods have been proposed to address this problem, some of them requiring the network to be flooded by frequent state dissemination signaling messages. In this work, we present a traffic engineering approach for path selection with the objective of minimizing contention using only topological information. The main idea is to balance the traffic across the network to reduce congestion without incurring link state dissemination protocol penalties. We propose and evaluate two path selection strategies that clearly outperform shortest path routing. The proposed path selection strategies can be used in combination with other contention resolution methods to achieve higher levels of performance and support the network reaching stability when it is pushed under stringent working conditions. Results show that the network connectivity is an important parameter to consider.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.3079-3089
• /
• 2015

In this paper, a smart constrained application protocol (CoAP)-based gateway with a border router is proposed for home safety services to remotely monitor the trespass, fire, and indoor air quality. The smart CoAP gateway controls a home safety sensor node with a pyroelectric infrared motion sensor, a fire sensor, a humidity and temperature sensor, and a non-dispersive infrared CO2 sensor and gathers sensing data from them. In addition, it can convert physical sensing data into understandable information and perform packet conversion as a border router for seamless connection between a low-power wireless personal area network (6LoWPAN) and the Internet (IPv6). Implementation and laboratory test results verify the feasibility of the smart CoAP gateway which especially can provide about 97.20% data throughput.