• Title/Summary/Keyword: CLuster Approach

Search Result 642, Processing Time 0.032 seconds

An Energy-Efficient Clustering Using Division of Cluster in Wireless Sensor Network (무선 센서 네트워크에서 클러스터의 분할을 이용한 에너지 효율적 클러스터링)

  • Kim, Jong-Ki;Kim, Yoeng-Won
    • Journal of Internet Computing and Services
    • /
    • v.9 no.4
    • /
    • pp.43-50
    • /
    • 2008
  • Various studies are being conducted to achieve efficient routing and reduce energy consumption in wireless sensor networks where energy replacement is difficult. Among routing mechanisms, the clustering technique has been known to be most efficient. The clustering technique consists of the elements of cluster construction and data transmission. The elements that construct a cluster are repeated in regular intervals in order to equalize energy consumption among sensor nodes in the cluster. The algorithms for selecting a cluster head node and arranging cluster member nodes optimized for the cluster head node are complex and requires high energy consumption. Furthermore, energy consumption for the data transmission elements is proportional to $d^2$ and $d^4$ around the crossover region. This paper proposes a means of reducing energy consumption by increasing the efficiency of the cluster construction elements that are regularly repeated in the cluster technique. The proposed approach maintains the number of sensor nodes in a cluster at a constant level by equally partitioning the region where nodes with density considerations will be allocated in cluster construction, and reduces energy consumption by selecting head nodes near the center of the cluster. It was confirmed through simulation experiments that the proposed approach consumes less energy than the LEACH algorithm.

  • PDF

Degrees of Freedom of Two-Cluster MIMO Multiway Relay Interference Channels Using Blind Interference Neutralization

  • Zhang, Bowei;Feng, Wenjiang;Dong, Tingting;Deng, Yina
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.1
    • /
    • pp.168-186
    • /
    • 2016
  • In this paper, we investigate the degrees of freedom (DoF) of a two-cluster multiple-input multiple-output (MIMO) multiway relay interference channel (mRIC), where there are two relays and two users per cluster. In this channel, users within the same cluster exchange messages among themselves with the help of two relays.We first obtain the DoF upper bound of the considered MIMO mRIC based on cut-set bound. Then, we propose a novel transmission strategy, blind interference neutralization (BIN), to approach the DoF upper bound. This new method utilizes the overheard information at two relays and focuses on the beamforming matrix designs at two relays so that the channel state information (CSI) at users is not required. Through theoretical analysis and numerical simulations, we show that the DoF upper bound can be obtained by using the BIN scheme. From simulation results, we show that the proposed BIN scheme can provide significant performance gain over the conventional time division multiple access (TDMA) scheme in terms of DoF. In addition, we show that the BIN scheme is a superior approach to the existing signal space alignment (SSA) schemes for the considered mRIC.

An Adaptive Blind Equalizer Using Gaussian Two-Cluster Model (가우시안 2-군집 모델을 사용한 적응 블라인드 등화기)

  • Oh, Kil-Nam
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.6A
    • /
    • pp.473-479
    • /
    • 2012
  • In this paper, blind equalization technique using Gaussian two-cluster model is proposed. The proposed approach, by modeling the received M-QAM signals as Gaussian distributed two-cluster, minimizes the computational complexity and enhances the reliability of the signal estimates. In addition, by using a nonlinear estimator with variable parameters to estimate the transmitted signal, and by selectively applying the reduced constellation and the original constellation when estimating the signals, the reliability of the signal estimation was further improved. As a result, the proposed approach has improved the performance while reducing the complexity of the equalizer. Through computer simulations for blind equalization of higher-order signals of 64-QAM, it was confirmed that the proposed method showed better performance than traditional approaches.

CROX (Cluster Regulation of RUNX) as a Potential Novel Therapeutic Approach

  • Kamikubo, Yasuhiko
    • Molecules and Cells
    • /
    • v.43 no.2
    • /
    • pp.198-202
    • /
    • 2020
  • Comprehensive inhibition of RUNX1, RUNX2, and RUNX3 led to marked cell suppression compared with inhibition of RUNX1 alone, clarifying that the RUNX family members are important for proliferation and maintenance of diverse cancers, and "cluster regulation of RUNX (CROX)" is a very effective strategy to suppress cancer cells. Recent studies reported by us and other groups suggested that wild-type RUNX1 is needed for survival and proliferation of certain types of leukemia, lung cancer, gastric cancer, etc. and for their one of metastatic target sites such as born marrow endothelial niche, suggesting that RUNX1 often functions oncogenic manners in cancer cells. In this review, we describe the significance and paradoxical requirement of RUNX1 tumor suppressor in leukemia and even solid cancers based on recent our findings such as "genetic compensation of RUNX family transcription factors (the compensation mechanism for the total level of RUNX family protein expression)", "RUNX1 inhibition-induced inhibitory effects on leukemia cells and on solid cancers through p53 activation", and "autonomous feedback loop of RUNX1-p53-CBFB in acute myeloid leukemia cells". Taken together, these findings identify a crucial role for the RUNX cluster in the maintenance and progression of cancers and suggest that modulation of the RUNX cluster using the pyrrole-imidazole polyamide gene-switch technology is a potential novel therapeutic approach to control cancers.

