• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.1
• /
• pp.75-88
• /
• 2004

Condor is a distributed batch system for sharing the workload among the computers connected by a network. Condor distributed system was developed on the basis that every machine in a Condor pool is always connected by a network to run a Condor Job. Due to advances in wireless communication and mobile computing technology, conventional distributed computer systems can now include “mobile” clients as well as “fixed” clients. Moreover, mobile users want to lower their power consumption by off-loading potentially power and resource consuming jobs. In this paper, we describe the design and implementation of mobile interface for mobile clients in Condor distributed batch system. The main purpose of this work is to enable users on mobile computers to interact with Condor environment any time anywhere regardless of their connection to a Condor pool. The mobile Condor distributed system also aims to provide mobile users the same Condor services without making any significant changes to the existing Condor system.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.10a
• /
• pp.193-196
• /
• 1997

A mobile computing environment has many difference in character from conventional communication over wired network. These include very presents distributed design system based the mobile agent for mobile computing environment. To integrate design resource, we presented ISA(Integration Service Agent, which allows a designer to build integrated application using distributed resources, and to collaborative by exchanging service. Also we propose ICM(XML based Intelligent Connection Manger) using mobile agent. And suggested new intelligent data and process transfer architecture using ICM to implement an agent based design system in mobile environment.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.4 no.1
• /
• pp.29-33
• /
• 2004

I propose a personalized digital library system (PDLS) based on an advanced distributed agent platform. The new platform is developed by improving the DECAF (Distributed Environment-Centered Agent Framework) which is one of the conventional distributed agent development toolkits. Also, a mobile ORB (Object Request Broker), Voyager, and a new multi agent negotiation algorithm are adopted to develop the advanced platform. The new platform is for mobile multi agents as well as the distributed environment, whereas the DECAF is for the distributed and non-mobile environment. From the results of the simulation the searched time of PDLS is lower, as the numbers of servers and agents are increased. And the user satisfaction is four times greater than the conventional client-server model. Therefore, the new platform has some optimality and higher performance in the distributed mobile environment.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.10
• /
• pp.1206-1216
• /
• 1999

이동 호스트란 시간과 공간의 제약 없이 필요한 기능을 수행하고, 또한 원하는 정보에 접근할 수 있는 휴대용 컴퓨터를 일컫는다. 이동 컴퓨팅 환경이란 이러한 이동 호스트들을 지원할 수 있도록 구성된 분산 환경이다. 따라서 이동 컴퓨팅 환경에서의 분산 알고리즘은 정적 호스트만을 고려한 기존의 분산 환경에서와는 다르게 이동 호스트의 여러 가지 특성들을 고려하여 제안되어야 한다. 즉, 이동 컴퓨팅 환경의 도래로 인하여 이동성과 휴대성, 그리고 무선 통신과 같은 특성들을 고려한 새로운 분산 상호 배제 알고리즘이 필요하다. 이제까지 이동 컴퓨팅 환경에서의 상호 배제 알고리즘은 토큰 링 구조에 기반을 두고 설계되었다. 토큰 링 구조는 이동 호스트들의 위치를 유지하기 위하여 높은 비용을 필요로 하는 단점을 가지고 있다. 본 논문에서는 균형 높이 트리(height-balanced tree)라는 새로운 모형을 제안함으로써 정적 분산 환경과 이동 분산 환경이 혼합된 환경에서 상호 배제 비용을 감소시킬 수 있는 새로운 알고리즘을 제안하며, 각 경우에 있어서의 비용을 산출하고 평가한다.Abstract The mobile host is a potable computer that carries out necessary functions and has the ability to access desirable informations without any constraints in time and space. Mobile computing environment is a distributed environment that is organized to support such mobile hosts. In that environment, distributed algorithms of which environment not only with static hosts but with mobile host's several properties should be proposed. With the emergence of mobile computing environments, a new distributed mutual exclusion method should be required to consider properties mobile computing system such as mobility, portability, and wireless communication. Until now, distributed mutual exclusion methods for mobile computing environments are designed based on a token ring structure, which have the drawbacks of requiring high costs in order to locate mobile hosts. In this paper, we propose a distributed mutual exclusion method that can reduce such costs by structuring the entire system as a height-balanced tree for static distributed networks and for networks with mobile hosts. We evaluated the operation costs in each case.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.166-168
• /
• 2006

IP 주소 공유 기술인 FSL3/4는 IP 패킷의 헤더나 페이로드의 수정없이 단지 패킷 헤더 참조에 의해 로컬 네트워크의 호스트들에게 인터넷 풀 액세스 및 종단간 IPSEC 세션을 지원한다. 그러나 FSL3/4는 사용자 인터페이스를 제공하지 않으며 커널에 적재할 수 있는 모듈의 형태로만 존재하기 때문에 사용자 접근이 용이하지 않고, 추가적인 기능을 위해서는 커널 소스를 직접 수정해야 하는 불편함이 있다. 본 논문에서는 이런 문제점을 보완하고 FSL3/4 기능 확장을 립게 하는 Netfilter를 설계하고 구현하였다.

• Journal of Digital Contents Society
• /
• v.11 no.4
• /
• pp.453-461
• /
• 2010

Specifying and designing the election algorithm in mobile ad hoc distributed systems is very difficult task. It is because mobile ad hoc systems are more prone to failures than conventional distributed systems. The aim of this paper is to propose a specification and design of the election algorithm in a specific ad hoc mobile computing environment. For this aim, we specify and design an election algorithm in this paper. In addition, we formally verify it and show that it is correct. This solution is based on the nodes detection algorithm that is a classical one for synchronous distributed systems.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.8
• /
• pp.41-48
• /
• 2016

In this paper, we propose an election protocol based on mobile ad-hoc network. In distributed systems, a group of computer should continue to do cooperation in order to finish some jobs. In such a system, an election protocol is especially practical and important elements to provide processes in a group with a consistent common knowledge about the membership of the group. Whenever a membership change occurs, processes should agree on which of them should do to accomplish an unfinished job or begins a new job. The problem of electing a leader is very same with the agreeing common predicate in a distributed system such as the consensus problem. Based on the termination detection protocol that is traditional one in asynchronous distributed systems, we present the new election protocol in distributed systems that are based on MANET, i.e. mobile ad hoc network.

• International Journal of Contents
• /
• v.2 no.2
• /
• pp.29-31
• /
• 2006

Mobile Ad hoc network is a self configuring network of mobile nodes. It allows mobile nodes to configure network spontaneously and share their services. In these networks, service discovery is very important because all nodes do not have same resources in term of memory and computing power. Nodes need to use different services offered by different servers. Some service discovery protocols have been proposed in last couple of years but they include significant traffic overhead and for small scale MANETS. In this paper, we present extensible lookup service scheme based on distributed mechanism. In our scheme neighboring nodes of service provider monitor service provider and send notification to lookup server when the service provider terminates its services unexpectedly. Lookup server can find other service provider or other alternative services in advance because of advance notification method and can provide consistent lookup services. In our scheme neighboring nodes also monitor lookup server and send notification to network when lookup server terminates unexpectedly. Simulation results show that our scheme can reduce up to 70% and 30% lookup failure as compare to centralize and simple distributed mechanism respectively.

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.815-820
• /
• 2001

This paper presents a distributed mobile architecture aimed to support the mobility of mobile station. The proposed architecture considers three significant objects；mobile station (MS), mobile agent (MA) which logically represents mobile station in the wireline network, and trace agent (TA) to represent application server (AS) providing application service to mobile station. The mobile agent is made closely coupled with the mobile station while the trace agent is made closely coupled with the application server. During the handoff process, a flow control mechanism is considered to correct packet loss and out-of-sequence packets problem. The result of analytic additional time delay due to handoff processing is presented and simulation was performed to check the additional time delay as well as the correctness of handoff algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.914-934
• /
• 2016

In the mobile distributed environment, an entity may move across domains with great frequency. How to utilize the trust information in the previous domains and quickly establish trust relationships with others in the current domain remains a challenging issue. The classic trust models do not support cross-domain and the existing cross-domain trust models are not in a fully distributed way. This paper improves the outstanding Certified Reputation (CR) model and proposes a Lightweight Cross-domain Trust (LCT) model for the mobile distributed environment in a fully distributed way. The trust certifications, in which the trust ratings contain various trust aspects with different interest preference weights, are collected and provided by the trustees. Furthermore, three factors are comprehensively considered to ease the issue of collusion attacks and make the trust certifications more accurate. Finally, a cross-domain scenario is deployed and implemented, and the comprehensive experiments and analysis are conducted. The results demonstrate that our LCT model obviously outperforms the Bayesian Network (BN) model and the CR model in our cross-domain scenario, and significantly improves the successful interaction rates of the honest entities without increasing the risks of interacting with the malicious entities.