• 제목/요약/키워드: Dynamic clustering

검색결과 271건 처리시간 0.026초

대규모 무선 센서 네트워크에서 계층 기반의 동적 불균형 클러스터링 기법 (A Layer-based Dynamic Unequal Clustering Method in Large Scale Wireless Sensor Networks)

  • 김진수
    • 한국산학기술학회논문지
    • /
    • 제13권12호
    • /
    • pp.6081-6088
    • /
    • 2012
  • 불균형 클러스터링은 클러스터의 크기를 서로 다른 크기로 나누는 방법으로 균형 클러스터링에 비해 핫스팟 문제를 어느 정도 해결할 수 있으므로 전체 네트워크의 에너지 소모량을 줄인다. 본 논문에서는 불균형 클러스터링 모델을 이용하여 계층 기반의 동적 불균형 클러스터링을 제안한다. 이는 라운드별로 최적의 클러스터 수 및 클러스터 헤드 위치를 제공함으로써 전체 네트워크에 대한 에너지 소모를 균형 있게 하고 또한 네트워크 수명을 연장시킨다. 실험을 통하여 제안된 기법이 이전 클러스터링 기법보다 네트워크 수명이 연장되었음을 보였다.

Terminal-based Dynamic Clustering Algorithm in Multi-Cell Cellular System

  • Ni, Jiqing;Fei, Zesong;Xing, Chengwen;Zhao, Di;Kuang, Jingming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권9호
    • /
    • pp.2086-2097
    • /
    • 2012
  • A terminal-based dynamic clustering algorithm is proposed in a multi-cell scenario, where the user could select the cooperative BSs from the predetermined static base stations (BSs) set based on dynamic channel condition. First, the user transmission rate is derived based on linear precoding and per-cell feedback scheme. Then, the dynamic clustering algorithm can be implemented based on two criteria: (a) the transmission rate should meet the user requirement for quality of service (QoS); (b) the rate increment exceeds the predetermined constant threshold. By adopting random vector quantization (RVQ), the optimized number of cooperative BSs and the corresponding channel conditions are presented respectively. Numerical results are given and show that the performance of the proposed method can improve the system resources utilization effectively.

Efficient and Secure Routing Protocol forWireless Sensor Networks through SNR Based Dynamic Clustering Mechanisms

  • Ganesh, Subramanian;Amutha, Ramachandran
    • Journal of Communications and Networks
    • /
    • 제15권4호
    • /
    • pp.422-429
    • /
    • 2013
  • Advances in wireless sensor network (WSN) technology have enabled small and low-cost sensors with the capability of sensing various types of physical and environmental conditions, data processing, and wireless communication. In the WSN, the sensor nodes have a limited transmission range and their processing and storage capabilities as well as their energy resources are limited. A triple umpiring system has already been proved for its better performance in WSNs. The clustering technique is effective in prolonging the lifetime of the WSN. In this study, we have modified the ad-hoc on demand distance vector routing by incorporating signal-to-noise ratio (SNR) based dynamic clustering. The proposed scheme, which is an efficient and secure routing protocol for wireless sensor networks through SNR-based dynamic clustering (ESRPSDC) mechanisms, can partition the nodes into clusters and select the cluster head (CH) among the nodes based on the energy, and non CH nodes join with a specific CH based on the SNR values. Error recovery has been implemented during the inter-cluster routing in order to avoid end-to-end error recovery. Security has been achieved by isolating the malicious nodes using sink-based routing pattern analysis. Extensive investigation studies using a global mobile simulator have shown that this hybrid ESRP significantly improves the energy efficiency and packet reception rate as compared with the SNR unaware routing algorithms such as the low energy aware adaptive clustering hierarchy and power efficient gathering in sensor information systems.

Dynamic Hysteresis Model Based on Fuzzy Clustering Approach

  • Mourad, Mordjaoui;Bouzid, Boudjema
    • Journal of Electrical Engineering and Technology
    • /
    • 제7권6호
    • /
    • pp.884-890
    • /
    • 2012
  • Hysteretic behavior model of soft magnetic material usually used in electrical machines and electronic devices is necessary for numerical solution of Maxwell equation. In this study, a new dynamic hysteresis model is presented, based on the nonlinear dynamic system identification from measured data capabilities of fuzzy clustering algorithm. The developed model is based on a Gustafson-Kessel (GK) fuzzy approach used on a normalized gathered data from measured dynamic cycles on a C core transformer made of 0.33mm laminations of cold rolled SiFe. The number of fuzzy rules is optimized by some cluster validity measures like 'partition coefficient' and 'classification entropy'. The clustering results from the GK approach show that it is not only very accurate but also provides its effectiveness and potential for dynamic magnetic hysteresis modeling.

퍼지모델을 이용한 유사성 기반의 동적 클러스터링 (Similarity-based Dynamic Clustering Using Radar Reflectivity Data)

  • 이한수;김수대;김용현;김성신
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2011년도 추계학술대회
    • /
    • pp.219-222
    • /
    • 2011
  • 어떠한 객체의 움직임을 추적하거나 상태변화를 추정하기 위해서 사용하는 방법으로는 칼만필터, 파티클 필터, 동적 클러스터링 등이 있다. 이 중 동적클러스터링 기법은 여러 프레임에 걸쳐 클러스터를 추적하고 변화 경향을 분석하는데 유용한 방법이다. 본 논문에서는 유사성 기반의 동적 클러스터링 방법을 제안하고 시뮬레이션 하여 검증하였다. 제안한 동적 클러스터링 방법은 연속된 각 프레임에 대해 유사한 특성을 가지는 클러스터를 인접한 프레임에 걸쳐 동일한 클러스터로 판단하는 방법이다. 각 정지 프레임에서의 클러스터의 특성을 이용하여 프레임의 변화를 분석하고 유사성이 높은 클러스터들을 동일 클러스터로 지정하였다. 유사성 판단 방법은 Mamdani방식의 퍼지 모델을 제안하였다. 제안한 알고리즘은 시간에 대해 연속성을 가진 레이더 반사도 데이터에 적용하였고 시간의 흐름에 따른 클러스터의 변화를 관측할 수 있었다.

  • PDF

