• Title/Summary/Keyword: hierarchical network design

Search Result 168, Processing Time 0.028 seconds

Routing protocol Analysis for Minimum delay Between Hierarchical node in Low Power Sensor Network (저 전력 센서 네트워크에서의 계층 노드 간 지연 감소를 위한 라우팅 프로토콜 분석)

  • Kim, Dong Il
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.7
    • /
    • pp.1721-1726
    • /
    • 2014
  • 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. The major traffic patterns of plenty of sensor networks are composed of collecting types of single directional data, which is transmitting packets from several sensor nodes to sink 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. In this paper analysis used routing protocols using the network simulation that was used second level cluster structure to reduce delay and power-consumption of sensor node.

Multi Event Server Architecture for Hierarchical Event Service under Ubiquitous Network Environment (유비쿼터스 네트웍 환경에서 계층적 이벤트 서비스를 위한 다중 이벤트 서버 아키텍처)

  • 신준헌;박준호;강순주;최준용
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.4B
    • /
    • pp.424-434
    • /
    • 2004
  • Ubiquitous network consists of various devices using several heterogeneous protocols and requires seamless communication between devices. This paper proposes a new hierarchical event service and multiple event server architecture to implement the service under ubiquitous environment. The proposed event service classifies devices by logical and physical location to abstract the idiosyncrasy of used protocols, and reduces network load. Due to the design consideration, the proposed architecture removes transfer of duplicated event data effectively. As a result, we can guarantee the reliable event delivery. The prototype multiple event server architecture was implemented according to the proposed idea and evaluated its performance under a home network test bed.

Routing protocol Analysis for Minimum delay Between Hierarchical node in USN (USN에서의 계층 노드 간 지연 감소를 위한 라우팅 프로토콜 분석)

  • Kim, Dong-il
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.733-736
    • /
    • 2013
  • 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. The major traffic patterns of plenty of sensor networks are composed of collecting types of single directional data, which is transmitting packets from several sensor nodes to sink 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. In this paper analysis used routing protocols using the network simulation that was used second level cluster structure to reduce delay and power-consumption of sensor node.

  • PDF

A SOA Service Identification Model Based on Hierarchical Ontology (계층적 온톨로지 기반의 SOA서비스 식별 모델)

  • Park, Sei-Kwon;Choi, Ko-Bong
    • Journal of Information Technology Services
    • /
    • v.12 no.1
    • /
    • pp.323-340
    • /
    • 2013
  • As the importance of collaboration becomes critical in today's open and complex business environment network, the issues and solutions on compatibility and reusability between different kinds of applications are being increasingly important as well in systems analysis and design. And therefore, service-centered SOA is receiving attention in such business environment as a strategic approach that makes possible for prompt action according to the needs of users and business process. Various implementation methodologies have been proposed for SOA, however, in practical aspects most of them have some problems since they fail to propose specific policies in definition and identification of services for the exact user requirements and business situations. To solve or alleviate those problems, this paper suggests a new service identification model based on hierarchical ontology, where three different ontologies such as business ontology, context ontology and service ontology are proposed to define the relationship and design the link between user requirements, business process, applications and services. Through a suggested methodology in this paper, it would be possible to provide proactive services that meets a variety of business environments and demands of user. Also, since the information can be modified adaptively and dynamically by hierarchical ontology, this study is expected to play a positive role in increasing the flexibility of systems and business environments.

Misclassified Samples based Hierarchical Cascaded Classifier for Video Face Recognition

  • Fan, Zheyi;Weng, Shuqin;Zeng, Yajun;Jiang, Jiao;Pang, Fengqian;Liu, Zhiwen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.2
    • /
    • pp.785-804
    • /
    • 2017
  • Due to various factors such as postures, facial expressions and illuminations, face recognition by videos often suffer from poor recognition accuracy and generalization ability, since the within-class scatter might even be higher than the between-class one. Herein we address this problem by proposing a hierarchical cascaded classifier for video face recognition, which is a multi-layer algorithm and accounts for the misclassified samples plus their similar samples. Specifically, it can be decomposed into single classifier construction and multi-layer classifier design stages. In single classifier construction stage, classifier is created by clustering and the number of classes is computed by analyzing distance tree. In multi-layer classifier design stage, the next layer is created for the misclassified samples and similar ones, then cascaded to a hierarchical classifier. The experiments on the database collected by ourselves show that the recognition accuracy of the proposed classifier outperforms the compared recognition algorithms, such as neural network and sparse representation.

Efficient Detour routing path detection algorithm based on the hierarchical network structure analysis (계층적 네트웍 구조 분석 기반의 패킷우회 검출 알고리즘)

  • 김진천;이동근;이동현;최상복
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.10a
    • /
    • pp.65-69
    • /
    • 2001
  • Network Management become more and more important issue in the network environment in which many applications such as Mail, teleconferencing, WWW and database software are operated. It can be possible for The Bridge and flouter forwarding data to select next hop device which results in routing incorrect path from the viewpoint of network design. In this paper we address the problem of finding the detour routing path due to incorrect setting on routing devices. We propose the new algorithm for finding detour routing path based on hierarchical network structure analysis using information from SNMP MIB. To prove the correctness of the proposed algorithm we have done simulation with predefined data. Simulation results show that the algorithm finds detour path correctly

  • PDF

