• Title/Summary/Keyword: Distributed Clustering

Search Result 222, Processing Time 0.026 seconds

LECEEP : LEACH based Chaining Energy Efficient Protocol (에너지 효율적인 LEACH 기반 체이닝 프로토콜 연구)

  • Yoo, Wan-Ki;Kwon, Tae-Wook
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.5B
    • /
    • pp.801-808
    • /
    • 2010
  • LEACH, one of hierarchical based routing protocols, was proposed for energy efficiency which is the most important requirement of Wireless Sensor Network(WSN). LEACH protocol is composed of a cluster of certain large number of clusters, which have a cluster head and member nodes. Member nodes send sensing data to their cluster heads, and the cluster heads aggregate the sensing data and transmit it to BS. The challenges of LEACH protocol are that cluster heads are not evenly distributed, and energy consumption to transmit aggregated data from Cluster heads directly to BS is excessive. This study, to improve LEACH protocol, suggests LECEEP that transmit data to contiguity cluster head that is the nearest and not far away BS forming chain between cluster head, and then the nearest cluster head from BS transmit aggregated data finally to BS. According to simulation, LECEEP consumes less energy and retains more number of survival node than LEACH protocol.

A Study for an Optimal Load Balancing Algorithm based on the Real-Time Server Monitor of a Real Server (리얼 서버의 실시간 서버 모니터에 의한 최적 로드 밸런싱 알고리즘에 관한 연구)

  • Han, Il-Seok;Kim, Wan-Yong;Kim, Hag-Bae
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.11a
    • /
    • pp.201-204
    • /
    • 2003
  • At a consequence of WWW large popularity, the internet has suffered from various performance problems, such as network congestion and overloaded servers. These days, it is not uncommon to find servers refusing connections because they are overloaded. Web server performance has always been a key issue in the design and operation of on-line systems. With regard to Internet, performance is also critical, because users want fast and easy access to all objects (e.g., documents, graphics, audio, and video) available on the net. To solve this problem, a number of companies are exploring the benefits of having multiple geographically or locally distributed Internet sites. This requires a comprehensive scheme for traffic management, which includes the principle of an optimal load balancing of client requests across multiple clusters of real servers. This paper focuses on the performance analysis of Web server and we apply these results to load balancing in clustering web server. It also discusses the mam steps needed to carry out a WWW performance analysis effort and shows relations between the workload characteristics and system resource usage. Also, we will introduce an optimal load balancing algorithm base on the RTSM (Real-Time Server Monitor) and Fuzzy Inference Engine for the local status of a real server, and the benefits is provided with of the suggested method.

  • PDF

LARGE SDSS QUASAR GROUPS AND THEIR STATISTICAL SIGNIFICANCE

  • Park, Changbom;Song, Hyunmi;Einasto, Maret;Lietzen, Heidi;Heinamaki, Pekka
    • Journal of The Korean Astronomical Society
    • /
    • v.48 no.1
    • /
    • pp.75-82
    • /
    • 2015
  • We use a volume-limited sample of quasars in the Sloan Digital Sky Survey (SDSS) DR7 quasar catalog to identify quasar groups and address their statistical significance. This quasar sample has a uniform selection function on the sky and nearly a maximum possible contiguous volume that can be drawn from the DR7 catalog. Quasar groups are identified by using the Friend-of-Friend algorithm with a set of fixed comoving linking lengths. We find that the richness distribution of the richest 100 quasar groups or the size distribution of the largest 100 groups are statistically equivalent with those of randomly-distributed points with the same number density and sky coverage when groups are identified with the linking length of $70h^{-1}Mpc$. It is shown that the large-scale structures like the huge Large Quasar Group (U1.27) reported by Clowes et al. (2013) can be found with high probability even if quasars have no physical clustering, and does not challenge the initially homogeneous cosmological models. Our results are statistically more reliable than those of Nadathur (2013), where the test was made only for the largest quasar group. It is shown that the linking length should be smaller than $50h^{-1}Mpc$ in order for the quasar groups identified in the DR7 catalog not to be dominated by associations of quasars grouped by chance. We present 20 richest quasar groups identified with the linking length of $70h^{-1}Mpc$ for further analyses.

