• Title/Summary/Keyword: Network Clustering

Search Result 1,258, Processing Time 0.025 seconds

Online nonparametric Bayesian analysis of parsimonious Gaussian mixture models and scenes clustering

  • Zhou, Ri-Gui;Wang, Wei
    • ETRI Journal
    • /
    • v.43 no.1
    • /
    • pp.74-81
    • /
    • 2021
  • The mixture model is a very powerful and flexible tool in clustering analysis. Based on the Dirichlet process and parsimonious Gaussian distribution, we propose a new nonparametric mixture framework for solving challenging clustering problems. Meanwhile, the inference of the model depends on the efficient online variational Bayesian approach, which enhances the information exchange between the whole and the part to a certain extent and applies to scalable datasets. The experiments on the scene database indicate that the novel clustering framework, when combined with a convolutional neural network for feature extraction, has meaningful advantages over other models.

Identification of Fuzzy-Radial Basis Function Neural Network Based on Mountain Clustering (Mountain Clustering 기반 퍼지 RBF 뉴럴네트워크의 동정)

  • Choi, Jeoung-Nae;Oh, Sung-Kwun;Kim, Hyun-Ki
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.1 no.3
    • /
    • pp.69-76
    • /
    • 2008
  • This paper concerns Fuzzy Radial Basis Function Neural Network (FRBFNN) and automatic rule generation of extraction of the FRBFNN by means of mountain clustering. In the proposed network, the membership functions of the premise part of fuzzy rules do not assume any explicit functional forms such as Gaussian, ellipsoidal, triangular, etc., so its resulting fitness values (degree of membership) directly rely on the computation of the relevant distance between data points. Also, we consider high-order polynomial as the consequent part of fuzzy rules which represent input-output characteristic of sup-space. The number of clusters and the centers of clusters are automatically generated by using mountain clustering method based on the density of data. The centers of cluster which are obtained by using mountain clustering are used to determine a degree of membership and weighted least square estimator (WLSE) is adopted to estimate the coefficients of the consequent polynomial of fuzzy rules. The effectiveness of the proposed model have been investigated and analyzed in detail for the representative nonlinear function.

  • PDF

A Genetic-Algorithm-Based Optimized Clustering for Energy-Efficient Routing in MWSN

  • Sara, Getsy S.;Devi, S. Prasanna;Sridharan, D.
    • ETRI Journal
    • /
    • v.34 no.6
    • /
    • pp.922-931
    • /
    • 2012
  • With the increasing demands for mobile wireless sensor networks in recent years, designing an energy-efficient clustering and routing protocol has become very important. This paper provides an analytical model to evaluate the power consumption of a mobile sensor node. Based on this, a clustering algorithm is designed to optimize the energy efficiency during cluster head formation. A genetic algorithm technique is employed to find the near-optimal threshold for residual energy below which a node has to give up its role of being the cluster head. This clustering algorithm along with a hybrid routing concept is applied as the near-optimal energy-efficient routing technique to increase the overall efficiency of the network. Compared to the mobile low energy adaptive clustering hierarchy protocol, the simulation studies reveal that the energy-efficient routing technique produces a longer network lifetime and achieves better energy efficiency.

An energy efficient clustering scheme by adjusting group size in zigbee environment (Zigbee 환경에서 그룹 크기 조정에 의한 에너지 효율적인 클러스터링 기법)

  • Park, Jong-Il;Lee, Kyoung-Hwa;Shin, Yong-Tae
    • Journal of Sensor Science and Technology
    • /
    • v.19 no.5
    • /
    • pp.342-348
    • /
    • 2010
  • The wireless sensor networks have been extensively researched. One of the issues in wireless sensor networks is a developing energy-efficient clustering protocol. Clustering algorithm provides an effective way to extend the lifetime of a wireless sensor networks. In this paper, we proposed an energy efficient clustering scheme by adjusting group size. In sensor network, the power consumption in data transmission between sensor nodes is strongly influenced by the distance of two nodes. And cluster size, that is the number of cluster member nodes, is also effected on energy consumption. Therefore we proposed the clustering scheme for high energy efficiency of entire sensor network by controlling cluster size according to the distance between cluster header and sink.

i-LEACH : Head-node Constrained Clustering Algorithm for Randomly-Deployed WSN (i-LEACH : 랜덤배치 고정형 WSN에서 헤더수 고정 클러스터링 알고리즘)

  • Kim, Chang-Joon;Lee, Doo-Wan;Jang, Kyung-Sik
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.1
    • /
    • pp.198-204
    • /
    • 2012
  • Generally, the clustering of sensor nodes in WSN is a useful mechanism that helps to cope with scalability problem and, if combined with network data aggregation, may increase the energy efficiency of the network. The Hierarchical clustering routing algorithm is a typical algorithm for enhancing overall energy efficiency of network, which selects cluster-head in order to send the aggregated data arriving from the node in cluster to a base station. In this paper, we propose the improved-LEACH that uses comparably simple and light-weighted policy to select cluster-head nodes, which results in reduction of the clustering overhead and overall power consumption of network. By using fine-grained power model, the simulation results show that i-LEACH can reduce clustering overhead compared with the well-known previous works such as LEACH. As result, i-LEACH algorithm and LEACH algorithm was compared, network power-consumption of i-LEACH algorithm was improved than LEACH algorithm with 25%, and network-traffic was improved 16%.

