• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.11a
• /
• pp.3-6
• /
• 2009

최근 차량통신 환경에서의 위성/지상파 DMB 등 차량통신에 대한 관심이 증대되고, 전 세계적으로 기술개발이 활발하게 진행되고 있다. 그러나 좁고 긴 도로 내에 차량이 수시로 들락거려 일정한 통신 구심점을 찾는 것이 쉽지 않고, 빠르게 이동하는 차량의 특성으로 채널 특성이 좋지않 으며, 차량통신을 위한 인프라가 충분히 설치되지 않을 경우 V2I 통신의 어려움 등이 문제점으로 지적될 수 있다. 본 논문에서는 차량통신 네트워크의 효율적 운용을 위한 적응적 클러스터링(Clustering) 기법을 제안하도록 한다. 제안된 적응적 클러스터링 방법에서는 차량의 속도, 위치, 차량 간 거리에 의하여 수시로 클러스터가 적응적으로 재구성된다. 이를 위해 효율적인 클러스터해드 설정이 이루어지며, 차량통신 인프라, 클러스터해드를 중심으로 통신이 이루어진다. 제안된 기법은 제한된 인프라에서도 이중 홉 통신 및 적응적 클러스터 재구성을 통하여 차량의 네트워크 연결성을 높인다. 컴퓨터 모의실험을 통하여 적응적 클러스터링 방법의 성능을 알아보도록 한다. 모의실험을 통하여 빠른 속도로 움직이는 차량의 네트워크 접근성을 확인하고, 차량 밀도 및 인프라 간 거리에 따른 성능변화를 확인한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.325-327
• /
• 2005

이동 애드혹 네트워크에서 트리와 메쉬 기반의 멀티캐스트 메커니즘들은 트리의 빈번한 재구성 및 자원 사용의 비효율적인 문제점을 가지고 있다. 이를 해결하기 위하여 제안된 오버레이 멀티캐스트 메커니즘들 역시 오버레이 트리의 재구성으로 인한 과부하와 밀접한 멤버간의 비효율적인 전송, 그리고 네트워크 확장성에 대한 문제점들을 갖는다. 본 논문에서는 이를 개선하기 위해 위치정보를 기반으로 밀접한 멤버노드들을 클러스터로 관리하여 클러스터 내에서는 브로드캐스팅을 적용하고, 멀티캐스트 소스와 클러스터 대표노드들간에는 유니캐스팅을 적용하는 오버레이 멀티캐스트 메커니즘을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.610-612
• /
• 2004

무선 센서 네트워크에서 클러스터 헤드 결함으로 인해 발생되는 클러스터 재구성은 시간과 에너지를 낭비하고 시스템 전체 신뢰도를 저하시키는 결과를 초래한다. 본 논문에서는 클러스터링 구조에서 발생할 수 있는 결함을 모델링하고. 시스템 신뢰도와 에너지 관리 효율을 높이는 백업 기법을 제안한다. 또한 성능 평가를 통해 백업 기법을 사용하지 않는 일반 클러스터링 기법과 성능을 비교하였으며, 그 결과로 일반 기법 보다 더 높은 신뢰도를 얻을 수 있었다.

• The Journal of the Korea Contents Association
• /
• v.6 no.9
• /
• pp.9-18
• /
• 2006

We completed a new cluster system based on WDM by proposing a virtual topology reconfiguration schemes. The key idea of the proposed scheme is to construct a set with the longest chains of requests of connecting nodes which need to be assigned a wavelength. All the sets have no common factor, that is, there is no duplicated link among the requests of connecting. After making the set satisfying this condition, we could assign a wavelength to per corresponding set. We could reconfigure a virtual topology with this scheme collectively. we compared our scheme to existing approaches by the OWns simulation tool. As the results, we gained improved performances, reducing 10% of blocking rate and improving 30% of ADM utilization in terms of the blocking probability and the ADM utilization.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.1
• /
• pp.49-56
• /
• 2004

Load imbalance is a serious impediment to achieving good performance in parallel processing. Global load balancing schemes cannot adequately manage to balance parallel tasks generated from a single application. Dynamic loop scheduling methods are known to be useful in balancing parallel loops on shared-memory multiprocessor machines. However, their centralized nature causes a bottleneck for the relatively small number of processors in a network of workstations because of order-of-magniture differences in communication overheads. Moreover, improvements of basis loops scheduling methods have not effectively dealt with irregularly distributed workloads in parallel loops, which commonly occur in applications for a network of workstation. In this paper, we present a new reconfigurable and decentralized balancing method for parallel loops on a network of workstations. Since our method supplements performance balancing with those tranditional load balancing methods, it minimizes the overall execution time.