A Energy-Efficient Cluster Header Election Algorithm in Ubiquitous Sensor Networks (USN에서 에너지 효율성을 고려한 효과적인 클러스터 헤더 선출 알고리즘)

  • Hur, Tai-Sung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.10
    • /
    • pp.197-203
    • /
    • 2011
  • In this paper, a new cluster configuration process is proposed. The energy consumption of sensor nodes is reduced by configuring the initial setup process only once with keeping the initial cluster. Selecting the highest power consumed node of the member nodes within the cluster to the header of next round can distribute power consumption of all nodes in the cluster evenly. With this proposed way, the lifetime of the USN is increased by the reduced energy consumption of all nodes in the cluster. Also, evenly distributed power consumptions of sensors are designed to improve the energy hole problem. The effectiveness of the proposed algorithms is confirmed through simulations.

Clustering for Improved Actor Connectivity and Coverage in Wireless Sensor and Actor Networks (무선 센서 액터 네트워크에서 액터의 연결성과 커버리지를 향상시키기 위한 클러스터 구성)

  • Kim, Young-Kyun;Jeon, Chang-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.8
    • /
    • pp.63-71
    • /
    • 2014
  • This paper proposes an algorithm that forms the clusters on the basis of hop distance in order to improve the actor coverage and connectivity in the sink-based wireless sensor and actor networks. The proposed algorithm forms the clusters that are distributed evenly in the target area by electing the CHs(Cluster Heads) at regular hop intervals from a sink. The CHs are elected sequentially from the sink in order to ensure the connectivity between the sink and the actors that are located on the CHs. Additionally, the electing are achieved from the area of the higher rate of the sensors density in order to improve the actor coverage. The number of clusters that are created in the target area and the number of the actors that are placed on the positions of the CHs are reduced by forming the clusters with regular distribution and minimizing the overlap of them through the proposed algorithm. Simulations are performed to verify that the proposed algorithm constructs the actor network that is connected to the sink. Moreover, we shows that the proposed algorithm improves the actor coverage and, therefore, reduces the amount of the actors that will be deployed in the region by 9~20% compared to the IDSC algorithm.

Processing large-scale data with Apache Spark (Apache Spark를 활용한 대용량 데이터의 처리)

  • Ko, Seyoon;Won, Joong-Ho
    • The Korean Journal of Applied Statistics
    • /
    • v.29 no.6
    • /
    • pp.1077-1094
    • /
    • 2016
  • Apache Spark is a fast and general-purpose cluster computing package. It provides a new abstraction named resilient distributed dataset, which is capable of support for fault tolerance while keeping data in memory. This type of abstraction results in a significant speedup compared to legacy large-scale data framework, MapReduce. In particular, Spark framework is suitable for iterative machine learning applications such as logistic regression and K-means clustering, and interactive data querying. Spark also supports high level libraries for various applications such as machine learning, streaming data processing, database querying and graph data mining thanks to its versatility. In this work, we introduce the concept and programming model of Spark as well as show some implementations of simple statistical computing applications. We also review the machine learning package MLlib, and the R language interface SparkR.

Genetic Distances of Three Mollusk Species Investigated by PCR Analysis

  • Oh, Hyun;Yoon, Jong-Man
    • Development and Reproduction
    • /
    • v.18 no.1
    • /
    • pp.43-49
    • /
    • 2014
  • Three species of Nortamea concinua (NC) and Haliotis discus hannai (HDH) from Tongyeong and Sulculus diversicolor supertexta (SDS) are widely distributed on the coast of the Yellow Sea, southern sea and Jeju Island in the Korean Peninsula under the innate ecosystem. There is a need to understand the genetic traits and composition of three mollusk species in order to evaluate exactly the patent genetic effect. PCR analysis was performed on DNA samples extracted from a total of 21 individuals using seven decamer oligonucleotides primers. Seven primers were shown to generate the unique shared loci to each species and shared loci by the three species which could be clearly scored. A hierarchical clustering tree was constructed using similarity matrices to generate a dendrogram, which was facilitated by the Systat version 10. 236 specific loci, with an average of 56.3 per primer, were identified in the NC species. 142 specific loci, with an average of 44.7 per primer, were identified in the HDH species. Especially, 126 numbers of shared loci by the three species, with an average of 18 per primer, were observed among the three species. Especially, the decamer primer BION-75 generated 7 unique loci to each species, which were identifying each species, in 700 bp NC species. Interestingly, the primer BION-50detected 42 shared loci by the three species, major and/or minor fragments of sizes 100 bp and 150 bp, respectively, which were identical in all samples. As regards average bandsharing value (BS) results, individuals from HDH species (0.772) exhibited higher bandsharing values than did individuals from NC species (0.655). In this study, the dendrogram obtained by the seven decamer primers indicates three genetic clusters: cluster 1 (CONCINNA 01~CONCINNA 07), cluster 2 (HANNAI 08~HANNAI 14), cluster 3 (SUPERTEXTA 15~SUPERTEXTA 21). Comparatively, individuals of HDH species were fairly closely related to that of SDS species, as shown in the hierarchical dendrogram of genetic distances.