Improved Cluster-Based Routing Protocol Using Paired-header of Cluster in The Mobile Ad-Hoc Network (모바일 애드혹 네트워크에서 클러스터의 페어 헤드 노드를 이용한 향상된 CBRP)

  • Kim, ChangJin;Kim, Wu Woan;Jang, Sangdong
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.1
    • /
    • pp.56-66
    • /
    • 2013
  • In MANET, the frequent movement of nodes causes the dynamic network topology changes. Therefore, it is required that the routing protocol should be very stable to effectively respond the changes of the network changes. Moreover, the existing cluster-based routing protocol, that is the hybrid approach, has routing delay due to the re-electing of the cluster header. In addition, the routing table of CBRP has all only one hop distant neighbor nodes. PCBRP, proposed in this paper, ties two clusters in one paired cluster to make longer radius. Then the headers of the paired cluster manage and operate corresponding member nodes. In the current CBRP, when the cluster header leaves out the cluster, the delay, due to the re-electing a header, should be occurred. However, in PCBRP, another cluster header of the paired cluster plays the role instead of the left cluster header. This method reduces the routing delay. Concurrently, PCBRP reduces the delay when they route nodes in the paired cluster internally.

A Token Based Protocol for Mutual Exclusion in Mobile Ad Hoc Networks

  • Sharma, Bharti;Bhatia, Ravinder Singh;Singh, Awadhesh Kumar
    • Journal of Information Processing Systems
    • /
    • v.10 no.1
    • /
    • pp.36-54
    • /
    • 2014
  • Resource sharing is a major advantage of distributed computing. However, a distributed computing system may have some physical or virtual resource that may be accessible by a single process at a time. The mutual exclusion issue is to ensure that no more than one process at a time is allowed to access some shared resource. The article proposes a token-based mutual exclusion algorithm for the clustered mobile ad hoc networks (MANETs). The mechanism that is adapted to handle token passing at the inter-cluster level is different from that at the intra-cluster level. It makes our algorithm message efficient and thus suitable for MANETs. In the interest of efficiency, we implemented a centralized token passing scheme at the intra-cluster level. The centralized schemes are inherently failure prone. Thus, we have presented an intra-cluster token passing scheme that is able to tolerate a failure. In order to enhance reliability, we applied a distributed token circulation scheme at the inter-cluster level. More importantly, the message complexity of the proposed algorithm is independent of N, which is the total number of nodes in the system. Also, under a heavy load, it turns out to be inversely proportional to n, which is the (average) number of nodes per each cluster. We substantiated our claim with the correctness proof, complexity analysis, and simulation results. In the end, we present a simple approach to make our protocol fault tolerant.

Analysis of Cluster-based Truck-Drone Delivery Routing Models (군집 기반 트럭-드론 배송경로 모형의 효과분석)

  • Chang, Yong Sik
    • Journal of Information Technology Applications and Management
    • /
    • v.26 no.1
    • /
    • pp.53-64
    • /
    • 2019
  • The purpose of this study is to find out the fast delivery route that several drones return a truck again after departing from it for delivery locations at each cluster while the truck goes through the cluster composed of several delivery locations. The main issue is to reduce the total delivery time composed of the delivery time by relatively slow trucks via clusters and the sum of maximum delivery times by relatively fast drones in each cluster. To solve this problem, we use a three-step heuristic approach. First, we cluster the nearby delivery locations with minimal number of clusters satisfying a constraint of drone flight distance to set delivery paths for drones in each cluster. Second, we set an optimal delivery route for a truck through centers of the clusters using the TSP model. Finally, we find out the moved centers of clusters while maintaining the delivery paths for the truck and drones and satisfying the constraint of drone flight. distance in the two-dimensional region to reduce the total delivery time. In order to analyze the effect of this study model according to the change of the number of delivery locations, we developed a R-based simulation prototype and compared the relative efficiency, and performed paired t-test between TSP model and the cluster-based models. This study showed its excellence through this experimentation.

Dynamic Hysteresis Model Based on Fuzzy Clustering Approach

  • Mourad, Mordjaoui;Bouzid, Boudjema
    • 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.

Financial Performance Evaluation of Domestic Life Insurers : A Comparison of ELECTREII, SAW and Cluster Analysis (국내 생명보험회사의 재무건전성 평가: ELECTRE II, 단순가중합모형, 군집분석의 비교)

  • 민재형;송영민
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.28 no.4
    • /
    • pp.39-60
    • /
    • 2003
  • In this study, we evaluate financial performance of 21 domestic life insurers using SAW (simple additive weighting), ELECTREII, cluster analysis respectively, and suggest a hybrid approach of combining cluster analysis and ELECTREII to reclassify the life insurers into more meaningful groups according to their respective financial features. We also perform the sensitivity analysis employing ANOVA and Tukey's test to examine the robustness of ELECTREII, which would be influenced by decision maker's subjective preference parameters. Consequently, it is shown that ELECTREII turns out to be a flexible method providing decision makers with useful ranking Information especially under fuzzy decision making situation with incomparable alternatives, and hence it can serve as a complementary method to overcome the weakness of classical cluster analysis.

The Impact of Network Coding Cluster Size on Approximate Decoding Performance

  • Kwon, Minhae;Park, Hyunggon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.3
    • /
    • pp.1144-1158
    • /
    • 2016
  • In this paper, delay-constrained data transmission is considered over error-prone networks. Network coding is deployed for efficient information exchange, and an approximate decoding approach is deployed to overcome potential all-or-nothing problems. Our focus is on determining the cluster size and its impact on approximate decoding performance. Decoding performance is quantified, and we show that performance is determined only by the number of packets. Moreover, the fundamental tradeoff between approximate decoding performance and data transfer rate improvement is analyzed; as the cluster size increases, the data transfer rate improves and decoding performance is degraded. This tradeoff can lead to an optimal cluster size of network coding-based networks that achieves the target decoding performance of applications. A set of experiment results confirms the analysis.