• 한국인터넷방송통신학회논문지
• /
• 제19권5호
• /
• pp.87-91
• /
• 2019

WSN은 배터리와 같은 제한된 전원을 가진 센서 노드가 무선으로 구성된 네트워크이다. 센서 노드의 배터리가 모두 소모되면 해당 노드는 더는 동작하지 않으며, 일정 이상의 노드가 동작하지 않으면 네트워크는 제 역할을 하지 못하게 된다. 따라서 노드의 에너지 효율을 높여 에너지 소모를 최소화하면 네트워크의 수명을 증가시킬 수 있다. 에너지 효율을 높이기 위한 프로토콜은 다양하게 있으며, 그중 클러스터 방식과 체인 방식의 프로토콜이 있다. 클러스터 기반 프로토콜은 센서 공간을 클러스터로 나누어 각 클러스터마다 클러스터 내 데이터를 수집해 전송하는 클러스터 헤드를 선출한다. 클러스터 헤드로 선출된 노드의 경우 에너지 소모가 심한 문제가 있다. 체인 기반 프로토콜로 센서 노드들을 체인으로 연결하여 전송한다. 본 논문에서는 클러스터 기반 프로토콜인 LEACH Protocol에서 클러스터 헤드의 에너지 소모를 줄이기 위해 체인 연결 기법을 사용하여 네트워크 수명을 늘리고자 한다.

• 한국멀티미디어학회논문지
• /
• 제19권5호
• /
• pp.910-917
• /
• 2016

Sensors have limited resources in sensor networks, so efficient use of energy is important. Representative clustering methods, LEACH, LEACHC, TEEN generally use direct transmission methods from cluster headers to the sink node to pass collected data. However, the communication distance of the sensor nodes at low cost and at low power is not long, it requires a data transfer through the multi-hop to transmit data to the sink node. In the existing cluster-based sensor network studies, cluster process and route selection process are performed separately in order to configure the routing path to the sink node. In this paper, in order to use the energy of the sensor nodes that have limited resources efficiently, a cluster-based multi-hop routing protocol which merges the clustering process and routing process is proposed. And the proposed method complements the problem of uneven cluster creation that may occur in probabilistic cluster methods and increases the energy efficiency of whole sensor nodes.

• Journal of information and communication convergence engineering
• /
• 제22권1호
• /
• pp.1-6
• /
• 2024

Energy efficiency in wireless sensor networks (WSNs) is a critical issue because batteries are used for operation and communication. In terms of scalability, energy efficiency, data integration, and resilience, WSN-cluster-based routing algorithms often outperform routing algorithms without clustering. Low-energy adaptive clustering hierarchy (LEACH) is a cluster-based routing protocol with a high transmission efficiency to the base station. In this paper, we propose an energy consumption model for LEACH and compare it with the existing LEACH, advanced LEACH (ALEACH), and power-efficient gathering in sensor information systems (PEGASIS) algorithms in terms of network lifetime. The energy consumption model comprises energy-sensitive cluster formation and a cluster head selection technique. The setup and steady-state phases of the proposed model are discussed based on the cluster head selection. The simulation results demonstrated that a low-energy-consumption network was introduced, modeled, and validated for LEACH.

• Agribusiness and Information Management
• /
• 제7권1호
• /
• pp.21-36
• /
• 2015

This study aims to analyze the differences of ginseng product consumers and segment Korean fresh ginseng and red ginseng root markets based on attributes for the purchase. As a result of analyzing survey data, the red ginseng root consumers had different aspects from fresh ginseng consumers. According to the result of cluster analysis, the fresh ginseng consumers were subdivided into three segments (safety-oriented consumption cluster, label centered consumption cluster, and high involvement consumption cluster), while the red ginseng root consumers were subdivided into four segments (convenience-oriented consumption cluster, high involvement consumption cluster, raw material's safety-oriented cluster, and raw material's information importance cluster). ANOVA and Crosstab were conducted to investigate characteristics of each cluster.

• 한국정보통신학회논문지
• /
• 제16권6호
• /
• pp.1173-1178
• /
• 2012

클러스터 기반 라우팅 프로토콜(CBRP, Cluster-Based Routing Protocol)은 각 클러스터 내에 클러스터 헤더를 선출하고, 그 클러스터 헤더는 모든 이동 노드들을 관리, 운영하기 때문에 전력 소모가 심하게 일어나게 된다. 기존의 CBRP는 각 노드의 잔여전력량을 고려하지 않고 헤더를 임의로 선출하기 때문에 클러스터 헤더의 평균 수명이 짧아지고 이로인해 빈번하게 다른 헤더를 선출해야 하는 문제점을 가지고 있다. 따라서, 본 논문에서는 클러스터 헤더를 선출할 때 클러스터 내 각 노드의 잔여전력량을 비교하여 잔여전력량이 가장 많은 노드를 클러스터 헤더로 선출하여 클러스터의 수명과 네트워크 전체의 수명을 연장시키면서 경로의 안정성을 높이는 개선된 프로토콜을 제안한다.

• 인터넷정보학회논문지
• /
• 제5권5호
• /
• pp.27-37
• /
• 2004

