• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권3호
• /
• pp.224-242
• /
• 2010

Data routing in wireless sensor networks must be energy-efficient because tiny sensor nodes have limited power. A cluster-based hierarchical routing is known to be more efficient than a flat routing because only cluster-heads communicate with a sink node. Existing hierarchical routings, however, assume unrealistically large radio transmission ranges for sensor nodes so they cannot be employed in real environments. In this paper, by considering the practical transmission ranges of the sensor nodes, we propose a clustering and routing method for hierarchical sensor networks: First, we provide the optimal ratio of cluster-heads for the clustering. Second, we propose a d-hop clustering scheme. It expands the range of clusters to d-hops calculated by the ratio of cluster-heads. Third, we present an intra-cluster routing in which sensor nodes reach their cluster-heads within d-hops. Finally, an inter-clustering routing is presented to route data from cluster-heads to a sink node using multiple hops because cluster-heads cannot communicate with a sink node directly. The efficiency of the proposed clustering and routing method is validated through extensive simulations.

• 한국산학기술학회논문지
• /
• 제11권12호
• /
• pp.4991-4996
• /
• 2010

무선 센서 네트워크에서 클러스터링 기법은 클러스터를 형성하여 데이터를 통합한 후 한 번에 전송해서 에너지를 효율적으로 사용하는 기법이다. 클러스터 그룹 모델은 클러스터링에 기반을 두지만 이전의 기법과 달리 클러스터 헤드에 집중된 에너지 과부하를 클러스터 그룹 헤드와 클러스터 헤드로 분산시켜서 전체 에너지 소모량을 줄인다. 본 논문에서는 이러한 클러스터 그룹 모델에서 에너지 소모 모델의 임계값에 따라 최적의 클러스터 그룹 수와 클러스터 수를 구하고 이를 이용하여 센서 네트워크 전체 에너지 소모량을 최소화하고 네트워크 수명을 최대화한다. 실험을 통하여 제안된 클러스터 그룹 모델이 이전의 클러스터링 기법보다 네트워크 에너지 효율이 향상되었음을 보였다.

• Journal of Preventive Medicine and Public Health
• /
• 제33권1호
• /
• pp.51-55
• /
• 2000

Objectives . In large-scale field trials, randomization by cluster is frequently used because of the administrative convenience, a desire to reduce the effect of treatment contamination, and the need to avoid ethical issues that might of otherwise arise. Cluster randomization trials are experiments in which intact social unit, e.g., families, schools, cities, rather than independent individuals are randomly allocated to intervention groups. The positive correlation among responses of subjects from the same cluster is in matter in cluster randomization. This thesis is to compare the results of three randomization methods by standard error of estimator of treatment effect. Methods : We simulated cholesterol data varing the size of the cluster and the level of the correlation in clusters and analyzed the effect of cholesterol-lowering agent. Results : In intra-cluster randomization the standard error of the estimator of treatment effect is smallest relative to that in inter-cluster randomization and that in individual randomization. Conclusions : Infra-cluster randomization is the most efficient in its standard error of estimator of treatment effect but other factor should be considered when selecting a specific randomization method.

• International Journal of Computer Science & Network Security
• /
• 제21권1호
• /
• pp.6-11
• /
• 2021

Routing protocols play a pivotal role in the energy management and lifespan of any Wireless Sensor Network. Lower network lifetime has been one of the biggest concerns in LEACH protocol due to dead nodes. The LEACH protocol suffers from uneven energy distribution problem due to random selection of a cluster head. The cluster head has much greater responsibility compared to other non- cluster head nodes and consumes greater energy for its roles. This results in early dead nodes due to energy lost for the role of cluster- head. This study proposes an approach to balance the energy consumption of the LEACH protocol by using a semi-deterministic opportunity coefficient to select the cluster head. This is calculated in each node with the battery energy level and node ID. Ultimately, based on the opportunity cost, cluster head will be selected and broadcasted for which other nodes with higher opportunity cost will agree. It minimizes the chances of nodes with lower battery level being elected as cluster head. Our simulation experiments demonstrate that cluster heads chosen using our proposed algorithm perform better than those using the legacy LEACH protocol.

• 통상정보연구
• /
• 제9권4호
• /
• pp.217-239
• /
• 2007