A Study on Cluster Head Selection and a Cluster Formation Plan to Prolong the Lifetime of a Wireless Sensor Network

  • Ko, Sung-Won;Cho, Jeong-Hwan
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.29 no.7
    • /
    • pp.62-70
    • /
    • 2015
  • The energy of a sensor in a Wireless Sensor Network (WSN) puts a limit on the lifetime of the network. To prolong the lifetime, a clustering plan is used. Clustering technology gets its energy efficiency through reducing the number of communication occurrences between the sensors and the base station (BS). In the distributed clustering protocol, LEACH-like (Low Energy Adaptive Clustering Hierarchy - like), the number of sensor's cluster head (CH) roles is different depending on the sensor's residual energy, which prolongs the time at which half of nodes die (HNA) and network lifetime. The position of the CH in each cluster tends to be at the center of the side close to BS, which forces cluster members to consume more energy to send data to the CH. In this paper, a protocol, pseudo-LEACH, is proposed, in which a cluster with a CH placed at the center of the cluster is formed. The scheme used allows the network to consume less energy. As a result, the timing of the HNA is extended and the stable network period increases at about 10% as shown by the simulation using MATLAB.

Clustering Approach for Topology Control in Multi-Radio Wireless Mesh Networks (Multi-Radio 무선 메쉬 네트워크에서의 토폴로지 제어를 위한 클러스터링 기법)

  • Que, Ma. Victoria;Hwang, Won-Joo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.9
    • /
    • pp.1679-1686
    • /
    • 2007
  • Clustering is a topology control approach often used in wireless ad hoc networks to improve scalability and prolong network lifetime. Furthermore, it is also employed to provide semi-management functionalities and capacity enhancement. The usage of clustering topology control technique can also be applied to multi-radio wireless mesh network. This would utilize the advantages of the multi-radio implementation in the network. The aggregation would result to a more stable, connected, scalable and energy-efficient network. On this paper, we design a clustering algorithm for multi-radio wireless mesh network that would use these advantages and would take into consideration both mobility and heterogeneity of the network entities. We also show that the algorithm terminates at a definite time t and the message control overhead complexity is of constant order of O(1) per node.

A Study for Improving WSNs(Wireless Sensor Networks) Performance using Clustering and Location Information (Clustering 및 위치정보를 활용한 WSN(Wireless Sensor Network) 성능 향상 방안 연구)

  • Jeon, Jin-han;Hong, Seong-hun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2019.05a
    • /
    • pp.260-263
    • /
    • 2019
  • Recently, the need of researches and developments about WSN(Wireless Sensor Network) technologies, which can be applied to services to regions where the access is difficult or services that require continuous monitoring, has gradually increased due to its expansion and efficiency of the application areas. In this paper, we analyze existing researches which focused on reducing packet loss rate and increasing lifetime of sensor nodes. Then, we conduct studies about performance improvement factors where some schemes - clustering and location-based approaches - are applied and compare our study results with existing researches. Based on our studies, we are planning to conduct researches about a new scheme that could contribute to improve WSN's performance in terms of packet loss rate and network lifetime.

  • PDF

Performance Evaluation of Distributed Clustering Protocol under Distance Estimation Error

  • Nguyen, Quoc Kien;Jeon, Taehyun
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.10 no.1
    • /
    • pp.11-15
    • /
    • 2018
  • The application of Wireless Sensor Networks requires a wise utilization of limited energy resources. Therefore, a wide range of routing protocols with a motivation to prolong the lifetime of a network has been proposed in recent years. Hierarchical clustering based protocols have become an object of a large number of studies that aim to efficiently utilize the limited energy of network components. In this paper, the effect of mismatch in parameter estimation is discussed to evaluate the robustness of a distanced based algorithm called distributed clustering protocol in homogeneous and heterogeneous environment. For quantitative analysis, performance simulations for this protocol are carried out in terms of the network lifetime which is the main criteria of efficiency for the energy limited system.

Clustering Formation and Topology Control in Multi-Radio Multi-Channel Wireless Mesh Networks

  • Que, Ma. Victoria;Hwang, Won-Joo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.7B
    • /
    • pp.488-501
    • /
    • 2008
  • Convergence of various wireless systems can be cost effectively achieved through enhancement of existing technology. The emergence of Wireless Mesh Network (WMN) entails the interoperability and interconnection of various wireless technologies in one single system. Furthermore, WMN can be implemented with multi-radio and multi-channel enhancement. A multi-radio, multi-channel wireless mesh network could greatly improve certain networking performance metrics. In this research, two approaches namely, clustering and topology control mechanisms are integrated with multi-radio multi-channel wireless mesh network. A Clustering and Topology Control Algorithm (CTCA)is presented that would prolong network lifetime of the client nodes and maintain connectivity of the routers.