기존의 ad hoc 네트워크 라우팅 프로토콜들은 노드의 동적인 특성으로 인하여 확장성에 제약을 받는다. 클러스터 기반 라우팅 프로토콜은 노드들을 클러스터로 분할하고 그들간에 계층적인 라우팅을 수행한다. 이러한 계층적인 특징은 ad hoc 네트워크 라우팅 프로토콜의 확장성을 보장한다. 그러나 기존의 k-hop클러스터 기반 라우팅 프로토콜은 헤더의 제어 부하 등과 같은 문제점온 갖는 것으로 알려져 있다. 본 논문에서는 ad hoc 네트워크에 대해 위임 기능을 이용한 새로운 k-hop(k>3) 클러스터 기반 라우팅 구조를 제안한다. 이 구조는 멤버들을 효율적으로 관리하기 위해 트리 토폴로지를 사용한다. 헤더는 모든 멤버들에 대한 라우팅 테이블을 관리하지 않고, 멤버들 중에서 자신과 이웃하는 노드들에 대한 라우팅 테이블과 나머지 노드들에 대한 멤버 리스트만을 관리하고, 더 낮은 레벨에 있는 노드들은 중간 노드가 관리한다. 제안된 메커니즘은 클러스터 헤더의 제어 부하를 다소 줄일 수 있다.

• International Journal of Internet, Broadcasting and Communication
• /
• 제13권3호
• /
• pp.178-192
• /
• 2021

File system forensics typically focus on the contents or timestamps of a file, and it is common to work around file/directory centers. But to recover a deleted file on the disk or use a carving technique to find and connect partial missing content, the evidence must be analyzed using cluster-centered analysis. Forensics tools such as EnCase, TSK, and X-ways, provide a basic ability to get information about disk clusters, but these are not the core functions of the tools. Alternatively, Sysinternals' DiskView tool provides a more intuitive visualization function, which makes it easier to obtain information around disk clusters. In addition, most current tools are for Windows. There are very few forensic analysis tools for MacOS, and furthermore, cluster analysis tools are very rare. In this paper, we developed a tool named FACT (Forensic Analyzer based Cluster Information Tool) for analyzing the state of clusters in a HFS+ file system, for digital forensics. The FACT consists of three features, a Cluster based analysis, B-tree based analysis, and Directory based analysis. The Cluster based analysis is the main feature, and was basically developed for cluster analysis. The FACT tool's cluster visualization feature plays a central role. The FACT tool was programmed in two programming languages, C/C++ and Python. The core part for analyzing the HFS+ filesystem was programmed in C/C++ and the visualization part is implemented using the Python Tkinter library. The features in this study will evolve into key forensics tools for use in MacOS, and by providing additional GUI capabilities can be very important for cluster-centric forensics analysis.

• 한국식생활문화학회지
• /
• 제26권6호
• /
• pp.574-582
• /
• 2011

The aim of this study was to classify Korean consumers based on their food-related lifestyle type, and to investigate the relationship between sushi consumption and food-related lifestyle type. Self-reported questionnaires were completed by 300 Korean adults. The SPSS 18.0 program was used to analyze the samples. Data was analyzed by frequency, descriptive factor, reliability, cluster analysis, ANOVA, and chi-square test. A factor analysis extracted four factors comprising foodrelated lifestyle, which we named Health-seeking (factor 1), Taste-seeking (factor 2), Convenience-seeking (factor 3), and Economy-seeking (factor 4). According to a cluster analysis based on those four factors, consumers were classified into three clusters. Cluster 1 was the Taste and Health-seeking cluster, Cluster 2 was the Convenience-seeking cluster, and Cluster 3 was the Passive Eating Habits cluster. The results also indicated that the selection attributes of each cluster were significantly different in terms of perception, the global state of sushi, sushi preference, frequency, companions, place of sushi consumption, and preference for different sushi sub-ingredients. Based on these results, consumer characteristics in the sushi market are discussed.

• World Technopolis Review
• /
• 제4권2호
• /
• pp.87-103
• /
• 2015

This paper aims to explore how firms develop and grow in regional clusters based in a developing country. The argument is that start-ups / small and large firms are able to grow by developing linkages or networks for resources within clusters - and this tenet is based on studies of firms that are based from such clusters as Silicon Valley in the US, Cambridge in UK and other clusters from which have evolved over long periods of time. Most of the time we hear narratives from the developed world where there are brownfield cluster development efforts. In developing countries governments are making efforts to develop clusters from scratch - which in this paper we term as greenfield cluster versus a brownfield development, which is where the cluster is developed based on existing and new organisations in a region. In this paper, we believe the context of clusters can be important in determining the way firms develop linkages for their growth - and we look at two contexts in Malaysia ie. A greenfield cluster and a brownfield cluster. The paper presents findings from case studies of firms in a greenfield cluster (Cyberjaya) and a brown field cluster (Penang) in Malaysia. The cases reveal fairly different approaches to development of linkages or networks, which we hope will provides insights to cluster development officials and policy makers and implications to researchers for developing studies of clusters and innovation systems.

• 한국콘텐츠학회논문지
• /
• 제9권9호
• /
• pp.105-113
• /
• 2009

클러스터 기반의 라우팅 기법에서의 안전한 데이터 통신을 위해서는 기존의 키 관리 방식은 적합하지 않다. 왜냐하면 클러스터 기반에서는 매 라운드 마다 클러스터 헤드가 변경되기 때문에, 안전한 통신을 위해 각 멤버 노드들과 인증이나 공유키 설정 단계를 거쳐야 한다. 또한 기존의 키 관리 메커니즘에서는 대부분 센서 네트워크 안의 모든 노드에 대해 이동성을 부여하지 않았기 때문에, 노드의 이동성을 고려하게 되면 안전한 통신을 위한 커다란 오버 헤드가 발생한다. 따라서 본 논문에서는 이동성과 새로운 노드의 삽입이 빈번한 경우에도 안전하고 효율적인 클러스터 기반에 적합한 키 관리 메커니즘을 제안한다.