• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9A
• /
• pp.758-766
• /
• 2011

Cooperative communications are adopted as a promising solution to achieve high data rate over large areas in the future 40 wireless system and the relay station (RS) is the key concept in cooperative communications. However, most existing works in this area focus only on optimal RS selections. In addition, there are only few works consider another crucial issue: how many relay stations we need to place. Only when the number of relay stations is defined, the relay station selection can be performed well. In this paper we derive a formula which describes the impact of varying number of RS on end-to-end link throughput assuming a clustering scheme which is based on Voronoi tessellation. In addition to mathematical analysis on the feasibility of the formula, we also examine its performance through a set of simulations under the Erceg path loss model. Simulation results verify that the link throughput gain of our proposed scheme is promising.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.2
• /
• pp.51-57
• /
• 2009

Ubiquitous sensor network is the communication environment where sensor nodes move freely and construct network to get the services from the system. So, it does not need fixed infrastructure and can easily be placed in unaccessible regions like war or calamity area. Wireless sensor network protocol has self-organizing capability, need to adapt topology change flexibly and also has technique that sensor nodes work cooperatively, because network disconnection is frequently occurred due to the active mobility of sensor nodes. In this paper, we design a cluster based fault-tolerant routing protocol for the efficient topology construction and to guarantee stable data transmission in USN. The performance of the proposed protocol is evaluated by an analytic model.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.3
• /
• pp.203-216
• /
• 2003

In this paper a new feature extraction and target classification method is proposed for the recognition part of FLIR(Forwar Looking Infrared)-image-based ATR system. Proposed feature extraction method is "cluster(=set of classes)-based"version of previous fisherfaces method that is known by its robustness to illumination changes in face recognition. Expecially introduced class clustering and cluster-based projection method maximizes the performance of fisherfaces method. Proposed target image classification method is based on the mixture of experts model which consists of RBF-type experts and MLP-type gating networks. Mixture of experts model is well-suited with ATR system because it should recognizee various targets in complexed feature space by variously mixed conditions. In proposed classification method, one expert takes charge of one cluster and the separated structure with experts reduces the complexity of feature space and achieves more accurate local discrimination between classes. Proposed feature extraction and classification method showed distinguished performances in recognition test with customized. FLIR-vehicle-image database. Expecially robustness to pixelwise sensor noise and un-wanted intensity variations was verified by simulation.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.14 no.5
• /
• pp.880-887
• /
• 2011

The Wireless Mesh Network(WMN) technology is able to provide an infrastructure for isolated islands, in which it is difficult to install cables or wide area such as battlefield. Therefore, WMN is frequently used to satisfy needs for internet connection and active studies and research on them are in progress. However, as a result of increase in number of hops under hop-by-hop communication environment has caused a significant decrease in throughput and an increase in delay. Considering the heavy traffic of real-time data, such as voice or moving pictures to adaptive WMN, in a military environment. Such phenomenon might cause an issue in fairness index. In order to resolve this issue, we proposed a Cluster Based Multi-channel Assignment Scheme(CB-MAS) for adaptive tactical wireless mesh network. In the CB-MAS, the communication between the Cluster-Head(CH) and cluster number nodes uses a channel has no effect on channels being used by the inter-CH links. Therefore, the CB-MAS can minimize the interference within multi-channel environments. Our Simulation results showed that CB-MAS achieves improved the throughput and fairness index in WMN.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.10a
• /
• pp.149-150
• /
• 2016

모바일 컴퓨팅의 발전은 모바일 디바이스에게 클라우드 컴퓨팅 기술 도입을 가져왔다. 모바일 클라우드 컴퓨팅은 워크스테이션 및 클러스터로 구축된 클라우드 컴퓨팅과 다르게 모바일 디바이스만을 가지고 자원 서비스를 제공한다. 모바일 클라우드는 모바일 디바이스의 저조한 하드웨어 성능과 산발적인 네트워크 연결을 가진다. 모바일 클라우드의 인프라 구성을 위해서는 모바일 디바이스의 연결 및 자원 통합이 매우 중요시 된다. 본 논문에서는 모바일 클라우드 컴퓨팅의 인프라 구축을 위해 연결된 모바일 디바이스의 자원 통합 및 지속적인 자원 서비스 관리를 제공하는 M-RIM(Mobile device - Resource Integration Management)을 제안한다. M-RIM은 모바일 디바이스의 성능 정보 메타데이터 기반 분산 자원을 통합하고 사용자에게 자원 서비스를 제공한다.

• Annual Conference on Human and Language Technology
• /
• 2006.10e
• /
• pp.164-170
• /
• 2006

