• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.3
• /
• pp.715-723
• /
• 2015

In this paper, we propose a context-awareness routing algorithm DDV (Dynamic Direction Vector)-hop algorithm in Mobile Ad Hoc Networks. The existing algorithm in MANET, it has a vulnerability that the dynamic network topology and the absence of network expandability of mobility of nodes. The proposed algorithm performs cluster formation using a range of direction and threshold of velocity for the base-station, we calculate the exchange of the cluster head node probability using the direction and velocity for maintaining cluster formation. The DDV algorithm forms a cluster based on the cluster head node. As a result of simulation, our scheme could maintain the proper number of cluster and cluster members regardless of topology changes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.964-972
• /
• 2009

Wireless mesh network (WMN) is emerging a future core technology to resolve many problems derived from exist wireless networks by employing multi-interface and multi-channel. Ability to utilize multiple channels in WMNs substantially increases the effective bandwidth available to wireless network nodes. However, minimum interference channel assignment algorithms are required to use the effective bandwidth in multi-channel environments. This paper proposes a cluster-based minimum interference channel assignment (MI-CA) algorithm to improve the performance of WMN. The MI-CA algorithm is consists of Inter-Cluster and Intra-Cluster Intrchannel assignment between clusters and in the internal clusters, respectively. The Inter-Cluster channel assignment assigns a barebone channel to cluster heads and border nodes based on minimum spanning tree (MST) and the Intra-Cluster channel assignment minimizes channel interference by reassigning ortasgonal channels between cluster mespann. Our simheation results show that MI-CA can improve the performance of WMNs by minimizing channel interference.

• Journal of KIISE:Databases
• /
• v.29 no.2
• /
• pp.128-137
• /
• 2002

In this paper, we propose the LPC+-file for efficient indexing of high-dimensional image data. With the proliferation of multimedia data, there Is an increasing need to support the indexing and retrieval of high-dimensional image data. Recently, the LPC-file (5) that based on vector approximation has been developed for indexing high-dimensional data. The LPC-file gives good performance especially when the dataset is uniformly distributed. However, compared with for the uniformly distributed dataset, its performance degrades when the dataset is clustered. We improve the performance of the LPC-file for the strongly clustered image dataset. The basic idea is to adaptively partition the data space to find subspaces with high-density clusters and to assign more bits to them than others to increase the discriminatory power of the approximation of vectors. The total number of bits used to represent vector approximations is rather less than that of the LPC-file since the partitioned cells in the LPC+-file share the bits. An empirical evaluation shows that the LPC+-file results in significant performance improvements for real image data sets which are strongly clustered.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.10
• /
• pp.734-745
• /
• 2006

This paper presents a PC cluster-based distributed VOD server that minimizes the load of an interconnection network by adopting the VIA communication protocol and the interval cache algorithm. Video data is distributed to the disks of the distributed VOD server and each server node receives the data through the interconnection network and sends it to clients. The load of the interconnection network increases because of the large amount of video data transferred. This paper developed a distributed VOD file system, which is based on VIA, to minimize cost using interconnection network when accessing remote disks. VIA is a user-level communication protocol removing the overhead of TCP/IP. This papers also improved the performance of the interconnection network by expanding the maximum transfer size of VIA. In addition, the interval cache reduces traffic on the interconnection network by caching, in main memory, the video data transferred from disks of remote server nodes. Experiments using the distributed VOD server of this paper showed a maximum performance improvement of 21.3% compared with a distributed VOD server without VIA and the interval cache, when used with a four-node PC cluster.

• The Journal of the Acoustical Society of Korea
• /
• v.34 no.4
• /
• pp.303-309
• /
• 2015

Speaker diarization is the task of determining the speakers for unlabeled data, and DBSCAN (Density-Based Spatial Clustering of Applications with Noise) has been widely used in the field of speaker diarization for its simplicity and computational efficiency. One challenging issue, however, is that if different clusters in non-spatial dataset are adjacent to each other, over-clustering may occur which subsequently degrades the performance of DBSCAN. In this paper, we identify the drawbacks of DBSCAN and propose a new density clustering algorithm based on local distribution property around object. Variable density criterions for local density and spreadness of object are used for effective data clustering. We compare the proposed algorithm to DBSCAN in terms of clustering accuracy. Experimental results confirm that the proposed algorithm exhibits higher accuracy than DBSCAN without over-clustering and confirm that the new approach based on local density and object spreadness is efficient.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.239-241
• /
• 2015