MIB-II based Algorithm for hierarchical network analysis and detection of detour routing paths (MIB-II 기반 계층적 네트워크 구조 분석 및 패킷우회 검출 알고리즘)

  • 김진천
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.7
    • /
    • pp.1442-1448
    • /
    • 2003
  • Network Management become more and more important issue in the network environment in which many applications such as Mail, teleconferencing, WWW and database software are operated. It can be possible for The Bridge and Router forwarding data to select next hop device which results in routing incorrect path from the viewpoint of network design. In this paper we address the problem of finding the detour routing path due to incorrect setting on routing devices. We propose the new algorithm for finding detour muting path based on hierarchical network structure analysis using information from SNMP MIB. To prove the correctness of the unposed algorithm we have done simulation with predefined data. Simulation results show that the algorithm finds detour path correctly.

A New Low-Skew Clock Network Design Method (새로운 낮은 스큐의 클락 분배망 설계 방법)

  • 이성철;신현철
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.41 no.5
    • /
    • pp.43-50
    • /
    • 2004
  • The clock skew is one of the major constraints for high-speed operation of synchronous integrated circuits. In this paper, we propose a hierarchical partitioning based clock network design algorithm called Advanced Clock Tree Generation (ACTG). Especially new effective partitioning and refinement techniques have been developed in which the capacitance and edge length to each sink are considered from the early stage of clock design. Hierarchical structures obtained by parhtioning and refinement are utilized for balanced clock routing. We use zero skew routing in which Elmore delay model is used to estimate the delay. An overlap avoidance routing algorithm for clock tree generation is proposed. Experimental results show significant improvement over conventional methods.

Improvement of Hierarchical Routing in ZigBee Networks (지그비 계층적 라우팅의 성능 향상 기법)

  • Kim, Taehong;Kim, Daeyoung;Yoo, Seong-Eun;Sung, Jongwoo;Kim, Youngsoo
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.1 no.2
    • /
    • pp.104-112
    • /
    • 2006
  • ZigBee is the emerging industrial standard for ad hoc networks based on IEEE 802.15.4. It is used for low data rate and low power wireless network applications. Expected applications of ZigBee include wireless sensor networks for remote monitoring, home control, and industrial automation. Since one of the most important design goals of ZigBee is to reduce the installation and running costs, the ZigBee stack is embedded in the cheap and small micro-controller unit. The hierarchical routing algorithm is used for ZigBee end devices which have very limited resources. Using the block addressing scheme, end devices can send data to the destination without a routing table. However, hierarchical routing has the problem that the packets follow the tree hierarchy to the destination even if the destination is located nearby. In this paper, we propose a scheme to improve the hierarchical routing algorithm in ZigBee networks by employing the neighbor table that is originally used together with the routing table. We suggest selecting the neighbor node that has the minimum remaining hops to the destination as the next hop node. Simulation result shows that the proposed scheme saves more than 30% of the hop counts compared with the original hierarchical routing.

  • PDF

Dynamic Behavior of Regulatory Elements in the Hierarchical Regulatory Network of Various Carbon Sources-Grown Escherichia coli

  • Lee, Sung-Gun;Hwang, Kyu-Suk;Kim, Cheol-Min
    • Journal of Microbiology and Biotechnology
    • /
    • v.15 no.3
    • /
    • pp.551-559
    • /
    • 2005
  • The recent rapid increase in genomic data related to many microorganisms and the development of computational tools to accurately analyze large amounts of data have enabled us to design several kinds of simulation approaches for the complex behaviors of cells. Among these approaches, dFBA (dynamic flux balance analysis), which utilizes FBA, differential equations, and regulatory events, has correctly predicted cellular behaviors under given environmental conditions. However, until now, dFBA has centered on substrate concentration, cell growth, and gene on/off, but a detailed hierarchical structure of a regulatory network has not been taken into account. The use of Boolean rules for regulatory events in dFBA has limited the representation of interactions between specific regulatory proteins and genes and the whole transcriptional regulation mechanism with environmental change. In this paper, we adopted the operon as the basic structure, constructed a hierarchical structure for a regulatory network with defined fundamental symbols, and introduced a weight between symbols in order to solve the above problems. Finally, the total control mechanism of regulatory elements (operons, genes, effectors, etc.) with time was simulated through the linkage of dFBA with regulatory network modeling. The lac operon, trp operon, and tna operon in the central metabolic network of E. coli were chosen as the basic models for control patterns. The suggested modeling method in this study can be adopted as a basic framework to describe other transcriptional regulations, and provide biologists and engineers with useful information on transcriptional regulation mechanisms under extracellular environmental change.