• 제목/요약/키워드: hierarchical cluster

검색결과 538건 처리시간 0.023초

Proposal of a hierarchical topology and spatial reuse superframe for enhancing throughput of a cluster-based WBAN

  • Hiep, Pham Thanh;Thang, Nguyen Nhu;Sun, Guanghao;Hoang, Nguyen Huy
    • ETRI Journal
    • /
    • 제41권5호
    • /
    • pp.648-657
    • /
    • 2019
  • A cluster topology was proposed with the assumption of zero noise to improve the performance of wireless body area networks (WBANs). However, in WBANs, the transmission power should be reduced as low as possible to avoid the effect of electromagnetic waves on the human body and to extend the lifetime of a battery. Therefore, in this work, we consider a bit error rate for a cluster-based WBAN and analyze the performance of the system while the transmission of sensors and cluster headers (CHs) is controlled. Moreover, a hierarchical topology is proposed for the cluster-based WBAN to further improve the throughput of the system; this proposed system is called as the hierarchical cluster WBAN. The hierarchical cluster WBAN is combined with a transmission control scheme, that is, complete control, spatial reuse superframe, to increase the throughput. The proposed system is analyzed and evaluated based on several factors of the system model, such as signal-to-noise ratio, number of clusters, and number of sensors. The calculation result indicates that the proposed hierarchical cluster WBAN outperforms the cluster-based WBAN in all analyzed scenarios.

Selection of Cluster Topic Words in Hierarchical Clustering using K-Means Algorithm

  • Lee Shin Won;Yi Sang Seon;An Dong Un;Chung Sung Jong
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2004년도 학술대회지
    • /
    • pp.885-889
    • /
    • 2004
  • Fast and high-quality document clustering algorithms play an important role in providing data exploration by organizing large amounts of information into a small number of meaningful clusters. Hierarchical clustering improves the performance of retrieval and makes that users can understand easily. For outperforming of clustering, we implemented hierarchical structure with variety and readability, by careful selection of cluster topic words and deciding the number of clusters dynamically. It is important to select topic words because hierarchical clustering structure is summarizes result of searching. We made choice of noun word as a cluster topic word. The quality of topic words is increased $33\%$ as follows. As the topic word of each cluster, the only noun word is extracted for the top-level cluster and the used topic words for the children clusters were not reused.

  • PDF

A Two level Detection of Routing layer attacks in Hierarchical Wireless Sensor Networks using learning based energy prediction

  • Katiravan, Jeevaa;N, Duraipandian;N, Dharini
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권11호
    • /
    • pp.4644-4661
    • /
    • 2015
  • Wireless sensor networks are often organized in the form of clusters leading to the new framework of WSN called cluster or hierarchical WSN where each cluster head is responsible for its own cluster and its members. These hierarchical WSN are prone to various routing layer attacks such as Black hole, Gray hole, Sybil, Wormhole, Flooding etc. These routing layer attacks try to spoof, falsify or drop the packets during the packet routing process. They may even flood the network with unwanted data packets. If one cluster head is captured and made malicious, the entire cluster member nodes beneath the cluster get affected. On the other hand if the cluster member nodes are malicious, due to the broadcast wireless communication between all the source nodes it can disrupt the entire cluster functions. Thereby a scheme which can detect both the malicious cluster member and cluster head is the current need. Abnormal energy consumption of nodes is used to identify the malicious activity. To serve this purpose a learning based energy prediction algorithm is proposed. Thus a two level energy prediction based intrusion detection scheme to detect the malicious cluster head and cluster member is proposed and simulations were carried out using NS2-Mannasim framework. Simulation results achieved good detection ratio and less false positive.

계층 클러스터 구조를 위한 캐쉬 일관성 프로토콜의 설계 및 구현 (A Design and Implementation of Cache Coherence Protocol for Hierarchical Cluster Architecture)

  • 박신민;최창훈;김성천
    • 한국통신학회논문지
    • /
    • 제19권7호
    • /
    • pp.1282-1295
    • /
    • 1994
  • 본 논문에서는 계층 버스 구조를 기반으로 하는 계층 클러스터 다중프로세서 시스템(hierarchical cluster multiprocessor system)을 제안하고, 이 구조에 효율적인 캐쉬 일관성 프로토콜을 설계 및 구현한다. 계층 클러스터 구조는 클러스터 수의 증가에 따라 버스 계층을 추가함으로써 기존의 단일 버스 시스템에서의 병목 현상(bottleneck)을 없애주어 시스템 확장이 용이하게 된다. 제안된 캐쉬 프로토콜은 일반적인 N-레벨 (N>2) 계층 클러스터 구조에 적용할 수 있도록 설계되었다. 이를 시스템 버스에 구현하기 위하여 기존의 팬디드 프로토콜을 확장하였고 캐쉬 일관성 동작들을 확장된 팬디드 프로토콜상에서 설명한다.

  • PDF

