• The KIPS Transactions:PartA
• /
• v.11A no.6
• /
• pp.439-450
• /
• 2004

Mobile agents are autonomous and dynamic entities that can migrate among various nodes in the network. Java's Jini framework facilitates mobile agent system development, providing hey features for distributed network programming. However, due to the security weakness, Jinil.0 service has a fundamental limitation on developing mobile agent systems which support secure remote communications. In this paper, we describe a Jini2.0-based secure mobile agent system named SecureJMoblet. On the top of Jini2.0, the system provides basic functionalities of a mobile agent system such as creation, transfer and control. In addition, with the SeureJS developed for secure JavaSpace service, SecureJMoblet supports a secure object repository and a reliable communication among mobile agents.

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.2771-2773
• /
• 2005

In network human-robot interaction, human can access services of a robot system through the network The communication is done by interacting with the distributed sensors via voice, gestures or by using user network access device such as computer, PDA. The service organization and exploration is very important for this distributed system. In this paper we propose a new agent-based framework to integrate partners of this distributed system together and help users to explore the service effectively without complicated configuration. Our system consists of several robots. users and distributed sensors. These partners are connected in a decentralized but centralized control system using agent-based technology. Several experiments are conducted successfully using our framework The experiments show that this framework is good in term of increasing the availability of the system, reducing the time users and robots needs to connect to the network at the same time. The framework also provides some coordination methods for the human robot interaction system.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.1-10
• /
• 1999

A mobile computing environment is one that support user's mobility through the wireless communication technology. Users access the database and get results what they want by running mobile transactions. To run the mobile transaction correctly and to maintain the consistency I database, we need a concurrency control method to schedule transactions, a caching method to manage the cache, and a recovery method to construct a fault tolerant system. A mobile computing system is based on the existing distributed system, but we can't use recovery methods of the existing distributed system directly because of the user's mobility and the features of wireless media. So this paper presents a recovery mechanism to construct a fault tolerant mobile computing systems. Especially. we develop and analyze a recovery algorithm for server failure among types of failure which can arise in mobile computing environments.

• International Journal of Contents
• /
• v.2 no.4
• /
• pp.25-30
• /
• 2006

The mutual exclusion (MX) paradigm can be used as a building block in many practical problems such as group communication, atomic commitment and replicated data management where the exclusive use of an object might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need a mutual exclusion protocol. However, despite its usefulness, to our knowledge there is no work that has been devoted to this problem in a mobile computing environment. In this paper, we describe a solution to the mutual exclusion problem from mobile computing systems. This solution is based on the token-based mutual exclusion algorithm.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.378-380
• /
• 2009

For the autonomous movement, the optimal pat]1 planning connecting between current and target positions is essential, and the optimal path of mobile robot means obstacle-free and the shortest length path to a target position. Many actual mobile robots should move without any information of surrounded obstacles. This paper suggests a new method of obstacle avoidment which is suitable in unknown environments. This method of obstacle avoidance is designed with a distributed fuzzy control system, and imitates a Potential Field method. A simulation confirms the performance and correctness of the obstacle avoidance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.7
• /
• pp.656-665
• /
• 1992

In this paper, the performance of the various multiple access techniques for the mobile computer network has been studiedi in the consideration of the charactersitics of the mobile cimmunication channel. In the case of the hidden node occurring. It could be seen that the performance of the code division multiple access (CDMA) technique with simultaneous access function is better than that of the other packet access methods such as carrier sendsed multiple access (CDMA), busy tone multiple access (BTMA) and idle signal multiple access (ISMA) in the view of the throughput and mean delay time. Also, it has been shown that the performance of the CDMA method is superior to that of other packet access techniques such as multiple access (CSMA), etc. when the fading effect or impulsive noise exists in the mobile channel, Especially, in the case of the distributed mobile network it has been shown that the receivertransmitter based CDMA method using the characteristics of CDMA effectively has better throughput and less mean delay time than the commontransmitter based CDMA technique.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.4
• /
• pp.75-81
• /
• 2010

Due to the increasing use of smart phones, using Wifi, Wibro of mobile devices spread. Accordingly, Need of using peer-to-peer file sharing between mobile devices is growing. However, common Peer-to-Peer(P2P) system is too complex and is not suitable to be applied to mobile devices. Thus, the need of research has shown to improve way in a mobile environment that has a constraints as mobility and the scope of communication. Among them, there is a Chord as contents look up algorithm. Chord is the issue. Chord as the DHT-based P2P protocol shares files, index-key and distributed key across the network. However, exist Chord doesn't consider the mobility. So, It has a lot of problems in the mobile environment. Thus, in this paper, I will try to explore an appropriate way of Chord in a mobile environment.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.88.1-88
• /
• 2001

The paper describes a new approach to the organization of an artificial brain for mobile multi-robot systems, where individual robots are not considered as independent entities, but rather forming together a universal parallel and distributed machine capable of processing both information and physical matter in distributed worlds. This spatial machine, operating without any central control, is driven on top by distributed mission scenarios in WAVE-WP language. The scenarios can be written on a variety of levels, and any mixture of them, supporting the needed system flexibility and freedom ...

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.10a
• /
• pp.368-371
• /
• 2000

The distributed object computing is possible to distributed computing on same or heterogeneous machine environment with growth of distributed computing and object-oriented technology. The typical of model, CORBA is int solved the interoperability in heterogeneous machine environment over the network But, the CORBA has a problem that the server is can't rely on request of client occurs network overhead by extinction of network A plan was on the rise to solve the problem that is combination of mobile agent and distributed computing technology.

• The Journal of the Korea Contents Association
• /
• v.6 no.12
• /
• pp.50-58
• /
• 2006

The mutual exclusion (MX) paradigm can be used as a building block in many practical problems such as group communication, atomic commitment and replicated data management where the exclusive use of an object might be useful. The problem has been widely studied in the research community since one reason for this wide interest is that many distributed protocols need a mutual exclusion protocol. However, despite its usefulness, to our knowledge there is no work that has been devoted to this problem in a mobile computing environment. In this paper, we describe a solution to the mutual exclusion problem from mobile computing systems. This solution is based on the token-based mutual exclusion algorithm.