• Annual Conference of KIPS
• /
• 2001.10a
• /
• pp.125-128
• /
• 2001

이동 통신 기술의 발전은 사용자로 하여금 이동 중에도 정보를 공유할 수 있는 토대를 제공하였다. 하지만, 이동 컴퓨팅 환경에서 기존의 유선 환경에서와 같은 수준의 서비스를 제공하기 위해서는 이질적이며 분산되어 있는 다수의 정보 자원을 사용할 수 있어야 한다. 따라서, 고정된 네트워크 상의 상호 이질적인 데이터베이스에 접근하여 이동 컴퓨팅 환경의 특성에 맞게 정보를 효과적으로 처리할 수 있는 트랜잭션 모델 및 표준화된 아키텍쳐에 관한 연구가 필요하다. 본 연구에서는 표준 미들웨어에 기반 하여 위와 같은 요구사항을 만족시키는 이동 트랜잭션 모델을 제시하였다.

• MALSORI
• /
• no.60
• /
• pp.181-190
• /
• 2006

This paper describes a speech enhancement scheme that leads to significant improvements in recognition performance when used in the ASR front-end. The proposed approach is based on adaptive comb filtering and an MMSE-related parameter estimator. While adaptive comb filtering reduces noise components remarkably, it is rarely effective in reducing non-stationary noises. Furthermore, due to the uniformly distributed frequency response of the comb-filter, it can cause serious distortion to clean speech signals. This paper proposes an improved comb-filter that adjusts its spectral magnitude to the original speech, based on the speech absence probability and the gain modification function. In addition, we introduce the modified comb filtering-based speech enhancement scheme for ASR in mobile environments. Evaluation experiments carried out using the Aurora 2 database demonstrate that the proposed method outperforms conventional adaptive comb filtering techniques in both clean and noisy environments.

• Annual Conference of KIPS
• /
• 2007.11a
• /
• pp.932-935
• /
• 2007

모바일 기기 사용이 급증함에 따라 모바일환경에서 이루어지는 P2P방식 연구가 활발히 진행되고 있다. 본 논문에서는 기존의 모바일환경에서의 P2P방식이 지닌 peer들 사이의 multi-broadcasting 방식의 문제점을 보완하고, 새로운 routing table을 구축하기 위해 peer들을 2개의 계층으로 구분하였다. 즉, peer들을 super peer들과 각 super peer에 의해 관리되는 sub peer들로 구분하였다. 파일의 탐색과 전송은 super peer들이 관리하므로, 기존의 불필요한 multi-broadcasting 방식을 피할 수 있다. 본 논문에서는 분산 네트워크를 위한 peer의 계층화 작업을 설계하였다. MIS(Maximal Independent Set)알고리즘을 이용하여 peer들의 계층화 작업을 외부의 도움 없이 peer들간의 통신으로 할 수 있게 만들었다. 이처럼 peer들을 super peer와 sub peer로 구분하면 불필요한 broadcasting을 피할 수 있어 시스템 성능이 향상되며, 이를 실험을 통하여 증명하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.550-554
• /
• 2002

In this paper, we design the CORBA-based Mobile-Agent Model (CMAM) which has the capability of the efficient work processing in distributed environment through sensing network traffic and searching the optimal path for migration nodes of mobile agent. In case existing mobile agent model is given various works from user, the network overhead and traffic are increased by increasing of execution module size. Also, if it happens a large quantity of traffics due to migration of nodes according to appointment of the passive host(node) muting schedule by user, it needs much cost for node search time by traffic. Therefore, in this paper, we design a new mobile agent model that assures the reliability of agent's migration through dynamic act on the specific situation according to appointment of the active routing schedule and can minimize agent's work processing time through optimal path search. The proposed model assigns routing schedule of the migration nodes actively using an extended MAFFinder. Also, for decreasing overhead of network by agent's size, it separated by mobile agent including oかy agent calling module and push agent with work executing module based on distributed object type of CORBA. Also, it can reduce the required time for round works of mobile agent through the optimal path search of migration nodes.

• Journal of KIISE:Software and Applications
• /
• v.26 no.8
• /
• pp.974-987
• /
• 1999