Practical Data Transmission in Cluster-Based Sensor Networks

  • Kim, Dae-Young;Cho, Jin-Sung;Jeong, Byeong-Soo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제4권3호
    • /
    • pp.224-242
    • /
    • 2010
  • Data routing in wireless sensor networks must be energy-efficient because tiny sensor nodes have limited power. A cluster-based hierarchical routing is known to be more efficient than a flat routing because only cluster-heads communicate with a sink node. Existing hierarchical routings, however, assume unrealistically large radio transmission ranges for sensor nodes so they cannot be employed in real environments. In this paper, by considering the practical transmission ranges of the sensor nodes, we propose a clustering and routing method for hierarchical sensor networks: First, we provide the optimal ratio of cluster-heads for the clustering. Second, we propose a d-hop clustering scheme. It expands the range of clusters to d-hops calculated by the ratio of cluster-heads. Third, we present an intra-cluster routing in which sensor nodes reach their cluster-heads within d-hops. Finally, an inter-clustering routing is presented to route data from cluster-heads to a sink node using multiple hops because cluster-heads cannot communicate with a sink node directly. The efficiency of the proposed clustering and routing method is validated through extensive simulations.

센서 네트워크에서 계층적 필터링을 이용한 에너지 절약 방안 (An Energy Saving Method using Hierarchical Filtering in Sensor Networks)

  • 김진수
    • 한국산학기술학회논문지
    • /
    • 제8권4호
    • /
    • pp.768-774
    • /
    • 2007
  • 본 논문에서는 센서 네트워크의 수명을 길게 하기 위해 각 센서 및 클러스터 헤드에서의 데이터 전송량을 줄이기 위한 방법을 제안한다. 즉, 센서의 에너지 소모를 줄이기 위해 계층적 필터링을 제안한다. 계층적 필터링이란 센서 네트워크를 두 계층으로 나누어 필터링하는 것이다. 1계층 필터링은 클러스터 멤버에서 클러스터 헤드로 데이터를 전송시 필터링을 수행하고, 2계층 필터링은 클러스터 헤드에서 기지국으로 데이터를 전송시 필터링을 수행한다. 이는 일반적으로 필터의 폭을 넓혀 필터링을 많이 하는 것보다 필터링 효율은 증대시키면서 필터링에 따른 데이터 부정확성을 최소한 줄이는 효과를 가진다.

  • PDF

HRKT: A Hierarchical Route Key Tree based Group Key Management for Wireless Sensor Networks

  • Jiang, Rong;Luo, Jun;Wang, Xiaoping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권8호
    • /
    • pp.2042-2060
    • /
    • 2013
  • In wireless sensor networks (WSNs), energy efficiency is one of the most essential design considerations, since sensor nodes are resource constrained. Group communication can reduce WSNs communication overhead by sending a message to multiple nodes in one packet. In this paper, in order to simultaneously resolve the transmission security and scalability in WSNs group communications, we propose a hierarchical cluster-based secure and scalable group key management scheme, called HRKT, based on logic key tree and route key tree structure. The HRKT scheme divides the group key into cluster head key and cluster key. The cluster head generates a route key tree according to the route topology of the cluster. This hierarchical key structure facilitates local secure communications taking advantage of the fact that the nodes at a contiguous place usually communicate with each other more frequently. In HRKT scheme, the key updates are confined in a cluster, so the cost of the key updates is reduced efficiently, especially in the case of massive membership changes. The security analysis shows that the HRKT scheme meets the requirements of group communication. In addition, performance simulation results also demonstrate its efficiency in terms of low storage and flexibility when membership changes massively.

