• Title/Summary/Keyword: Nodes Clustering

Search Result 464, Processing Time 0.023 seconds

Unification of Kohonen Neural network with the Branch-and-Bound Algorithm in Pattern Clustering

  • Park, Chang-Mok;Wang, Gi-Nam
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.134-138
    • /
    • 1998
  • Unification of Kohone SOM(Self-Organizing Maps) neural network with the branch-and-bound algorithm is presented for clustering large set of patterns. The branch-and-bound search technique is employed for designing coarse neural network learning paradaim. Those unification can be use for clustering or calssfication of large patterns. For classfication purposes further usefulness is possible, since only two clusters exists in the SOM neural network of each nodes. The result of experiments show the fast learning time, the fast recognition time and the compactness of clustering.

  • PDF

Context-awareness Clustering with Adaptive Learning Algorithm (상황인식 기반 클러스터링의 적응적 자율 학습 분할 알고리즘)

  • Jeon, Il-Kyu;Lee, Kang-whan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2022.10a
    • /
    • pp.612-614
    • /
    • 2022
  • This paper propose a clustering algorithm for mobile nodes that possible more efficient clustering using context-aware attribute information in adaptive learning. In typically, the data will be provided to classify interrelationships within cluster properties. If a new properties are treated as contaminated information in comparative clustering, it can be treated as contaminated properties in comparison clustering. In this paper, To solve this problems in this paper, we have new present a context-awareness learning based model that can analyzes the clustering attributed parameters from the node properties using accumulated information properties.

  • PDF

Clustering Technique Using a Node and Level of XML tree (XML 트리의 노드와 레벨을 사용한 군집화 방법)

  • Kim, Woosaeng
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.3
    • /
    • pp.649-655
    • /
    • 2013
  • Recently, researches are studied in developing efficient techniques for accessing, querying, and managing XML documents which are frequently used in the Internet. In this paper, we propose a new method to cluster XML documents efficiently. An element and an inclusion relationship of a XML document corresponds to a node and a level of the corresponding tree, respectively. Therefore, when two XML documents are similar then their nodes' names and levels of the corresponding trees are also similar. In this paper, we cluster XML documents by using nodes' names and levels of the corresponding tree as a feature of a document. The experiment shows that our proposed method has a good performance.

A Clustering Scheme to Prolong Lifetime of Wireless Sensor Networks (무선 센서 네트워크의 수명연장을 위한 클러스터링 기법)

  • Park, Si-Yong;Cho, Hyun-Sug
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.4
    • /
    • pp.996-1004
    • /
    • 2013
  • In this paper, we propose two clustering schemes to prolong lifetime by improving unbalance of energy consumption among sensor nodes in wireless sensor networks. The first proposed scheme make up clusters according to density of sensor nodes in initial stage of wireless sensor networks for reducing energy consumption of wireless sensor networks. After the initial stage, a cluster header is selected by a relay scheme that determines a cluster header of next round among cluster members. by estimating of energy consumption of cluster members for improving unbalance of energy consumption among cluster members.

A Fault-tolerant Scheme for Clustering Routing Protocols (클러스터 기반 라우팅 프로토콜을 위한 결함허용기법)

  • Min, Hong;Kim, Bong-Jae;Jung, Jin-Man;Kim, Seuk-Hyun;Yoon, Jin-Hyuk;Cho, Yoo-Kun;Heo, Jun-Young;Yi, Sang-Ho;Hong, Ji-Man
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.6
    • /
    • pp.668-672
    • /
    • 2010
  • In wireless sensor networks, a fault-tolerant scheme that detects the failure of sensor nodes and improves the reliability of collected information must be considered. Resource-constraint sensor nodes expose vulnerability and cannot use existing checkpointing schemes that do not consider a feature of sensor networks. In this paper, we propose a fault-tolerant scheme for clustering routing protocols that support the recovery of a head node.

