• 한국멀티미디어학회논문지
• /
• 제11권8호
• /
• pp.1082-1092
• /
• 2008

무선 센서 네트워크에서 LEACH와 같은 클러스터링 프로토콜은 전체 네트워크의 수명을 연장시키는 효율적인 방법이지만 클러스터 헤드 노드에 높은 부하를 주게 되어 급격한 에너지 소모를 유발하는 문제가 있다. 따라서 클러스터의 구성과 클러스터 헤드 노드의 역할을 주기적으로 교체하여 네트워크의 수명을 연장시켰다. 그러나 이 방법은 클러스터를 구성하는 과정에서 상당한 량의 에너지 소모를 보인다. 따라서 본 논문은 소모되는 에너지의 효율성 증대를 위해 클러스터링 알고리즘을 제안하였다. 이 알고리즘에서 서로 인접한 노드들은 intra cluster를 이루며 이 클러스터를 구성하는 노드들은 라운드 로빈 형태로 데이터를 수집하고 전송한다. 전체 네트워크의 관점에서 볼 때 이 intra cluster는 한개의 노드로 취급된다. 한 라운드의 setup단계에서 intra cluster들은 클러스터 헤드(intra cluster)에 의해 다시 클러스터를 형성(network cluster)하게 된다. 클러스터 헤드가 된 intra cluster의 모든 멤버노드는 라운드 로빈 방식으로 클러스터 헤드 역할을 수행한다. 따라서 intra cluster의 크기에 의해 라운드의 주기를 연장할 수 있다. 또한 steady-state에서 각 intra cluster의 노드는 라운드 로빈 방식으로 데이터를 수집하며 network cluster의 클러스터 헤드에 전송한다. 성능분석 결과 제안하는 방법은 제안된 클러스터링 방법에 비해 노드들의 에너지 소모가 줄어들었으며 전송 효율이 증가하였다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제2권1호
• /
• pp.26-32
• /
• 2002

The objectives of this paper are twofold. First is to introduce a model for representing documents with semantics relatedness using rough sets but with tolerance relations instead of equivalence relations (TRSM). Second is to introduce two document hierarchical and nonhierarchical clustering algorithms based on this model and TRSM cluster-based information retrieval using these two algorithms. The experimental results show that TRSM offers an alterative approach to text clustering and information retrieval.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2014년도 춘계학술대회
• /
• pp.781-783
• /
• 2014

유동성을 가진 노드들로 구성된 모바일 애드 혹 네트워크(Mobile Ad hoc Network)는 토폴로지의 변화에 따른 오버헤드를 발생한다. 오버헤드를 줄이기 위해, 클러스터를 형성하여 클러스터 헤드노드를 통해 통신하는 계층적 네트워크연구가 진행되어 왔다. 클러스터 헤드노드가 트래픽의 집중에 의해 트래픽이 증가하면, 클러스터 멤버노드는 목적지 노드에게 메시지를 전달하지 못하는 상황이 발생한다. 이를 해결하기 위해 본 논문에서는 Step Parent 알고리즘을 제안한다. 본 논문에서 제안하는 알고리즘은 클러스터 멤버노드는 통신 반경 안에 있는 클러스터 헤드노드들의 경로를 통해, 클러스터 멤버노드가 속한 클러스터 헤드노드의 트래픽을 파악한다. 클러스터 헤드노드가 트래픽이 집중되어 있을 경우, 클러스터 멤버노드는 타 클러스터 헤드노드의 경로 정보를 이용하여, 새로운 라우팅 경로를 생성하고 메시지를 전달함으로써, 네트워크 전달성이 증가한다.

• 대한산업공학회지
• /
• 제14권1호
• /
• pp.119-131
• /
• 1988

Vehicle Scheduling Problem (VSP) is a generic name given to a whole class of problems involving the visiting of "stations" by "vehicles," where a time is associated with each activity. The studies performed to date have the common feature of a single objective while satisfying a set of restrictions and known customer supplies or demands. However, VSPs may involve relevant multiple objectives and probabilistic supplies or demands at stations, creating multicriteria stochastic VSPs. This paper proposes a heuristic algorithm based on goal programming approach to schedule the most satisfactory vehicle routes of a bicriteria VSP with probabilistic supplies at stations. The two relevant objectives are the minimization of the expected travel distance of vehicles and the minimization of the due time violation for collection service at stations by vehicles. The algorithm developed consists of three major stages. In the first stage, an artificial capacity of vehicle is determined, on the basis of decision maker's subjective estimates. The second one clusters a set of stations into subsets by applying an efficient cluster method developed. In the third one, the stations in each subset are scheduled by applying an iterative goal programming heuristic procedure to each cluster.

