• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.343-354
• /
• 2003

This paper describes algorithm that minimizes recovery time of packet loss resulting from handoff in multicast environments and guarantees reliability through interaction of FN(Foreign Network) with PMTP(Predictable Multicast Tree Protocol). To solve the problems that inefficient routing and handoff delay taking plate when using hi-directional tunneling and remote subscription independently in multicast environments, proposed algorithm uses tunneling and rejoining multicast group according to the status of an arriving FA in a foreign network. Furthermore, proposed algorithm sends packet loss information and register message to previous FA or current FA at the same time. so, MH is able to recovery packet loss in handoff delay as soon as possible. As a result of performance analysis, proposed algorithm is more efficient than previous researches and is applicable to existing handoff method without requiring additional procedures.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.11
• /
• pp.495-502
• /
• 2013

In this paper, we present an anonymous authentication and location assurance protocol for secure location-aware services over vehicular ad hoc networks (VANETs). In other to achieve our goal, we propose the notion of a location-aware signing key so as to strongly bind geographic location information to cryptographic function while providing conditional privacy preservation which is a desirable property for secure vehicular communications. Furthermore, the proposed protocol provides an efficient procedure based on hash chain technique for revocation checking to effectively alleviate communication and computational costs on vehicles in VANETs. Finally, we demonstrate comprehensive analysis to confirm the fulfillment of the security objectives, and the efficiency and effectiveness of the proposed protocol.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.11
• /
• pp.377-386
• /
• 2020

Mobile cloud computing involves mobile or embedded devices as clients, and features small devices with constrained resource and low availability. Due to the fast expansion of smart phones and smart peripheral devices, researches on mobile cloud computing attract academia's interest more than ever. Computation offloading, or code offloading, enhances the performance of computation by migrating a part of computation of a mobile system to nearby cloud servers with more computational resources through wired or wireless networks. Code offloading is considered as one of the best approaches overcoming the limited resources of mobile systems. In this paper, we analyze the factors and the performance of code offloading, especially focusing on static program partitioning and data protection. We survey state-of-the-art researches on analyzed topics. We also describe directions for future research.

• The KIPS Transactions:PartD
• /
• v.13D no.5 s.108
• /
• pp.725-730
• /
• 2006

Recently Web services have become a key technology which is indispensable for e-business. Due to its ability to provide the desired information or service regardless of time and place, integrating current application systems within a single business or between multiple businesses with standardized technologies are realized using the open network and Internet. However, the current Web Services Retrieval Systems, based on text oriented search are incapable of providing reliable search results by perceiving the similarity or interrelation between the various terms. Currently there are no web services retrieval models containing such semantic web functions. This research work is purported for solving such problems by designing and implementing an extended Semantic Web Services Retrieval Model that is capable of searching for general web documents, UDDI and semantic web documents. Execution result is proposed in this paper and its efficiency and accuracy are verified through it.

• The KIPS Transactions:PartA
• /
• v.12A no.4 s.94
• /
• pp.273-280
• /
• 2005

The mobility or highly interconnected and communicating devices and users has implications for the QoS in a ubiquitous computing environment. Therefore, it is important for location aware systems to detect location of mobile object correctly and Provide high quality services in ubiquitous environment. However, it is not easy that location aware systems offer highly reliable QoS to users because process strategies of location aware systems are limited by the capability according to the applied detection target objects. In this paper, we design an autonomic architecture which analyzes the location aware system condition and autonomously chooses the best appropriate process strategy. We also have simulated the Proposed architecture in order to verify its performance. The test results show us that the architecture using self-optimizing mechanism provides higher QoS to users in variable bandwidth.

• The KIPS Transactions:PartC
• /
• v.9C no.2
• /
• pp.197-212
• /
• 2002

Transmission Control Protocol (TCP) [1] has been tuned as a reliable transfer protocol for traditional networks comprising wired links and stationary hosts with same link characteristics. TCP assumes that congestion in the network be a primary cause for packet losses and unusual delays. TCP performs welt over such networks adapting to end-to-end delays and congestion losses, by standard congestion control mechanisms, such as slow-start, congestion avoidance, fast retransmit and recovery. However, networks with wireless and other lossy links suffer from significant losses due to bit errors and handoffs. An asymmetry network such as ADSL has different bandwidth for both directions. As a result, TCP's standard mechanisms incur end-to-end performance degradation in various links. In this paper, we analyze the TCP problems in wireless, satellite, and asymmetry links, and measure the new TCP mechanisms that are recommended by IETF Performance Implications of Link Characteristics (PILC) WG[2], by using Network Simulator 2 (NS-2).