A Study on the Context-Awareness Rule-Based Clustering technique for MANET (MANET에서 상황인식 규칙기반에 따른 에너지 보존 클러스터링 기법에 관한 연구)

  • Chi, Sam-Hyun;Lee, Kang-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.4
    • /
    • pp.1041-1047
    • /
    • 2010
  • One of the weaknesses of ad hoc network is that a route used between a source and a destination is to break during communication. To solve this problem, one approach consists of selecting routes whose nodes have the most stable link cost. In this paper proposes a new method for improving the low power distributed MAC. The method is rule-based on the context awareness of the each nodes energy in clustering. The proposed networks scheme could get better improve the awareness for data to achieve and performance on their clustering establishment and messages transmission.

Energy Efficient Topology Control based on Sociological Cluster in Wireless Sensor Networks

  • Kang, Sang-Wook;Lee, Sang-Bin;Ahn, Sae-Young;An, Sun-Shin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.1
    • /
    • pp.341-360
    • /
    • 2012
  • The network topology for a wide area sensor network has to support connectivity and a prolonged lifetime for the many applications used within it. The concepts of structure and group in sociology are similar to the concept of cluster in wireless sensor networks. The clustering method is one of the preferred ways to produce a topology for reduced electrical energy consumption. We herein propose a cluster topology method based on sociological structures and concepts. The proposed sociological clustering topology (SOCT) is a method that forms a network in two phases. The first phase, which from a sociological perspective is similar to forming a state within a nation, involves using nodes with large transmission capacity to set up the global area for the cluster. The second phase, which is similar to forming a city inside the state, involves using nodes with small transmission capacity to create regional clusters inside the global cluster to provide connectivity within the network. The experimental results show that the proposed method outperforms other methods in terms of energy efficiency and network lifetime.

Low-power Environmental Monitoring System for ZigBee Wireless Sensor Network

  • Alhmiedat, Tareq
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.10
    • /
    • pp.4781-4803
    • /
    • 2017
  • Environmental monitoring systems using Wireless Sensor Networks (WSNs) face the challenge of high power consumption, due to the high levels of multi-hop data communication involved. In order to overcome the issue of fast energy depletion, a proof-of-concept implementation proves that adopting a clustering algorithm in environmental monitoring applications will significantly reduce the total power consumption for environment sensor nodes. In this paper, an energy-efficient WSN-based environmental monitoring system is proposed and implemented, using eight sensor nodes deployed over an area of $1km^2$, which took place in the city of Tabuk in Saudi Arabia. The effectiveness of the proposed environmental monitoring system has been demonstrated through adopting a number of real experimental studies.

Energy Efficient Routing in Wireless Sensor Networks

  • Cho, Seongsoo;Shrestha, Bhanu;Shrestha, Surendra;Lee, Jong-Yong;Hong, Suck-Joo
    • International journal of advanced smart convergence
    • /
    • v.3 no.2
    • /
    • pp.1-5
    • /
    • 2014
  • Sensor nodes depend on batteries for energy source in Wireless Sensor Networks (WSNs). Low Energy Adaptive Clustering Hierarchy (LEACH) is a representative cluster-based routing protocol designed to ensure energy use efficiency whereas the virtual cluster exchange routing (VCR) information only with its closest node to build a network. In this paper, a protocol scheme was proposed wherein member nodes are designed to compare the currently sensed data with the previously sensed one and to switch to sleep mode when a match is achieved. The design is to help improve the transmission energy efficiency too.

An Energy-efficient Clustering algorithm using the Guaranteed Distance for Wireless Sensor Networks (무선 센서 네트워크에서의 에너지 효율을 위한 클러스터링 알고리즘)

  • Kim N.H.;Park T.R.;Kwon W.H.;Chang B.S.;Kim Y.H.;Lee B.Y.
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.382-385
    • /
    • 2004
  • In this paper, a new clustering algorithm using the Guaranteed Distance is proposed. In the new algorithm, the appropriate distribution of clusterheads is accomplished by guarantee the stochastic average distance between clusterhead (CH)s. Using this algorithm, the communication cost from clusterheads to their member nodes and the load variance in each clusterheads are reduced. Therefore, the network lifetime can be extended and the fair energy consumption for all nodes can be achieved.

  • PDF