• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.12
• /
• pp.6081-6088
• /
• 2012

An unequal clustering method in wireless sensor networks is the technique that forms the cluster of different size. This method decreases whole energy consumption by solving the hot spot problem. In this paper, I propose a layer-based dynamic unequal clustering using the unequal clustering model. This method decreases whole energy consumption and maintain that equally using optimal cluster's number and cluster head position. I also show that proposed method is better than previous clustering method at the point of network lifetime.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.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.

• Journal of Communications and Networks
• /
• v.15 no.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.

• Journal of Electrical Engineering and Technology
• /
• v.7 no.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.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.219-222
• /
• 2011

There are number of methods that track the movement of an object or the change of state, such as Kalman filter, particle filter, dynamic clustering, and so on. Amongst these method, dynamic clustering method is an useful way to track cluster across multiple data frames and analyze their trend. In this paper we suggest the similarity-based dynamic clustering method, and verifies it's performance by simulation. Proposed dynamic clustering method is how to determine the same clusters for each continuative frame. The same clusters have similar characteristics across adjacent frames. The change pattern of cluster's characteristics in each time frame is throughly studied. Clusters in each time frames are matched against each others to see their similarity. Mamdani fuzzy model is used to determine similarity based matching algorithm. The proposed algorithm is applied to radar reflectivity data over time domain. We were able to observe time dependent characteristic of the clusters.

• Journal of Information Processing Systems
• /
• v.7 no.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.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.54 no.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.

• ETRI Journal
• /
• v.43 no.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.

• The Korean Journal of Applied Statistics
• /
• v.29 no.1
• /
• pp.193-203
• /
• 2016

This paper forecasts electricity demand as a critical element of a demand management system in Smart Grid environment. We present a prediction method of using a combination of predictive values by time series clustering. Periodogram-based normalized clustering, predictive analysis clustering and dynamic time warping (DTW) clustering are proposed for time series clustering methods. Double Seasonal Holt-Winters (DSHW), Trigonometric, Box-Cox transform, ARMA errors, Trend and Seasonal components (TBATS), Fractional ARIMA (FARIMA) are used for demand forecasting based on clustering. Results show that the time series clustering method provides a better performances than the method using total amount of electricity demand in terms of the Mean Absolute Percentage Error (MAPE).

• Communications for Statistical Applications and Methods
• /
• v.29 no.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.