본 논문에서는 클러스터 개수를 동적으로 생성하는 개선된 FCM을 적용하여 초음파 영상에서 충수염을 추출하는 방법을 제안한다. 초음파 영상에서 ROI 영역을 추출한 후, Max-Min 기반 이진화 기법을 적용한다. 이진화된 영상에서 근막 영역의 크기가 ROI 영역의 1/3이상을 차지한다는 정보를 이용하여 Labelling 기법을 적용하여 근막 영역을 추출한다. 근막의 최하단 좌표를 이용하여 근막의 하단 영역을 추출한 후, 근막의 하단 영역에서 객체들의 선명도를 높이기 위해 Blurring 기법과 Sharpening 기법을 적용한다. 충수염의 후보 영역을 추출하기 위해 FCM 알고리즘을 개선하여 양자화를 수행한다. 개선된 FCM 알고리즘으로 양자화를 수행하여 충수염의 후보 영역을 추출한다. 추출된 충수염의 후보 영역에서 8방향 윤곽선 추적 기법을 적용하여 객체들을 추출한다. 추출된 객체들 중에서 낮은 명암도를 가지고 초음파 전체 영상 크기의 1/3이하 되는 객체를 충수염으로 추출한다. 초음파 영상을 대상으로 제안된 방법을 적용하여 실험한 결과, 기존의 방법보다 충수염 영역의 추출률이 개선된 것을 확인하였다.

• The KIPS Transactions:PartC
• /
• v.17C no.6
• /
• pp.441-450
• /
• 2010

Recently, a lot of interest is increased in sensor network which gathers various data through many sensor nodes deployed in wired and wireless network environment. However, because of the limitation in memory, computation, and energy of the sensor nodes, security problem is very important issue. In sensor network, not only the security problem, but also computing power should be seriously considered. In this paper, considering these characteristics, we make the sensor network consist of normal sensor nodes and clusterheaders with enough space and computing power, and propose a group key rekeying scheme adopting PCGR(Predistribution and local Collaborationbased Group Rekeying) for secure group communication. In our proposal, we enhance the security by minimizing the risk to safety of the entire network through verifying the new key value from clusterheader by sensor nodes. That is, to update the group keys, clusterheaders confirm sensor nodes through verifying the information from sensor nodes and send the new group keys back to authentic member nodes. The group keys sent back by the clusterheaders are verified again by sensor nodes. Through this mutual authentication, we can check if clusterheaders are compromised or not. Qualnet simulation result shows that our scheme not only guarantees secure group key rekeying but also decreasesstorage and communication overhead.

• Annual Conference of KIPS
• /
• 2015.10a
• /
• pp.613-616
• /
• 2015

최근 스마트폰 기기의 보급 및 소셜 서비스 산업의 고도화로 인해, 빅데이터가 등장하였다. 한편 빅데이터에서 효율적으로 정보를 분석하는 대표적인 플랫폼으로 하둡이 존재한다. 하둡은 클러스터 환경에 기반한 우수한 확장성, 장애 복구 기능 및 사용자가 기능을 정의할 수 있는 맵리듀스 프레임워크 등을 지원한다. 아울러 하둡은 개인정보나 위치 데이터 등의 민감한 정보를 보호하기 위해 Kerberos를 통한 사용자 인증 기법을 제공하고, HDFS 압축 코덱을 활용한 AES 코덱 기반 데이터 암호화를 지원하고 있다. 그러나 하둡 기반 소프트웨어를 사용하고 있는 국내 기관 및 기업은 국내 ARIA 데이터 암호화를 적용하지 못하고 있다. 이를 해결하기 위해 본 논문에서는 하둡을 기반으로 ARIA 암호화를 지원하는 HDFS 데이터 암호화 기법을 제안한다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.2
• /
• pp.1-10
• /
• 2010

Mapping virtual process topology to physical processor topology is one of the most important design issues in parallel programming. However, the mapping problem is complicated due to the topology irregularity and routing complexity. This paper proposes a new process mapping scheme called adjacency-based mapping (AM) for irregular cluster systems assuming that the two-dimensional mesh process topology is specified as an interprocess communication pattern. The cluster systems have been studied and developed for many years since they provide high interconnection flexibility, scalability, and expandability which are not attainable in traditional regular networks. The proposed AM tries to map neighboring processes in virtual process topology to adjacent processors in physical processor topology. Simulation study shows that the proposed AM results in better mapping quality and shorter interprocess latency compared to the conventional approaches.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.3B
• /
• pp.255-263
• /
• 2009

In this paper, we propose an adaptive beacon scheduling algorithm to control a reception period of actual data according to variation of amount of traffic in IEEE 802.15.4 LR-WPAN(Low Rate-Wireless Personal Area Network) with the cluster-tree topology. If a beacon interval is shortened, the amount of the traffic a node receives can be increased while consumption of the energy can be also increased. In this sense, we can achieve optimal on orgy consumption by controlling the beacon interval when the amount of data to be received is being decreased. The result of simulation using NS-2 shows that the proposed algorithm improves performances in terms of packet loss rate and end-to-end delay compared with algorithm using a fixed beacon interval. For a design of cluster-tree based LR-WPAN managing delay-sensitive services, the proposed algorithm and the associated results can be applied usefully.