• Journal of Information Technology Services
• /
• v.6 no.3
• /
• pp.179-193
• /
• 2007

Mobile Internet Service has been accelerated in ubiquitous computing environment. The purpose of this study is to suggest the patterns of mobile internet services based upon the current and future environments. The types of mobile internet service are explicated on the basis of current and future usage. A two-dimensional framework using level of timeliness and service purpose is utilized for classifying mobile internet service. Future trends of mobile internet service are carefully suggested.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.3
• /
• pp.231-237
• /
• 2006

Pervasive computing environment is similar to the meaning of ubiquitous computing, however it is a kind of the commercial product, which is made from the collaboration between NIST and IBM. On the basis of this environment, the research of mobile agents for intrusion detection is going on in progress. In this paper, we study the research about mobile agents for the intrusion detection and then suggest scenarios using moving mobile agents based on the multiple mobile agents in the intrusion detection. Subsequently, we could figure out the problems which occurred through progress of integrity movement as a matter of the intrusion detection.

• 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 IEEK Conference
• /
• 1998.10a
• /
• pp.491-494
• /
• 1998

This paper describes the design and implementation of file system which allows the collaborative computing in mobile environment. The design goal is to make a logically one file system in the distributed computer systems. The characteristics of frequent, foreseeable and variable disconnections in a mobile environment wrer taken into consideration. We introduce an auto-hoarding system that provides the availability of large number of nodes which are weakly and intermittently connected. The data consistency problems in distributed or replicated mobile data are also discussed.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.10
• /
• pp.4786-4793
• /
• 2012

In a recent mobile computing environment, the research for a transaction model have been actively carried out to deal with real-time transaction. However, the research for recovery model is relatively insufficient. Therefore, it would be very important for mobile recovery methods for database stability, just in case of data loss due to hand-off in mobile computing system. So, further efficient research should be keenly done to reduce I/O hand-off in mobile computing systems. SLL method increases I/O time due to sequential file. This paper have been suggested to efficient mobile recovery method in mobile computing system. Finally, it has been clearly demonstrated for system efficiency, conducting the performance assessment that currently proposed recovery system.

• Journal of Internet Computing and Services
• /
• v.9 no.3
• /
• pp.25-41
• /
• 2008

In this paper, we describes a Compact Distributed Object Group Framework(CDOGF) for mobile collaboration service in ubiquitous computing. CDOGF support network connections of sensors and devices, management of mobile computing devices, and grouping of objects for mobile collaboration service according to the logical area. For this, we defined methods for detail functions and interface. And, we classified into four interactions of that sensors and a application, the CDOGF and a application, between the components of the CDOGF, the CDOGF on a mobile device and the DOGF on a server. We also defined mobile collaboration environment by analyzing existing technologies. In this environment we used the TMO scheme for interaction and the TMOSM for distributed middleware. Finally, we implemented u-hospital application that applied this environment. This application collects environment and health information by PDAs in wards. Also, It provides the information service for patient management task.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.2 s.40
• /
• pp.131-143
• /
• 2006

The rapid growth of mobile communication technology has provided the expansion of mobile internet services, particularly mobile realtime transaction takes much weight among mobile fields. Current mobile transaction service has serious problems which check its development, such as low bandwidths, hand over, expensive charge system, and low response time. but, There is an increasing demand for various mobile applications to process transactions in a mobile computing fields. In mobile computing environments. A mobile host computing system demands for new concurrency control method to use the bandwidth efficiently, to improve the bottleneck and the response time of transactions. This study suggests about an efficient concurrency control in a mobile computing environment. Concurrency control method in existing method uses two phases locking method. In this method, Many clients can't use the same segment simultaneously, and so useless waiting time increases. The characteristic of this proposed method unlike existing one, Enable the transaction approaching different data in the same segment to minimize the useless waiting time by permitting segments, and therefore improves the coexistence of system. Also, It shows the algorithm of the proposed concurrence control method.

• Journal of Korea Multimedia Society
• /
• v.25 no.8
• /
• pp.1136-1140
• /
• 2022

This paper is a method for efficient traffic prediction in mobile edge computing, where many studies have recently been conducted. For distributed processing in mobile edge computing, tasks offloading from each mobile edge must be processed within the limited computing power of the edge. As a result, in the mobile nodes, it is necessary to efficiently select the surrounding edge server in consideration of performance dynamically. This paper aims to suggest the efficient clustering method by selecting edges in a cloud environment and predicting mobile traffic. Then, our dynamic clustering method is to reduce offloading overload to the edge server when offloading required by mobile terminals affects the performance of the edge server compared with the existing offloading schemes.

• Journal of Internet Computing and Services
• /
• v.5 no.1
• /
• pp.25-32
• /
• 2004

Mobile computing environment makes it possible for computing activities to be maintained during movement even if a user changes its network point of attachment. Mobile IP is a standard protocol designed to be used in such mobile computing environment. However, Mobile IP has a drawback to incur a lot of handoff delays and waste network resources, since CoA(Care of Address) registration packets need to go through a HA(Home Agent) first whenever a mobile node moves. To solve this long-standing problem, this paper proposes a new scheme that, for infra-domain movement, efficiently performs local handoff without notifying the HA Specifically, based on the notion of load balance, the proposed scheme allows every FA(Foreign Agent) in a domain to become the root FA(also known as domain FA) dynamically, thus distributing the registration task into many other foreign agents. The dynamic root assignment through load balancing ultimately leads to fast network response due to less frequent transmission of registration packets.

• 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.