이동 컴퓨팅 환경에서 자주 접근하는 데이터에 대한 캐싱은 무선 채널의 좁은 대역폭에서 경쟁을 줄일 수 있는 유용한 기술이다. 그러나, 트랜잭션 캐시 일관성을 지원하는 전통적인 클라이언트/서버 전략은 클라이언트와 서버간에 많은 양의 통신을 필요로 하기 때문에 이동 클라이언트/서버 컴퓨팅 환경에서는 적절하지 않다. 본 논문에서는 브로드캐스트-기반 캐시 무효화 정책을 사용하면서 트랜잭션 캐시 일관성을 지원하는 OCC-UTS (Optimistic Concurrency Control with Update TimeStamp) 프로토콜을 제안한다. 접근한 데이터에 대한 일관성 검사 및 완료 프로토콜은 캐시 무효화 과정의 내부 과정으로 완전 분산 형태로 효율적으로 구현되며, 일관성 체크의 대부분이 이동 클라이언트에서 수행된다. 또한, 분석 모델에 기반한 성능 비교를 통해, 본 논문에서 제안하는 OCC-UTS 프로토콜이 다른 경쟁 프로토콜보다 높은 트랜잭션 처리율을 얻으며, 데이터 항목을 자주 접근하면 할수록 지역 캐시를 사용하는 OCC-UTS 프로토콜이 더 효율적임을 보인다. 이동 클라이언트의 접속 단절에 대해서는 무효화 브로드캐스트 윈도우를 크게 하여 접속 단절에 적절히 대처할 수 있다.Abstract In a mobile computing environment, caching of frequently accessed data has been shown to be a useful technique for reducing contention on the narrow bandwidth of the wireless channels. However, the traditional client/server strategies for supporting transactional cache consistency that require extensive communications between a client and a server are not appropriate in a mobile client/server computing environment. In this paper, we propose a new protocol, called OCC-UTS (Optimisitic Concurrency Control with Update TimeStamp), to support transactional cache consistency in a mobile client/server computing environment by utilizing the broadcast-based solutions for the problem of invalidating caches. The consistency check on accessed data and the commitment protocol are implemented in a truly distributed fashion as an integral part of cache invalidation process, with most burden of consistency check being downloaded to mobile clients. Also, our experiments based on an analytical model substantiate the basic idea and study the performance characteristics. Experimental results show that OCC-UTS protocol without local cache outperforms other competitor protocol, and the more frequent a mobile client accesses data items the more efficient OCC-UTS protocol with local cache is. With respect to disconnection, the tolerance to disconnection is improved if the invalidation broadcast window size is extended.

• The KIPS Transactions:PartB
• /
• v.8B no.6
• /
• pp.641-650
• /
• 2001

Jini architecture's Network Plug and Work provides simple and flexible network environment for distributed applications. Through the Jini technology, facilities for dynamically registering and locating mobile agent services can be easily supported, as well as the services useful for activities of mobile agents can be dynamically supported. In this paper, we describe a Jini-based mobile agent system named JMoblet, which provides the basic functions of a mobile agent system such as creation, control, transfer, location and communication among agents. To increase the reliability of the system, it also provides exception handling and persistence of the mobile agent systems for reliability.

• 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 Korea Academia-Industrial cooperation Society
• /
• v.15 no.7
• /
• pp.4554-4561
• /
• 2014

In recent years, several paradigms have been identified to simplify the design of fault-tolerant distributed applications in a conventional static system. Leader Election is among the most noticeable, particularly because it is closely related to group communication, which provides a powerful basis for implementing active replications among other uses. On the other hand, despite its usefulness, to our knowledge, no study has focused on this problem in a mobile computing environment. The aim of this paper was to propose an algorithm for the leader election protocol in a fixed station based wireless networks environment. The election algorithm is much more efficient than other election algorithms in terms of the fault tolerance.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.6 no.3
• /
• pp.264-269
• /
• 2006

This paper presents the strategy for searching a hidden object in an unknown area for using by multiple distributed autonomous robotic systems (DARS). To search the target in Markovian space, DARS should recognize th ε ir surrounding at where they are located and generate some rules to act upon by themselves. First of all, DARS obtain 6-distances from itself to environment by infrared sensor which are hexagonally allocated around itself. Second, it calculates 6-areas with those distances then take an action, i.e., turn and move toward where the widest space will be guaranteed. After the action is taken, the value of Q will be updated by relative formula at the state. We set up an experimental environment with five small mobile robots, obstacles, and a target object, and tried to research for a target object while navigating in a un known hallway where some obstacles were placed. In the end of this paper, we present the results of three algorithms - a random search, an area-based action making process to determine the next action of the robot and hexagon-based Q-learning to enhance the area-based action making process.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.5
• /
• pp.93-101
• /
• 2010

Although various network management architectures such as centralized, distributed, and hybrid have been presented, any one is not always efficient in all the environment. In this paper, we propose a hierarchical and split network management architecture based on MA+SNMP in order to manage a network of many small NEs distributed over the wide area. Our hierarchical architecture has MA-based proxy management nodes for the flexibility and overhead reduction in NMS as well as SNMP-based NEs considering NE's capacity. Through the analysis with real experiments, we show that our proposal improves some drawbacks and the processing delay of the existing architectures in the given environment.