• Proceedings of the Korea Water Resources Association Conference
• /
• 2012.05a
• /
• pp.479-483
• /
• 2012

최근 국내외에서 기상이변에 따른 물 부족에 대응하고 먹는 물의 생산과 공급 효율성 향상을 위하여 스마트워터그리드에 대한 연구가 활발히 진행되고 있는 경향으로 이는 상수도 인프라시설의 운영오류, 자연재해, 사이버를 통한 의도적 공격 등에 대해 안전하고 신뢰성이 높은 시스템을 구축하기 위한 것이다. 또한 상수도 분야에서는 스마트 미터링 개념을 도입하여 상수관망에서 발생되는 각종 사고나 물 손실을 저감하기 위한 노력이 시도되고 있는 실정이다. 일반적으로 누수량이 많을 경우에는 누수의 징후가 지표면에서 확인이 가능하나 미세한 경우 탐사장비의 운영이나 인력의 투입을 통해 가능하다. 물 공급계통인 상수관망에서 물 손실을 저감시키기 위한 방법중 하나로서 수도미터로부터 기록되는 물 사용량 데이터를 이용하여 누수패턴을 추출함으로써 누수감시가 가능하도록 하는 모형을 개발하고자 하였다. 이는 탐사장비에 의한 누수감지와 상호 보완적을 활용할 수 있는 것으로서 사용량 자료를 분석하여 사전에 처리된 자료의 노이즈와 결함 있는 계측값을 필터링시키는 기법이 도입된 것이며 신속한 감지를 통해 누수 지속시간을 감소시킴으로서 누수량의 저감을 목표로 한다. 물 공급 네트워크를 보다 더 효율적 만들 수 있는 누수 감시모형은 상수관망의 운영에 필요한 정보를 도출하기 위하여 보다 정확하고 다양한 수학적 및 통계적 분석을 기반으로 구성되어 누수 외에도 각종 결함을 찾아내는 역할을 수행할 수 있다. 향후 다양한 지역을 이러한 수용가의 물 사용량 미터링 결과를 토대로 실제 사용량과 누수량을 분리하여 분석함으로써 국내 실정에 적합한 누수감시 기술배발 토대를 마련할 수 있을 것으로 판단되며, 누수저감을 위한 실질적인 상수관망의 운영관리 효율향상의 정보로서 활용이 가능할 것으로 판단된다.

• Journal of the Korean Society for Library and Information Science
• /
• v.43 no.3
• /
• pp.59-84
• /
• 2009

In the context of the knowledge and information society, social capital has been considered significantly in conjunction with human and physical capital. Social capital contains the social capacity which is beneficial to the efficiency and associated capital of social policies. This study aims to examine the strategic plans in order to establish researcher information systems in terms of research and development, and researcher resources at the national level. To achieve the goals of this study, firstly the current status of researcher information systems in Korea was examined. The analysis of researcher information systems includes information systems in the national R&D management institutes, the national distribution institutes, and the government funded research centers. Secondly, strategic plans for researcher information systems as social capital were discussed.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.411-413
• /
• 2010

Now, smart phone markets are grows quickly. So it is needed research of CDN(Contents Delivery Network) technology for contents transmission in mobile networks. Especially the services of smart phone are focused on open platform model. So P2P(Peer to Peer) protocols will be used for mobile network because it is a distributed network architecture composed of participants that make a portion of their resources directly available to other network participants, without the need for a central server. Current research of P2P protocols for mobile network are not activated. The reason is appropriate in the mobile P2P network simulation environment, since it is not provided. So, in this paper we design a mobile P2P simulation system for CDN based on mobile P2P.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.27 no.1
• /
• pp.7-14
• /
• 2017

Theoretically, it is known that common beliefs and/or common knowledge cannot be attained in asynchronously distributed multiagent environments, however, it show that some propositions with deadlines can be attained as common beliefs among a set of fully trusted agents even when they communicate to each other asynchronously. Generally, in the multiagent environment, the attainment of common beliefs is approached as a problem of communication, and for the common beliefs paradox that the common beliefs is not attained on a system without communication time restriction is applied to loose coarser granularity and it prove that forming common beliefs is possible by relaxing necessary requirements through the KakaoTalk chatting model. I also experimented with the reasoning function that confirms the common beliefs by inquiring about the common belief generated by implementing the inference function in each agent of the KakaoTalk chatting model. Through utilizing metalogic programming, a formalization of the presentation and reasoning of common beliefs has been achieved, and the group chatting model of KakaoTalk was adopted in experiments to show that common beliefs can be formed among distributed agents using asynchronous communication.