• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.5
• /
• pp.155-162
• /
• 2014

We proposed a 2 level tree based cluster based routing protocol for mobile ad hoc networks. it is our crucial goal to establish improved clustering's structure in order to extend average node life-time and elevate the average packet delivery ratio. Because of insufficient wireless resources and energy, the method to form and manage clusters is useful for increasing network stability. but cluster-head fulfills roles as a host and a router in clustering protocol of Ad hoc networks environment. Therefore energy exhaustion of cluster-head causes communication interruption phenomenon. Effective management of cluster-head is key-point which determines the entire network performance. The scheme focuses on improving the performance the life time of the network and throughput through the management of cluster-heads and its neighbor nodes. In simulation, we demonstrated that it would obtain averagely better 17% performance than LS2RP.

• Journal of Korea Multimedia Society
• /
• v.11 no.5
• /
• pp.633-640
• /
• 2008

Sensor node clustering is one of the most popular research topics to reduce the energy of sensor nodes in wireless sensor networks. Previous researches, however, did not consider prediction effects of sensed environment information on TDMA scheduling of a cluster, resulting energy inefficiency. In this paper, we suggest an energy efficient cluster-based scheduling scheme that can be applied flexibly to many environment information systems. This scheme reflects the environment information obtained at the application layer to the MAC layer to set up the schedule of a cluster. The application layer information sets up the scheduling referring to the similarity of sensed data of cluster head. It determines the data transmission considering the result of similarity. We show that our scheme is more efficient than LEACH and LEACH-C in energy, which are popular clustering schemes, through simulation.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.8
• /
• pp.149-156
• /
• 2010

As following the development of the USN technology, sensor node used in sensor network has capability of quick data process and storage to support efficient network configuration is enabled. In addition, tree-based structure was transformed to cluster in the construction of sensor network. However, query processing based on existing tree structure could be inefficient under the cluster-based network. In this paper, we suggest energy efficient query processing mechanism using filtering through data attribute classification in cluster-based sensor network. The suggestion mechanism use advantage of cluster-based network so reduce energy of query processing and designed more intelligent query dissemination. And, we prove excellence of energy efficient side with MATLab.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.5
• /
• pp.870-878
• /
• 2008

The level of security of most sensor nodes that comprise the sensor networks is low, but because of the low computing power and small storage capacity, it is even very difficult to apply a security algorithm efficiently to the sensor nodes. Therefore, preventing the join of an illegal node to a sensor network is impossible, and the transmitting information is easily exposed and overheard when the transmitting algorithm of the sensor node is hewn. In this paper, we propose a group key management scheme for the sensor network using polar coordinates, so that the sensor nodes can deliver information securely inside a cluster and any illegal node is prevented from joining to the cluster where a sensor network is composed of many clusters. In the proposed scheme, all of the sensor nodes in a cluster set up the authentication keys based on the pivot value provided by the CH. The intensive simulations show that the proposed scheme outperforms the pair-wise scheme in terms of the secure key management and the prevention of the illegal nodes joining to the network.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.401-405
• /
• 2007

In sensor network, cluster based routing protocol about efficient energy usage method has researched variously. But existing cluster based routing protocol have problems. one of the problem is sensor nodes's imbalance energy consumption problem at cluster reconstruction. anther is non- connection problem between header node and spc node when they are far from each other, not properly connected. We propose cluster re-division and header node of multihop transmission method in this paper. The cluster re-division method is the method that re-divides existing routing protocol with the small-scale cluster and multihop transmission method is the method regarding the relay transmission between the header nodes. Through the simulation, the proposed routing mechanism shows more excellent than exiting routing protocol in balance energy consumption and energy efficiency.

• The KIPS Transactions:PartD
• /
• v.10D no.6
• /
• pp.935-948
• /
• 2003

An online scaling method adds new nodes to the shared-nothing database cluster and makes tables be reorganized while the system is running. The objective is to share the workload with many nodes and increase the capacity of cluster systems. The existing online scaling method, however, has two problems. One is the degradation of response time and transactions throughput due to the additional overheads of data transfer and replica's condidtency. The other is and inefficient recovery mechanism in which the overall scaling transaction is aborted by a fault. These problems deteriorate the availability of shared-nothing database cluster. To avoid the additional overheads throughout the scaling period, our scalingmethod consists of twophases : a parallel data transfer phase and a combination phase. The parallel data transferred datausing reduces the size of data transfer by dividing the data into the number of replicas. The combination phase combines the transferred datausing resources of spare nodes. Also, our method reduces the possibility of failure throughout the scaling period and improves the availability of the database cluster.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.6
• /
• pp.15-21
• /
• 2009

The goal of wireless sensor networks is to collect sensing data on specific region over wireless communication. Sink node gathers all local sensing data, processes and transmits them to users who use sensor networks. Generally, senor nodes are low-cost, low power devices with limited sensing, computation and wireless communication capabilities. And sensor network applies to multi-hop communication on large-scale network. As neighboring sensor nodes have similar data, clustering is more effective technique for 'data-aggregation'. In cluster formation technique based on multi-hop, it is necessary that the number of cluster member nodes should be distributed equally because of the balance of cluster formation To achieve this, we propose a method to customize cluster member nodes for energy-efficiency in wireless sensor networks.

• Smart Media Journal
• /
• v.10 no.3
• /
• pp.23-30
• /
• 2021

Although the manufacturing time series data clustering technique is an important grouping solution in the field of detecting and improving manufacturing large data-based equipment and process defects, it has a disadvantage of low accuracy when applying the existing static data target clustering technique to time series data. In this paper, an evolutionary computation-based time series cluster analysis approach is presented to improve the coherence of existing clustering techniques. To this end, first, the image shape resulting from the manufacturing process is converted into one-dimensional time series data using linear scanning, and the optimal sub-clusters for hierarchical cluster analysis and split cluster analysis are derived based on the Pearson distance metric as the target of the transformation data. Finally, by using a genetic algorithm, an optimal cluster combination with minimal similarity is derived for the two cluster analysis results. And the performance superiority of the proposed clustering is verified by comparing the performance with the existing clustering technique for the actual manufacturing process image.

• Journal of the Institute of Convergence Signal Processing
• /
• v.14 no.1
• /
• pp.45-50
• /
• 2013

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 a sink node to pass collected data. If clusters are located at a long distance from the sink node, the cluster headers exhaust a lot of energy in order to transfer the data. As a consequence, the life of sensors is shorten and re-clustering is needed. In the process of clustering, sensor nodes consume some energy and the energy depletion of the cluster headers meet another energy exhaustion. A method of transferring data from cluster headers to the sink using neighbor clusters is needed for saving energy. In this paper, we propose a novel routing method using a multi-hop transmission method in cluster sensor networks. This method uses the topology matrix which presents cluster topology. One-hop routing and two-hop routing are proposed in order to increase the energy efficiency.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.17-22
• /
• 2011

The underwater environments are quite different from the terrestrial ones in terms of the communication channel and constrains. In underwater wireless sensor network, the probability of node failure is high because sensor nodes are deployed in more harsh environments than the ground based networks and moved by waves and currents. There are researches considering the communication environments of underwater to improve the data transmission throughput. In this paper, we present a checkpointing scheme of the cluster heads that recoveries from a cluster head failure quickly. Experimental results show that the proposed scheme enhances the reliability of the networks and more efficient in terms of the energy consumption and the recovery latency than without checkpointing.