• The Journal of the Korea Contents Association
• /
• v.10 no.12
• /
• pp.101-108
• /
• 2010

Many works on energy-efficient cluster event detection schemes have been done considering the energy restriction of sensor networks. The existing cluster event detection schemes transmit only the boundary information of detected cluster event nodes to the base station. However, If the range of the cluster event is widened and the distribution density of sensor nodes is high, the existing cluster event detection schemes need high transmission costs due to the increase of sensor nodes located in the event boundary. In this paper, we propose an energy-efficient cluster event detection scheme using the minimum boundary polygons (MBP) that can compress and summarize the information of event boundary nodes. The proposed scheme represents the boundary information of cluster events using the MBP creation technique in the large scale of sensor network environments. In order to show the superiority of the proposed scheme, we compare it with the existing scheme through the performance evaluation. Simulation results show that our scheme maintains about 92% accuracy and decreases about 80% in energy consumption to detect the cluster event over the existing schemes on average.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.12
• /
• pp.4991-4996
• /
• 2010

Clustering method in wireless sensor network is the technique that forms the cluster to aggregate the data and transmit them at the same time that they can use the energy efficiently. Even though cluster group model is based on clustering, it differs from previous method that reducing the total energy consumption by separating energy overload to cluster group head and cluster head. In this thesis, I calculate the optimal cluster group number and cluster number in this kind of cluster group model according to threshold of energy consumption model. By using that I can minimize the total energy consumption in sensor network and maximize the network lifetime. I also show that proposed cluster group model is better than previous clustering method at the point of network energy efficiency.

• 한국데이터정보과학회:학술대회논문집
• /
• 2006.04a
• /
• pp.63-76
• /
• 2006

Several clustering algorithms to analyze gene expression data and cluster validation techniques that assess the quality of their outcomes, have been suggested, but evaluations of these cluster validation techniques have seldom been implemented. In this paper we compared various cluster validity indices for simulation data and real genomic data, and found that Dunn's index is more effective and robust through small simulations and with real gene expression data.

• The Journal of the Korea Contents Association
• /
• v.10 no.2
• /
• pp.14-24
• /
• 2010

Because WSNs operate with limited resources of sensor nodes, its life is extended by cluster-based routing methods. In this study, we use data on direction, distance, density and residual energy in order to maximize the energy efficiency of cluster-based routing methods. Through this study, we expect to minimize the frequency of isolated nodes when selecting a new cluster head autonomously using information on the direction of the upper cluster head, and to reduce energy consumption by switching sensor nodes, which are included in both of the new cluster and the previous cluster and thus do not need to update information, into the sleep mode and updating information only for newly included sensor nodes at the setup phase using distance data. Furthermore, we enhance overall network efficiency by implementing secure and energy-efficient communication through key management robust against internal and external attacks in cluster-based routing techniques. This study suggests the modified cluster head selection scheme which uses the conserved energy in the steady-state phase by reducing unnecessary communications of unchanged nodes between selected cluster head and previous cluster head in the setup phase, and thus prolongs the network lifetime and provides secure and equal opportunity for being cluster head.

• Journal of Digital Convergence
• /
• v.11 no.5
• /
• pp.279-284
• /
• 2013

This paper proposes a new cluster-based routing protocol for assuring the service lifetime of wireless multimedia sensor networks. The proposed protocol performs the intra-cluster routing and inter-cluster routing to reduce the energy consumption and service lifetime in the wireless sensor multimedia computing environment, and the proposed mechanism enhances the routing reliability, and it minimizes the packet loss, overhead, and energy consumption. The simulation results show that the proposed mechanism outperforms DSR and AODV.

• The Journal of the Korea Contents Association
• /
• v.10 no.6
• /
• pp.91-105
• /
• 2010

A wireless sensor network communication technique has been broadly studied with continuous advances in ubiquitous computing environment. Especially, because the resource of the sensor node is limited, it is important to reduce the communication energy by using an energy-efficient routing protocol. The existing cluster-based routing protocols have a problem that they cannot select a cluster head efficiently by randomly choosing a head. In addition, because the existing cluster-based routing protocols do not support the large scale of network, they cannot be used for various applications. To solve the above problems, we, in this paper, propose a new cluster-based routing protocol using representative paths. The proposed protocol constructs an efficient cluster with distributed cluster heads by creating representative paths based on hop count. In addition, a new routing protocol supports multi-hop routing for data communication between a cluster member node and a cluster head as well as between cluster heads. Finally, we show that our protocol outperforms LEACH and Multihop-LEACH in terms of reliability and scalability.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5B
• /
• pp.721-733
• /
• 2010

In this paper, we propose a scalable content-based routing scheme for the tactical mobile ad-hoc networks where the nodes usually move together forming a group. Our scheme is classified as a content-based routing scheme based on publish and subscribe model. The nodes compose a cluster according to their position and interest. Our scheme allows multi-level cluster nesting. As a publish/subscribe model does, each node announces its interest to the cluster head who aggregates and announces the interests from cluster members to its neighbor cluster head. Actual data messages are delivered to the end node via cluster header in the reverse direction of the interest announcement. Using Qualnet simulator, we evaluated the performance of our scheme in comparison with two well-known content-based routing schemes. Simulation results show that our scheme maintains higher message delivery ratio as number of nodes increases whereas the two schemes show much lower delivery ratio. In addition, as the group mobility gets faster our scheme incurs less or similar control message overhead compared with the two schemes.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.115-122
• /
• 2002

This paper presents a new web cluster scheme based on dispatcher which does not depend on operating system for server and can examine server's status interactively. Two principal functions are proposed for new web cluster technique. The one is self-controlled load distribution and the other is transaction fail-safe. Self-controlled load distribution function checks response time and status of servers periodically, then it decides where the traffic goes to guarantee rapid response for every query. Transaction fail-safe function can recover lost queries including broken transaction immediately from server errors. Proposed new web cluster scheme is implemented by C language on Unix operating system and compared with legacy web cluster products. On the comparison with broadcast based web cluster, proposed new web cluster results higher performance as more traffic comes. And on the comparison with a round-robin DNS based web cluster, it results similar performance at the case of traffic processing. But when the situation of one server crashed, proposed web cluster processed traffics more reliably without lost queries. So, new web cluster scheme Proposed on this dissertation can give alternative plan about highly increasing traffics and server load due to heavy traffics to build more reliable and utilized services.

• The Korean Journal of Applied Statistics
• /
• v.20 no.1
• /
• pp.167-181
• /
• 2007

Many clustering algorithms and cluster validation techniques for high-dimensional gene expression data have been suggested. The evaluations of these cluster validation techniques have, however, seldom been implemented. In this paper we compared various cluster validity indices for low-dimensional simulation data and real gene expression data, and found that Dunn's index is the most effective and robust, Silhouette index is next and Davies-Bouldin index is the bottom among the internal measures. Jaccard index is much more effective than Goodman-Kruskal index and adjusted Rand index among the external measures.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.12
• /
• pp.5865-5872
• /
• 2011

Multi-hop communication in clustering system is the technique that forms the cluster to aggregate the sensing data and transmit them to base station through midway cluster head. Cluster head around base station send more packet than that of far from base station. Because of this hot spot problem occurs and cluster head around base station increases energy consumption. In this paper, I propose a cluster group head selection using trajectory clustering technique(CHST). CHST select cluster head and group head using trajectory clustering technique and fitness function and it increases the energy efficiency. Hot spot problem can be solved by selection of cluster group with multi layer and balanced energy consumption using it's fitness function. I also show that proposed CHST is better than previous clustering method at the point of network energy efficiency.