• Title/Summary/Keyword: hierarchy clustering

Search Result 129, Processing Time 0.024 seconds

Cluster Head Selection Algorithm for Reducing overload of Head Node in Wireless Sensor Network (무선 센서 네트워크 환경에서 헤더 노드의 과부하를 줄이기 위한 클러스터 헤드 선출 알고리즘)

  • Lee, Jong-Sung;Jeon, Min-Ho;Oh, Chang-Heon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.612-615
    • /
    • 2012
  • Energy efficiency in wireless sensor network is a principal issue because wireless sensor network uses limited energy. In wireless sensor network, because nodes are placed randomly, they may be concentrated in certain area. This dense area causes shortening the life of the concentrated area, and furthermore reducing the life of the entire network. In this paper, we suggest a additional cluster head selection algorithm for reducing the overload of head node in dense area and shows simulation result using our algorithm with LEACH algorithm.

  • PDF

Analysis of Expressed Sequence Tags from the Wood-Decaying Fungus Fomitopsis palustris and Identification of Potential Genes Involved in the Decay Process

  • Karim, Nurul;Shibuya, Hajime;Kikuchi, Taisei
    • Journal of Microbiology and Biotechnology
    • /
    • v.21 no.4
    • /
    • pp.347-358
    • /
    • 2011
  • Fomitopsis palustris, a brown-rot basidiomycete, causes the most destructive type of decay in wooden structures. In spite of its great economic importance, very little information is available at the molecular level regarding its complex decay process. To address this, we generated over 3,000 expressed sequence tags (ESTs) from a cDNA library constructed from F. palustris. Clustering of 3,095 high-quality ESTs resulted in a set of 1,403 putative unigenes comprising 485 contigs and 918 singlets. Homology searches based on BlastX analysis revealed that 78% of the F. palustris unigenes had a significant match to proteins deposited in the nonredundant databases. A subset of F. palustris unigenes showed similarity to the carbohydrateactive enzymes (CAZymes), including a range of glycosyl hydrolase (GH) family proteins. Some of these CAZyme-encoded genes were previously undescribed for F. palustris but predicted to have potential roles in biodegradation of wood. Among them, we identified and characterized a gene (FpCel45A) encoding the GH family 45 endoglucanase. Moreover, we also provided functional classification of 473 (34%) of F. palustris unigenes using the Gene Ontology hierarchy. The annotated EST data sets and related analysis may be useful in providing an initial insight into the genetic background of F. palustris.

A study on the Robust and Systolic Topology for the Resilient Dynamic Multicasting Routing Protocol

  • Lee, Kang-Whan;Kim, Sung-Uk
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.3
    • /
    • pp.255-260
    • /
    • 2008
  • In the recently years, there has been a big interest in ad hoc wireless network as they have tremendous military and commercial potential. An Ad hoc wireless network is composed of mobile computing devices that use having no fixed infrastructure of a multi-hop wireless network formed. So, the fact that limited resource could support the network of robust, simple framework and energy conserving etc. In this paper, we propose a new ad hoc multicast routing protocol for based on the ontology scheme called inference network. Ontology knowledge-based is one of the structure of context-aware. And the ontology clustering adopts a tree structure to enhance resilient against mobility and routing complexity. This proposed multicast routing protocol utilizes node locality to be improve the flexible connectivity and stable mobility on local discovery routing and flooding discovery routing. Also attempts to improve route recovery efficiency and reduce data transmissions of context-awareness. We also provide simulation results to validate the model complexity. We have developed that proposed an algorithm have design multi-hierarchy layered networks to simulate a desired system.