• Journal of the Economic Geographical Society of Korea
• /
• v.17 no.4
• /
• pp.688-701
• /
• 2014

This article is focused on the agglomeration and decline factors of the footwear industries in Busan metropolitan area from the industrial cluster point of perspective. For the research, 'the components and network of industrial cluster model' are presented which is restructured of M. Porter's cluster model. Moreover, this research have examined the agglomeration and decline process of the footwear industries in Busan area and conducted a survey targeting footwear enterprises in Busan area. In the late 1980's, the footwear industries in Busan area formed the largest footwear industrial cluster in the world. However, the industrial cluster started to decline from early 1990's and now it is reduced in to 1/10 size of the past. The growth factors of Busan footwear industrial cluster include cheap and plentiful labours, penetration of OEM production, entrepreneur spirit, human resources network, government's support and so on. Moreover, the agglomeration of relative companies also created high competitiveness in this cluster. The decay factors are pointed out sudden rise of labour cost, shortage of factory site, rise of land price, alteration of government policy, international relocation of footwear production and growth of overseas industrial cluster. Busan footwear industrial cluster nowadays has declined in its size, but it is the only footwear industrial cluster in Korea.

• Journal of the Economic Geographical Society of Korea
• /
• v.10 no.1
• /
• pp.19-43
• /
• 2007

The purpose of this study is to distinguish industrial clusters in Korea. Based on I/O table in 2000, coefficient matrix was calculated and factor analysis was performed on the matrix. Among 38 derived industrial clusters, 5 of them were unreported clusters, which were indistinguishable. Once these 38 industrial clusters were differentiated according to I/O table, final results of clusters were produced as I/O table was converted into KSIC (Korean Standard Industry Code). Since existing studies on industrial cluster have been focused on qualitative methods such as case studies and interviews, it is expected that this study could contribute to carry out more systematic and efficient methodology.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.401-405
• /
• 2007

In sensor network, cluster based routing protocol about efficient energy usage method has researched variously. But existing cluster based routing protocol have problems. one of the problem is sensor nodes's imbalance energy consumption problem at cluster reconstruction. anther is non- connection problem between header node and spc node when they are far from each other, not properly connected. We propose cluster re-division and header node of multihop transmission method in this paper. The cluster re-division method is the method that re-divides existing routing protocol with the small-scale cluster and multihop transmission method is the method regarding the relay transmission between the header nodes. Through the simulation, the proposed routing mechanism shows more excellent than exiting routing protocol in balance energy consumption and energy efficiency.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.9
• /
• pp.65-73
• /
• 2014

Since Time synchronization is also critical in Wireless Sensor Networks (WSN) like other networks, a time synchronization protocol for WSN called IBS(Indirect-Broadcast Synchronization) has been already proposed in 2012. As IBS operates in cluster tree topology, network lifetime may be mainly shortened by cluster head node[s], which usually consumes more power than cluster member (i.e. non-cluster head) nodes. In this paper, I propose enhanced version of IBS (called EIBS) which saves overall energy and prolongs network lifetime by re-constructing partial cluster tree locally. Compared with other tree construction approaches, this tree reconstruction algorithm is not only simpler, but also more efficient in the light of overall power consumption and network lifetime.

• Proceedings of the KIEE Conference
• /
• 2005.07a
• /
• pp.162-165
• /
• 2005

본 논문에서는 해집단을 다음세대로 진화시킬 때, 유전알고리즘과 진화전략을 동시에 사용하고, 적합도에 따라 복제하는 과정에서 유전알고리즘과 진화전략이 적용될 해집단의 비율이 적응적으로 변경되는 적응진화 알고리즘을 제안하였다. 또한 제안한 알고리즘을 실시간 적용하기 위해 PC 클러스터 시스템으로 병렬처리하여 최적해 탐색 성능 및 탐색속도를 개선하였다. 제안한 알고리즘을 참고문헌의 배전계통 재구성 문제에 적용해본 결과, 유전 알고리즘 또는 진화전략을 단독으로 사용한 경우보다 제안한 방법이 더 빠른 시간내에 우수한 최적해를 탐색하였고, 병렬 연산의 수행 노드수 증가에 따라 최적해 탐색성능은 유지하면서 최적해 탐색 시간을 상당히 단축시킴을 확인하였다.