Fabrication of Hierarchical Nanostructures Using Vacuum Cluster System

  • Lee, Jun-Young;Yeo, Jong-Souk
    • 한국진공학회:학술대회논문집
    • /
    • 한국진공학회 2012년도 제43회 하계 정기 학술대회 초록집
    • /
    • pp.389-390
    • /
    • 2012
  • In this study, we fabricate a superhydrophobic surface made of hierarchical nanostructures that combine wax crystalline structure with moth-eye structure using vacuum cluster system and measure their hydrophobicity and durability. Since the lotus effect was found, much work has been done on studying self-cleaning surface for decades. The surface of lotus leaf consists of multi-level layers of micro scale papillose epidermal cells and epicuticular wax crystalloids [1]. This hierarchical structure has superhydrophobic property because the sufficiently rough surface allows air pockets to form easily below the liquid, the so-called Cassie state, so that the relatively small area of water/solid interface makes the energetic cost associated with corresponding water/air interfaces smaller than the energy gained [2]. Various nanostructures have been reported for fabricating the self-cleaning surface but in general, they have the problem of low durability. More than two nanostructures on a surface can be integrated together to increase hydrophobicity and durability of the surface as in the lotus leaf [3,5]. As one of the bio-inspired nanostructures, we introduce a hierarchical nanostructure fabricated with a high vacuum cluster system. A hierarchical nanostructure is a combination of moth-eye structure with an average pitch of 300 nm and height of 700 nm, and the wax crystalline structure with an average width and height of 200 nm. The moth-eye structure is fabricated with deep reactive ion etching (DRIE) process. $SiO_2$ layer is initially deposited on a glass substrate using PECVD in the cluster system. Then, Au seed layer is deposited for a few second using DC sputtering process to provide stochastic mask for etching the underlying $SiO_2$ layer with ICP-RIE so that moth-eye structure can be fabricated. Additionally, n-hexatriacontane paraffin wax ($C_{36}H_{74}$) is deposited on the moth-eye structure in a thermal evaporator and self-recrystallized at $40^{\circ}C$ for 4h [4]. All of steps are conducted utilizing vacuum cluster system to minimize the contamination. The water contact angles are measured by tensiometer. The morphology of the surface is characterized using SEM and AFM and the reflectance is measured by spectrophotometer.

  • PDF

계층적 불균형 클러스터링 기법을 이용한 에너지 소비 모델 (An Energy Consumption Model using Hierarchical Unequal Clustering Method)

  • 김진수;신승수
    • 한국산학기술학회논문지
    • /
    • 제12권6호
    • /
    • pp.2815-2822
    • /
    • 2011
  • 무선 센서 네트워크에서 클러스터링 기법은 클러스터를 형성하여 데이터를 병합한 후 한 번에 전송해서 에너지를 효율적으로 사용하는 기법이다. 본 논문에서는 클러스터 그룹 모델을 이용한 계층적 불균형 클러스터링 기법을 제안한다. 이 기법은 전체 네트워크를 두 개의 계층으로 나누어 클러스터 그룹으로 형성된 2계층의 데이터를 병합해서 1계층으로 보내고, 다시 1계층에서 데이터를 병합하여 기지국으로 보낸다. 이와 같이 제안된 기법은 다중 홉 통신 구조와 클러스터 그룹 모델을 같이 이용함으로써 전체 에너지 소모량을 줄인다. 이러한 방식은 다중 홉 통신이지만 불균형 클러스터를 구축하여 핫 스팟 문제를 어느 정도 해결하고 있다. 실험을 통하여 제안된 계층적 불균형 클러스터링 기법이 이전의 클러스터링 기법보다 네트워크 에너지 효율이 향상되었음을 보였다.

Clustering Algorithm of Hierarchical Structures in Large-Scale Wireless Sensor and Actuator Networks

  • Quang, Pham Tran Anh;Kim, Dong-Seong
    • Journal of Communications and Networks
    • /
    • 제17권5호
    • /
    • pp.473-481
    • /
    • 2015
  • In this study, we propose a clustering algorithm to enhance the performance of wireless sensor and actuator networks (WSANs). In each cluster, a multi-level hierarchical structure can be applied to reduce energy consumption. In addition to the cluster head, some nodes can be selected as intermediate nodes (INs). Each IN manages a subcluster that includes its neighbors. INs aggregate data from members in its subcluster, then send them to the cluster head. The selection of intermediate nodes aiming to optimize energy consumption can be considered high computational complexity mixed-integer linear programming. Therefore, a heuristic lowest energy path searching algorithm is proposed to reduce computational time. Moreover, a channel assignment scheme for subclusters is proposed to minimize interference between neighboring subclusters, thereby increasing aggregated throughput. Simulation results confirm that the proposed scheme can prolong network lifetime in WSANs.