Cluster-Head Election using SVM Algorithm in Wireless Sensor Networks (무선 센서 네트워크에서 SVM 알고리즘을 이용한 클러스터 헤드 결정기법)

  • Lee, In-Chul;Chang, Hyeong-Jun;Shim, Il-Joo;Chang, Kyung-Bae;Park, Gwi-Tae
    • Proceedings of the KIEE Conference
    • /
    • 2006.07d
    • /
    • pp.2099-2100
    • /
    • 2006
  • 제한된 전력의 노드들로 구성된 무선 센서 네트워크에서 효율적인 정보 수집이 이루어지기 위해서는 전체 네트워크의 Life Time을 늘리는 게 중요하다. 각각의 센서 노드들이 멀리 떨어져 있는 BS(Base Station)으로 직접 데이터를 전송하면 전력소비가 매우 크고 비효율 적이다. 그리하여 네트워크의 life time을 늘리기 위한 많은 연구가 이루어지고 있다. 그중에 클러스터링 기법은 가장 널리 연구되는 기법 중에 하나이다. 대표적인 클러스터링 기법 LEACH(Low-Energy Adaptive Clustering Hierarchy)[1]는 전체 노드 수의 5%클 클러스터 헤드로 결정하여 나머지 노드들로부터 데이터를 수집하여 BS로 전송함으로써 에너지를 효율적으로 사용하는 알고리즘이다. 그러나 클러스터 헤드를 결정하는데 있어서 잔여 에너지를 고려하지 않고 순환적으로 결정하는 문제점을 가지고 있다. 그래서 본 논문에서는 SVM(Supprt Vector Machine)을 이용하여 FND(First Node Dic)가 발생했을 때 각 노드들의 에너지 잔량 정도를 따져서 영역을 나눈 후, 에너지가 더 많은 영역에서 클러스터 헤드를 선정하는 방법을 제안한다. 잔량 에너지가 많은 노드를 클러스터 헤드로 결정함으로써 전체 네트워크의 life time을 늘릴 수 있다.

  • PDF

Routing protocol for efficient power consumption of sensor node (센서노드의 효율적인 전력소모를 위한 라우팅 프로토콜 연구)

  • Kim, Ki-Tae;Kim, Dong-Il
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.05a
    • /
    • pp.382-385
    • /
    • 2011
  • The sensor network technology for core technology of ubiquitous computing is in the spotlight recently, the research on sensor network is proceeding actively which is composed many different sensor node. One of the important condition for design of sensor node is to extend for network life which is to minimize power-consumption under the limited resources of sensor network. This study suggest routing protocol that was used second level cluster structure to reduce power-consumption of sensor node. the first level use the previous routing protocol under the LEACH, second level decide to transmit or not by comparision of data value for Effective Usage, reduce the unnecessary power-consumption.

  • PDF

An Energy-Efficient Clustering Algorithm consider Minimum-hop in Hierarchical Sensor Network (계층구조 센서 네트워크에서 Minimun-hop 을 고려한 클러스터 구성 알고리즘)

  • Kim, Yong;Lee, Doo-Wan;Jang, Kyung-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.10a
    • /
    • pp.510-513
    • /
    • 2010
  • In hierarchical wireless sensor network, Sensor nodes forming a cluster with a hierarchy. And there are being study for balanced energy consumption between cluster nodes. When forming network routing path, if there are configured incorrectly then it can be wasting energy. In this paper to solve these problem, We propose that it can consider sensor's communication range to create minimum hop layer when cluster heads configure routing path.

  • PDF

Hierarchical WSN Dual-hop Routing Protocol for Improvement of Energy Consumption

  • Park, SeaYoung;LEE, WooSuk;Kwon, Oh Seok;Jung, KyeDong;Lee, Jong-Yong
    • International journal of advanced smart convergence
    • /
    • v.5 no.2
    • /
    • pp.24-37
    • /
    • 2016
  • This paper proposes to increase the efficiency of energy in nodes, which rapidly drops during the transmission of the Low Energy Adaptive Clustering Hierarchy (LEACH), through the use of dual-hop layered application in the sensor field. Along with introducing the dual-hop method in the data transmission, the proposed single-hop method for short-range transmission and multi-hop transmission method between the cluster heads for remote transmission were also introduced. Additionally, by introducing a partial multi-hop method in the data transmission, a single-hop method for short range transmission method between the cluster heads for remote transmission was used. In the proposed DL-LEACH, the energy consumption of the cluster head for remote transmission reduced, as well as increased the energy efficiency of the sensor node by reducing the transmission distance and simplifying the transmission route for short-range transmission. As compared the general LEACH, it was adapted to a wider sensor field.