A Clustering Protocol with Mode Selection for Wireless Sensor Network

  • Kusdaryono, Aries;Lee, Kyung-Oh
    • Journal of Information Processing Systems
    • /
    • 제7권1호
    • /
    • pp.29-42
    • /
    • 2011
  • Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. One critical issue in wireless sensor networks is how to gather sensed information in an energy efficient way, since their energy is limited. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor networks. In this paper, we introduce a clustering protocol with mode selection (CPMS) for wireless sensor networks. Our scheme improves the performance of BCDCP (Base Station Controlled Dynamic Clustering Protocol) and BIDRP (Base Station Initiated Dynamic Routing Protocol) routing protocol. In CPMS, the base station constructs clusters and makes the head node with the highest residual energy send data to the base station. Furthermore, we can save the energy of head nodes by using the modes selection method. The simulation results show that CPMS achieves longer lifetime and more data message transmissions than current important clustering protocols in wireless sensor networks.

안정도 지수와 에너지 마진을 이용한 불안정 발전기의 clustering 법 (A Novel Method for Clustering Critical Generator by using Stability Indices and Energy Margin)

  • 장동환;정연재;전영환;남해곤
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제54권9호
    • /
    • pp.441-448
    • /
    • 2005
  • On-line dynamic security assessment is becoming more and more important for the stable operation of power systems as load level increases. The necessity is getting apparent under Electricity Market environments, as operation of power system is exposed to more various operating conditions. For on-line dynamic security assessment, fast transient stability analysis tool is required for contingency selection. The TEF(Transient Energy Function) method is a good candidate for this purpose. The clustering of critical generators is crucial for the precise and fast calculation of energy margin. In this paper, we propose a new method for fast decision of mode of instability by using stability indices. Case study shows very promising results.

Model of dynamic clustering-based energy-efficient data filtering for mobile RFID networks

  • Vo, Viet Minh Nhat;Le, Van Hoa
    • ETRI Journal
    • /
    • 제43권3호
    • /
    • pp.427-435
    • /
    • 2021
  • Data filtering is an essential task for improving the energy efficiency of radiofrequency identification (RFID) networks. Among various energy-efficient approaches, clustering-based data filtering is considered to be the most effective solution because data from cluster members can be filtered at cluster heads before being sent to base stations. However, this approach quickly depletes the energy of cluster heads. Furthermore, most previous studies have assumed that readers are fixed and interrogate mobile tags in a workspace. However, there are several applications in which readers are mobile and interrogate fixed tags in a specific area. This article proposes a model for dynamic clustering-based data filtering (DCDF) in mobile RFID networks, where mobile readers are re-clustered periodically and the cluster head role is rotated among the members of each cluster. Simulation results show that DCDF is effective in terms of balancing energy consumption among readers and prolonging the lifetime of the mobile RFID networks.

스마트 그리드에서의 시계열 군집분석을 통한 전력수요 예측 연구 (A study on electricity demand forecasting based on time series clustering in smart grid)

  • 손흥구;정상욱;김삼용
    • 응용통계연구
    • /
    • 제29권1호
    • /
    • pp.193-203
    • /
    • 2016
  • 본 논문은 ICT기반 시장에서의 수요관리시스템에서의 핵심 요소인 전력 수요 예측을 위하여, 전체 사용량을 기반으로 예측 하는 방식이 아닌, 시계열 기반 군집분석을 통한 군집별 예측량의 결합을 실시하였다. 시계열 군집 분석 방법으로서 Periodogram 기반의 정규화 군집분석, 예측 기반의 군집분석, DTW(Dynamic Time Warping)를 이용하여 군집화를 시도하였으며, 군집 별 수요예측 모형으로서 DSHW(Double Seasonal Holt-Winters) 모형, TBATS(Trigonometric, Box-Cox transform, ARMA errors, Trend and Seasonal components) 모형, FARIMA(Fractional ARIMA) 모형을 사용하여 예측을 실시하였다. 전체 사용량을 기반으로 예측 하는 방식이 아닌, 군집분석을 통한 군집별 예측량의 결합이 더 낮은 MAPE로 나타남에 따라 우수한 예측 방법으로 판단되었다.

Grouping stocks using dynamic linear models

  • Sihyeon, Kim;Byeongchan, Seong
    • Communications for Statistical Applications and Methods
    • /
    • 제29권6호
    • /
    • pp.695-708
    • /
    • 2022
  • Recently, several studies have been conducted using state space model. In this study, a dynamic linear model with state space model form is applied to stock data. The monthly returns for 135 Korean stocks are fitted to a dynamic linear model, to obtain an estimate of the time-varying 𝛽-coefficient time-series. The model formula used for the return is a capital asset pricing model formula explained in economics. In particular, the transition equation of the state space model form is appropriately modified to satisfy the assumptions of the error term. k-shape clustering is performed to classify the 135 estimated 𝛽 time-series into several groups. As a result of the clustering, four clusters are obtained, each consisting of approximately 30 stocks. It is found that the distribution is different for each group, so that it is well grouped to have its own characteristics. In addition, a common pattern is observed for each group, which could be interpreted appropriately.