We want to know the key factors which are important to make any cluster grow up. First, we make four cluster types which are national policy type, local recruit type, local network type, and existing industry transforming type. Second, We selected Austin case and Kyushu case as two local recruit type clusters. Third, this paper looks into the dynamics of two clusters. Forth, we arrive at the conclusion including the policy implication for Daegu technopolis.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(2)
• /
• pp.21-24
• /
• 2001

We studied aluminum cluster deposition using molecular dynamics simulation. We investigated the variations of the cluster momentum and the impulse force during collisions, and found that the close-packed cluster impact has some of properties of the single particle collision and the linear chain collisions. We also simulated the series of energetic cluster deposition with energy Per atom. When energy Per atom in cluster has some eV rather than very low, the intermixing occurred easily in growth film and we can obtain a good film without subsequent annealing process.

• World Technopolis Review
• /
• 제5권2호
• /
• pp.98-107
• /
• 2016

By highlighting the efficiencies gained from regional specialization, the cluster concept has distracted economic development officials from their traditional role of diversifying regional and local economies. Clustering was a viable strategy for much of the 18 years following its original appearance in the literature. Now, two events cast doubt on the continued viability of cluster-based specialization. First, the digital convergence has blurred the boundaries that once separated one industry from another. An industry cluster strategy becomes difficult when the industry cannot be defined. Second, many cluster initiatives fail. Combining literature search with the system-theoretic notions of efficiency and redundancy, we find many factors moderate cluster success. This implies regions facing uncertain success in their cluster-building efforts should thoroughly understand their unique circumstances and build upon them. Regions with successful clusters are advised to aim for multiple related clusters or superclusters.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권7호
• /
• pp.1293-1310
• /
• 2011

A simple modification of well known Low Energy Adaptive Clustering Hierarchy (LEACH) protocol is proposed to exploit cooperative diversity. Instead of selecting a single cluster-head, we propose M cluster-heads in each cluster to obtain a diversity of order M. The cluster-heads gather data from all the sensor nodes within the cluster using same technique as LEACH. Cluster-heads transmit gathered data cooperatively towards the destination or higher order cluster-head. We propose a code combining based cooperative diversity protocol which is similar to coded cooperation that maximizes the performance of the proposed cooperative LEACH protocol. The implementation of the proposed cooperative strategy is analyzed. We develop the upper bounds on bit error rate (BER) and frame error rate (FER) for our proposal. Space time block codes (STBC) are also a suitable candidate for our proposal. In this paper, we argue that the STBC performs worse than the code combining cooperation.

• 한국멀티미디어학회논문지
• /
• 제19권5호
• /
• pp.910-917
• /
• 2016

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 the sink node to pass collected data. However, the communication distance of the sensor nodes at low cost and at low power is not long, it requires a data transfer through the multi-hop to transmit data to the sink node. In the existing cluster-based sensor network studies, cluster process and route selection process are performed separately in order to configure the routing path to the sink node. In this paper, in order to use the energy of the sensor nodes that have limited resources efficiently, a cluster-based multi-hop routing protocol which merges the clustering process and routing process is proposed. And the proposed method complements the problem of uneven cluster creation that may occur in probabilistic cluster methods and increases the energy efficiency of whole sensor nodes.

• Communications for Statistical Applications and Methods
• /
• 제22권1호
• /
• pp.55-67
• /
• 2015

An important problem in cluster analysis is the selection of variables that define cluster structure that also eliminate noisy variables that mask cluster structure; in addition, outlier detection is a fundamental task for cluster analysis. Here we provide an automated K-means clustering process combined with variable selection and outlier identification. The Automated K-means clustering procedure consists of three processes: (i) automatically calculating the cluster number and initial cluster center whenever a new variable is added, (ii) identifying outliers for each cluster depending on used variables, (iii) selecting variables defining cluster structure in a forward manner. To select variables, we applied VS-KM (variable-selection heuristic for K-means clustering) procedure (Brusco and Cradit, 2001). To identify outliers, we used a hybrid approach combining a clustering based approach and distance based approach. Simulation results indicate that the proposed automated K-means clustering procedure is effective to select variables and identify outliers. The implemented R program can be obtained at http://www.knou.ac.kr/~sskim/SVOKmeans.r.