ON THE COMPOSITION AND THE ABUNDANCE DISTRIBUTION OF ZOOPLANKTON IN THE YELLOW SEA IN APRIL, 1981 (춘계 한국 서해역에서의 동물플랑크톤의 종조성 및 양적 분포에 관하여)

  • Shim, Jae Hyung;Park, Chul
    • 한국해양학회지
    • /
    • v.17 no.2
    • /
    • pp.95-101
    • /
    • 1982
  • In order to the species composition and abundance distribution of zooplankton, quantitative samples collected in the Yellow Sea in April 1981 were analyzed. Ranges of temperatures and salinities of the study area were 4.55-9.80$^{\circ}C$ and 32.02-32.88 , respectively. Total 33 taxa were identified from all samples collected. Species composition along the stations showed no remarkable variations. Copepods were the most imporatnt components of zooplankton community in the study area. Dominant species of copepods were Oithona similis, Acartia clause and Centropages mcmurrichi. Appendicularia, Chaetognatha, Amphipod, and Euphausiid were distributed with minor abundance. Average biomass(wet weight) of zooplankton was 107mg/㎥, and the biomasses of zooplankton at offshore stations were greater than those of inshore stations in the study area. Average individual number of zooplankton was 1,915 indiv./㎥, and the variations along stations showed the same trend as in biomass. From the result of clustering with correlation coefficients calculated with the indivecual numbers per cubic meter for 20 zooplankton constituents at each station it was suggested that temperature had far reaching sffect on the distribution of zooplankton in the study area.

  • PDF

Cluster-head-selection-algorithm in Wireless Sensor Networks by Considering the Distance (무선 센서네트워크에서 거리를 고려한 클러스터 헤드 선택 알고리즘)

  • Kim, Byung-Joon;Yoo, Sang-Shin
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.4
    • /
    • pp.127-132
    • /
    • 2008
  • Wireless sensor network technologies applicable to various industrial fields are rapidly growing. Because it is difficult to change a battery for the once distributed wireless sensor network, energy efficient design is very critical. In order to achieve this purpose in network design, a number of studies have been examining the energy efficient routing protocol. The sensor network consumes energy in proportion to the distance of data transmission and the data to send. Cluster-based routing Protocols such as LEACH-C achieve energy efficiency through minimizing the distance of data transmission. In LEACH-C, however, the total distance between the nodes consisting the clusters are considered important in constructing clustering. This paper examines the cluster-head-selection-algorithm that reflect the distance between the base station and the cluster-head having a big influence on energy consumption. The Proposed method in this paper brought the result that the performance improved average $4{\sim}7%$ when LEACH-C and the base station are located beyond a certain distance. This result showed that the distance between cluster-head and the base station had a substantial influence on lifetime performance in the cluster-based routing protocol.

  • PDF

An immunohistochemical study of the pancreatic endocrine cells in the cat-shark, Scyliorhinus torazame (두툽상어 췌장에 출현하는 내분비세포의 면역조직화학적 연구)

  • Lee, Jae-hyun;Lee, Nam-soo;Lee, Hyeung-sik;Kim, Jong-beom
    • Korean Journal of Veterinary Research
    • /
    • v.31 no.1
    • /
    • pp.27-32
    • /
    • 1991
  • The pancreatic endocrine cells of the cat-shark, S. torazame, were studied using immunohistochemical method. Five kinds of endocrine cells (glucagon-, somatostatin-, insulin-, 5-HT-and BPP-immunoreactive cells) identified in this study. The chracteristic findings of the distributions of five immunoreactive cells were as follows. Glucagon-immunoreactive cells were detected as clustering group in the epithelia of the interlobular duct and singly the pancreatic acini, respectively. Insulin -immunoreactive cells were moderately observed in the epithelia of the interlobular duct or in the periphery of the islet. Somatostatin-immunoreactive cells were distributed in single or mass groups in the epithelia of the interlobular duct and the exocrine gland of the pancreas. A very few 5-HTimmunoreactive cells were seen in the periphery of the islet and the acini of the pancreas-BPP-immunoreactive cell was singly located in the periphery of the pancreatic islet, but GAS/CCK-and Chromogranin-immunoreactive cells were not found in this study.

  • PDF