본 논문에서는 한국어 동사의 개념적 클러스터링 방법을 제안하다. 사용되는 기법은 독립성분분석, Box-Cox 변환, 상관분석 등이다. 독립성분분석은 잠재적인 성분을 통계적 독립(statistical independence)에 기반하여 추출하는 분석 방법이다. 그런데, 독립성분분석에서는 mixture(동사)의 분포는 정규 분포(가우시안 분포)에 따른다고 가정한다. 따라서 동사의 분포를 보다 정규 분포화 할 필요가 있다. 이에 본 논문에서는 Box-Cox 변환을 이용하여 동사의 분포를 정규 분포에 근사한다. 또한, 독립성분분석에서는 추출할 적당한 성분의 개수를 결정할 수가 없다. 이에 본 논문에서는 주성분분석의 결과로 획득되는 고유치의 누적 기여율을 이용하여 독립성분의 수를 결정한다. 그리고, 추출된 독립성분 벡터와 동사 벡터간의 상관계수에 이용하여 독립성분(개념)에 밀접하게 관련 있는 동사들을 하나의 클러스터로 구성한다. 한국어 동사를 대상으로 클러스터링한 결과, Box-Cox 변환을 적용한 경우가 더 좋은 성능을 보였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.415-418
• /
• 2009

최근 서비스 지향 아키텍처 (Service Oriented Architecture SOA) 기반의 애플리케이션 개발에 맞게 비즈니스 프로세스의 유연성을 확보하고 재사용을 증진시키기 위하여 비즈니스 프로세스 패밀리 모델(Business Process Family Model: BPFM)이 제시되었다. BPFM은 소프트웨어 프로덕트 라인 방법의 가변성 분석 기법을 사용하여 비즈니스 프로세스 군 (family)에서 나타날 수 있는 가변성을 분석하여 이를 명시적으로 표현하고 있는 모델이다. BPFM으로부터 여러 개의 BPM (Business Process Model)을 개발하기 위해서는 가변성 결정 및 가지치기 (Decision and Pruning) 과정을 거쳐야 한다. 이 때 가변성 사이에는 서로 협력적 또는 배타적인 관계를 가질 수 있고 이는 가변성 결정과 가지치기에 영향을 미치게 되는데, 현재 제시된 BPFM에는 이러한 바인딩 정보에 대해서 아직 고려하지 않고 있다. 본 논문에서는 비즈니스 프로세스 군에서 식별될 수 있는 가변성들 사이의 의존관계의 유형을 분석하고 이 정보를 모델의 형태로 나타낼 수 있는 방법을 제시한다. 먼저 BPFM에 포함된 가변성 정보를 독립된 의존관계 분석모델로 추출해 내고 각 가변성 결정유형에 따라 표현방법을 제시한다. 추출된 모델에서 의존관계를 표현하고 가변성 결정이 영향을 미치는 범위의 가변성들을 클러스터할 수 있는 방법을 제공한다. 본 방법을 이용함으로써 가변성 결정회수를 현저히 줄일 수 있음을 사례연구를 통해 보여준다. 또한 잘못된 가변성 결정으로 인한 BPM의 기능 불일치를 해소할 수 있음을 보여준다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.848-850
• /
• 2014

Mobile Ad hoc Networks(MANET) is consist of node that has mobility, MANET build cluster formation for using energy efficient. In existing LEACH algorithm elect cluster head node in coverage area by distribution function. However, when the cluster head node, that elected by distribution function, is divided coverage area unevenly, the network can't consumption energy efficiency. To solve this problem, we proposed CSWC(Coverage Scheduling Weight-value Control) algorithm. When the coverage area is divided nonchalance, proposed algorithm increased number of hops, that determines coverage area, for balance coverage area. As the result proposed algorithm is set balance coverage area, the network consumption energy efficiency.

• Journal of KIISE:Databases
• /
• v.29 no.1
• /
• pp.44-57
• /
• 2002

Multiple spatial queries are defined as two or more spatial range queries to be executed at the same time. The primary processing of internet-based map services is to simultaneously execute multiple spatial queries. To improve the throughput of multiple queries, the time of disk I/O in processing spatial queries significantly should be reduced. The declustering scheme of a spatial dataset of the MIMD architecture cannot decrease the disk I/O time because of random seeks for processing multiple queries. This thesis presents query scheduling strategies to ease the problem of inter-query random seeks. Query scheduling is achieved by dynamically re-ordering the priority of the queued spatial queries. The re-ordering of multiple queries is based on the inter-query spatial relationship and the latency of query processing. The performance test shows that the time of multiple query processing with query scheduling can be significantly reduced by easing inter-query random seeks as a consequence of enhanced hit ratio of disk cache.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.11
• /
• pp.23-30
• /
• 2013

In this paper, we propose pre-arrangement based task scheduling scheme to reduce MapReduce job processing time. If a task and data to be processed do not locate in same node, the data should be transmitted to node where the task is allocated on. In that case, a job processing time increases owing to data transmission time. To avoid that case, we schedule tasks into two steps. In the first step, tasks are sorted in the order of high data locality. In the second step, tasks are exchanged to improve their data localities based on a location information of data. In performance evaluation, we compare the proposed method based Hadoop with a default Hadoop on a small Hadoop cluster in term of the job processing time and the number of tasks sorted to node without data to be processed by them. The result shows that the proposed method lowers job processing time by around 18%. Also, we confirm that the number of tasks allocated to node without data to be processed by them decreases by around 25%.