• ETRI Journal
• /
• 제13권2호
• /
• pp.34-41
• /
• 1991

In this paper, a new distributed parallel algorithm for pattern classification based upon Self-Organizing Neural Network(SONN)[10-12] is developed. This system works without any information about the number of clusters or cluster centers. The SONN model showed good performance for finding classification information, cluster centers, the number of salient clusters and membership information. It took a considerable amount of time in the sequential version if the input data set size is very large. Therefore, design of parallel algorithm is desirous. A new distributed parallel algorithm is developed and experimental results are presented.

• 천문학회보
• /
• 제41권2호
• /
• pp.60.1-60.1
• /
• 2016

To obtain a reliable estimate of the cold dark matter (CDM) substructure mass function in a dense cluster environment, one needs to understand how long a merged halo can survive within the host halo. Measuring disruption time scale of merged halos in a dense cluster environment, we attempt to construct the realistic CDM mass function that can be compared with stellar mass functions to get a stellar-to-halo mass ratio. For this, we performed a set of high-resolution simulations of cold dark matter halos with properties similar to the Virgo cluster. Field halos outside the main halo are detected using a Friend-of-Friend algorithm with a linking length of 0.02. To trace the sub-halo structures even after the merging with the main halo, we use their core structures that are defined to be the most 10% bound particles.

• International Journal of Computer Science & Network Security
• /
• 제22권7호
• /
• pp.157-164
• /
• 2022

The proposed privacy preserving scheme has identified the drawbacks of existing schemes in Vehicular Networks. This prototype enhances the number of nodes by decreasing the cluster size. This algorithm is integrated with the whale optimization algorithm and Block Chain Technology. A set of results are done through the NS-2 simulator in the direction to check the effectiveness of proposed algorithm. The proposed method shows better results than with the existing techniques in terms of Delay, Drop, Delivery ratio, Overhead, throughout under the denial of attack.

• Korean Journal of Mathematics
• /
• 제10권1호
• /
• pp.5-10
• /
• 2002

In this paper, we investigate the prefilter base on a fuzzy set and fuzzy net ${\varphi}$ on the fuzzy topological space (X,${\delta}$). And we show that the prefilter base $\mathcal{B}({\varphi})$ determines by the fuzzy net ${\varphi}$ converge to a fuzzy point $p$ iff the fuzzy net ${\varphi}$ converge to a fuzzy point $p$. Also we prove that if the prefilter base $\mathcal{B}$ converge to a fuzzy point $p$, then the $\mathcal{B}$ has the cluster point $p$.

• 전기학회논문지P
• /
• 제67권1호
• /
• pp.47-51
• /
• 2018

This paper is concerned with an optimization design of Incremental Granular Model(IGM) based Genetic Algorithm (GA) as an evolutionary approach. The performance of IGM has been successfully demonstrated to various examples. However, the problem of IGM is that the same number of cluster in each context is determined. Also, fuzzification factor is set as typical value. In order to solve these problems, we develop a design method for optimizing the IGM to optimize the number of cluster centers in each context and the fuzzification factor. We perform energy analysis using 12 different building shapes simulated in Ecotect. The experimental results on energy efficiency data set of building revealed that the proposed GA-based IGM showed good performance in comparison with LR and IGM.

• 한국주거학회논문집
• /
• 제22권4호
• /
• pp.121-132
• /
• 2011

Hanok with a long tradition in our country, but a significant period of modernization in the process of being cut off did not have continuity. Many of Hanok aging, according to the rapid residential development and life-changing was the subject of a complaint. Conversely, the benefits of Hanok was given to the advantages that compare to a monotonous mass housing of apartments. Despite these changes and the potential of these social needs and demands Hanok quickly did not respond: First, for the life of contemporary and traditional Hanok with a form of gap is a matter of space and style. Economy and lifestyle $20,000 for the era of Hanok was to develop a model for spatial configurations. Second, Hanok in a low density, is evaluated to aging, because increasing the economic utilization of land and tailored to their needs as a Hanok housing requires the development of a model, but this did not present a layered model. The purpose of this study is a modern residential Hanok persistence of this set to have 1) the spatial characteristics of traditional and modern urban life Hanok living space that meets the requirements of the degree of each other, to find sustainable elements, and 2) these demands the modern residential area type, combined with a set of Hanok 3) Korea Hanok cultural characteristics which set is created to residential housing types is to develop a basic research.