사용자 의도 정보를 사용한 웹문서 분류

  • Jang, Yeong-Cheol
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2008.10b
    • /
    • pp.292-297
    • /
    • 2008
  • 복잡한 시맨틱을 포함한 웹 문서를 정확히 범주화하고 이 과정을 자동화하기 위해서는 인간의 지식체계를 수용할 수 있는 표준화, 지능화, 자동화된 문서표현 및 분류기술이 필요하다. 이를 위해 키워드 빈도수, 문서내 키워드들의 관련성, 시소러스의 활용, 확률기법 적용 등에 사용자의도(intention) 정보를 활용한 범주화와 조정 프로세스를 도입하였다. 웹 문서 분류과정에서 시소러스 등을 사용하는 지식베이스 문서분류와 비 감독 학습을 하는 사전 지식체계(a priori)가 없는 유사성 문서분류 방법에 의도정보를 사용할 수 있도록 기반체계를 설계하였고 다시 이 두 방법의 차이는 Hybrid조정프로세스에서 조정하였다. 본 연구에서 설계된 HDCI(Hybrid Document Classification with Intention) 모델은 위의 웹 문서 분류과정과 이를 제어 및 보조하는 사용자 의도 분석과정으로 구성되어 있다. 의도분석과정에 키워드와 함께 제공된 사용자 의도는 도메인 지식(domain Knowledge)을 이용하여 의도간 계층트리(intention hierarchy tree)를 구성하고 이는 문서 분류시 제약(constraint) 또는 가이드의 역할로 사용자 의도 프로파일(profile) 또는 문서 특성 대표 키워드를 추출하게 된다. HDCI는 문서간 유사성에 근거한 상향식(bottom-up)의 확률적인 접근에서 통제 및 안내의 역할을 수행하고 지식베이스(시소러스) 접근 방식에서 다양성에 한계가 있는 키워들 간 관계설정의 정확도를 높인다.

  • PDF

Position-Based Cluster Routing Protocol for Wireless Microsensor Networks

  • Kim Dong-hwan;Lee Ho-seung;Jin Jung-woo;Son Jae-min;Han Ki-jun
    • Proceedings of the IEEK Conference
    • /
    • summer
    • /
    • pp.330-333
    • /
    • 2004
  • Microsensor nodes is energy limited in sensor networks. If nodes had been stop in working, sensor network can't acquire sensing data in that area as well as routing path though the sensor can't be available. So, it's important to maximize the life of network in sensor network. In this paper, we look at communication protocol, which is modified by LEACH(Low-Energy Adaptive Clustering Hierarchy). We extend LEACH's stochastic cluster-head selection algorithm by a Position-based Selection (PB-Leach). This method is that the sink divides the topology into several areas and cluster head is only one in an area. PB-Leach can prevent that the variance of the number of Cluster-Head is large and Cluster-Heads are concentrated in specific area. Simulation results show that PB-Leach performs better than leach by about 100 to $250\%.$

  • PDF

A Cluster-Based Energy-Efficient Routing Protocol without Location Information for Sensor Networks

  • Lee, Gil-Jae;Kong, Jong-Uk;Lee, Min-Sun;Byeon, Ok-Hwan
    • Journal of Information Processing Systems
    • /
    • v.1 no.1 s.1
    • /
    • pp.49-54
    • /
    • 2005
  • With the recent advances in Micro Electro Mechanical System (MEMS) technology, low cost and low power consumption wireless micro sensor nodes have become available. However, energy-efficient routing is one of the most important key technologies in wireless sensor networks as sensor nodes are highly energy-constrained. Therefore, many researchers have proposed routing protocols for sensor networks, especially cluster-based routing protocols, which have many advantages such as reduced control messages, bandwidth re-usability, and improved power control. Some protocols use information on the locations of sensor nodes to construct clusters efficiently. However, it is rare that all sensor nodes know their positions. In this article, we propose another cluster-based routing protocol for sensor networks. This protocol does not use information concerning the locations of sensor nodes, but uses the remaining energy of sensor networks and the desirable number of cluster heads according to the circumstances of the sensor networks. From performance simulation, we found that the proposed protocol shows better performance than the low-energy adaptive clustering hierarchy (LEACH).