• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.11
• /
• pp.2039-2046
• /
• 2007

Recently, OMIPv6 series, based on public-key cryptography, have been proposed to improve RR protocol. This series no typically composed of the initial and subsequent phases. In the initial phase, the mobile node and its corresponding node build a strong long-term key, by which successive binding updates are optimized in the subsequent phase. In this paper, we compare and analyze the subsequent phases of OMIPv6 series in terms of performance, security and applicability, then presenting an improvement on the subsequent phase. Also, we show that the proposed improvement is reasonable considering performance, security and applicability overall.

• KIISE Transactions on Computing Practices
• /
• v.20 no.10
• /
• pp.543-548
• /
• 2014

Modern network has a complex structure that includes diverse and heterogeneous equipments to cope with multi-purpose functions. For proper administration of networks with complex structures, NETCONF protocol has been proposed. It still, however, has a few unresolved issues with each layer of the protocol. Tackling one of the less attended issues of NETCONF, this article suggests a technique which can efficiently update the configuration data of network equipments when multiple administrators are present. Specifically, for efficient updates of the network equipment configuration, we propose to add a pre-examination of the data dependent to algorithm in 오퍼레이션 layer and modify the data structure for managing XML documents for changing the configurations of network equipments. We have implemented and experimented with our method and confirmed that our approach brought an significant overall performance improvement to NETCONF.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3A
• /
• pp.219-224
• /
• 2008

In the c-DSDV routing protocol proposed to improve the scalability of DSDV, clusterheads manage a routing table that has only clusterheads as potential destinations and flood update request message to its neighbor clusterheads periodically or at the time of topology change. Accordingly, the convergence range of topology change by a single update request message was expanded nine times as wide as that of DSDV, increasing routing correctness; however, c-DSDV suffers from the congestion of clusterheads since data packets always go through clusterheads of the clusters on the routing path. To improve this problem, we propose an adaptive routing scheme that judges if detouring clusterhead is possible on the fly while packets are forwarded. As a result, a routing path length is shortened and an end-to-end delay is improved by the reduced queue length. It shows that the end-to-end delay is reduced by almost 40% through simulation.

• Journal of Korea Multimedia Society
• /
• v.9 no.5
• /
• pp.615-623
• /
• 2006

It has been estimated that 'RFID' technology would be playing an important role in the incoming ubiquitous environment. For this reason, many studies on 'RFID' have been conducted and its application has been on the increase in various fields such as finance, medicine, transportation and culture as well as in logistics distribution. However, the communication between Tag and Reader in RFID system has been conducted by wireless communication of radio frequency so that the information on identification could be eavesdropped by the third party maliciously. Such eavesdropped information could be also used as basic information in attacking others; in this regard, it could impair the privacy of its users and the users have avoided using 'RFID.' To solve theses problems, many studies are being performed to different output of tags by renewing ID. However, protocols have been devised without considering an ID Synchronization in the ID renewal process between database and tag in the existing studies. In this regard, this study has suggested a RFID Authentication Protocol while considering the ID Synchronization.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.1
• /
• pp.81-94
• /
• 1995

By intergrating technologies for protable computers, radio communications, and computer networking, the Land Mobile Computer Network(LMCN) is supposed to overcome the time and space limitation of present computer communication network. However, because the MHs(mobile hosts) do move any time, the network connectivity is often changed causing temporarily duplicated lost, or out-of-sequenced message delivery as well as frequent communications for maintainning the network connectivity. Previous works solved the problems through message flooding, used also in multicasting, resulting in high communication cost(i.e., number of communication messages). In this paper, new protocols for efficient mobility management and multicasting are proposed. The protocols define location update, handover, and multicasting procedure of a MH over a hierarchical LMCN architecture. The protocol specification is presented, and it is shown that the communication cost of the new protocols is superior to the existing ones in terms of the communication cost.

• The KIPS Transactions:PartA
• /
• v.13A no.5 s.102
• /
• pp.455-464
• /
• 2006

In multi-regional mobile agent computing environments, spatial replication-based approach may be used as a representative mobile agent fault-tolerance technique because it allows agent execution to make progress without blocking even in case of agent failures. However, to apply this approach to real mobile agent-based computing systems, it is essential to minimize the overhead of locating and managing mobile agents replicated on each stage. This paper presents a new mobile agent location management protocol SRLM to solve this problem. The proposed protocol allows only the primary among all the replicated workers of each stage to register with its regional server and then, significantly reduces its location updating and message delivery overheads compared with the previous protocols. Also, the protocol addresses the location management problem incurred by electing the new primary among the remaining workers at a stage in case of the primary worker's failure.

• Journal of Convergence for Information Technology
• /
• v.11 no.7
• /
• pp.21-30
• /
• 2021

With the development of IoT technology, various cloud computing-based services such as smart cars, smart healthcare, smart homes, and smart farms are expanding. With the advent of a new environment, various problems continue to occur, such as the possibility of exposure of important information such as personal information or company secrets, financial damage cases due to hacking, and human casualties due to malicious attack techniques. In this paper, we propose a message communication protocol for smart home-based secure communication and user data protection. As a detailed process, secure device registration, message authentication protocol, and renewal protocol were newly designed in the smart home environment. By referring to the security requirements related to the smart home service, the stability of the representative attack technique was verified, and as a result of performing a comparative analysis of the performance, the efficiency of about 50% in the communication aspect and 25% in the signature verification aspect was confirmed.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.235-242
• /
• 2007

Network Mobility Basic Support protocol reduces location-update signaling by making network movements transparent to the mobile nodes (MNs) behind the mobile router (MR), but causes some problems such as sub-optimal routing and multiple encapsulations. This paper proposes an Route Optimization Employing HMIP Extension for Mobile Networks (ROHMIP) scheme for nested nubile networks support which introduces HMIP concept with relation information between MNNs behind a MR and the MR in order to localize handoff, to optimize routing and especially reduce handoff signal overhead. With ROHMIP, a mobile network node (MNN) behind a MR performs route optimization with a correspondent node (CN) as the MR sends a binding update message (BU) to mobility anchor point (MAP) via root-MR on behalf of all active MNNs when the mobile network moves. This paper describes the new mechanisms and provides simulation results which indicate that our proposal reduces transmission delay, handoff latency and signaling overhead.

• The KIPS Transactions:PartC
• /
• v.17C no.1
• /
• pp.99-108
• /
• 2010

The traffic classification is a preliminary but essentialstep for stable network service provision and efficient network resource management. While various classification methods have been introduced in literature, the payload signature-based classification is accepted to give the highest performance in terms of accuracy, completeness, and practicality. However, the collection and maintenance of up-to-date signatures is very difficult and time consuming process to cope with the dynamics of Internet traffic over time. In this paper, We propose an automatic payload signature generation mechanism which reduces the time for signature generation and increases the granularity of signatures. Furthermore, We describe a signature update system to keep the latest signatures over time. By experiments with our campus network traffic we proved the feasibility of our mechanism.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.183-186
• /
• 2008

In ubiquitous GIS system, the spatial information could be updated and utilied by mobile terminals. Spatial information stored in mobile terminals should be able to synchronize to the server. However, in mobile environment, there are some limitations in synchronization service due to the limited bandwidth. The ActMAP system, that was developed to consider of mobile environment, has suggested a partial update protocal for synchronization in order to solve the narrow bandwidth problem. But it is still has a problem that it does not consider two-way synchronization between a server and a mobile terminal. This paper suggests a two-way synchronization protocol between a server and mobile terminals. It, therefore, is inclined to supporting updated and utilization of spatial information using mobile terminals.