• 제목/요약/키워드: Hierarchical Network

검색결과 975건 처리시간 0.027초

모바일 싱크 네트워크를 적용한 망 관리 시스템의 설계 및 구현 (Design and Implementation of Network Management System Based on Mobile Sink Networks)

  • 김동옥
    • 정보통신설비학회논문지
    • /
    • 제8권4호
    • /
    • pp.216-222
    • /
    • 2009
  • This paper proposes an integrated mobile sink networks management system which can monitor and control various kinds of wireless lan access points, located in many different areas divided by their managing groups, from multi-vendors, and their operations in networks. The proposed system has the center-local interoperability structure cooperating with local-center servers which can perform the same operations as the central servers for wireless lan access points from multi-vendors and wireless lan centric management features. For this purpose, we propose a new way of data design, messaging policy, and hierarchical system structure such that we can achieve stable and consistent management methods for various wireless access points on distributed networks.

  • PDF

Neural network-based generation of artificial spatially variable earthquakes ground motions

  • Ghaffarzadeh, Hossein;Izadi, Mohammad Mahdi;Talebian, Nima
    • Earthquakes and Structures
    • /
    • 제4권5호
    • /
    • pp.509-525
    • /
    • 2013
  • In this paper, learning capabilities of two types of Arterial Neural Networks, namely hierarchical neural networks and Generalized Regression Neural Network were used in a two-stage approach to develop a method for generating spatial varying accelerograms from acceleration response spectra and a distance parameter in which generated accelerogram is desired. Data collected from closely spaced arrays of seismographs in SMART-1 array were used to train neural networks. The generated accelerograms from the proposed method can be used for multiple support excitations analysis of structures that their supports undergo different motions during an earthquake.

설비용량을 고려한 계층적 네트워크의 설계 및 분석 (Designing hierarchical ring-star networks under node capacity constraints)

  • 이창호;윤종화;정한욱
    • 한국경영과학회지
    • /
    • 제19권1호
    • /
    • pp.69-83
    • /
    • 1994
  • This paper deals with a capacitated ring-star network design problem (CRSNDP) with node capacity constraints. The CRSNDP is formulated as a mixed 0-1 integer problem, and a 2-phase heuristic solution procedure, ADD & VAM and RING, is developed, in which the CRSNDP is decomposed into two subproblems : the capacitated facility location problem (CFLP) and the traveling sales man problem (TSP). To solve the CFLP in phase I the ADD & VAM procedure selects hub nodes and their appropriate capacity from a candidate set and then assigns them user nodes under node capacity constraints. In phase II the RING procedure solves the TSP to interconnect the selected hubs to form a ring. Finally a solution of the CRSNDP can be achieved through combining two solution of phase I & II, thus a final design of the capacitated ring-star network is determined. The analysis of computational results on various random problems has shown that the 2-phase heuristic procedure produces a solution very fast even with large-scale problems.

  • PDF

Efficient Cluster Radius and Transmission Ranges in Corona-based Wireless Sensor Networks

  • Lai, Wei Kuang;Fan, Chung-Shuo;Shieh, Chin-Shiuh
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권4호
    • /
    • pp.1237-1255
    • /
    • 2014
  • In wireless sensor networks (WSNs), hierarchical clustering is an efficient approach for lower energy consumption and extended network lifetime. In cluster-based multi-hop communications, a cluster head (CH) closer to the sink is loaded heavier than those CHs farther away from the sink. In order to balance the energy consumption among CHs, we development a novel cluster-based routing protocol for corona-structured wireless sensor networks. Based on the relaying traffic of each CH conveys, adequate radius for each corona can be determined through nearly balanced energy depletion analysis, which leads to balanced energy consumption among CHs. Simulation results demonstrate that our clustering approach effectively improves the network lifetime, residual energy and reduces the number of CH rotations in comparison with the MLCRA protocols.

DEVS 모델링을 적용한 인터넷 위상 생성기 (An Internet Topology Generator Applying DEVS Modeling)

  • 손주항;박상준;한정안;김형종;이종찬;김병기
    • 한국시뮬레이션학회논문지
    • /
    • 제13권3호
    • /
    • pp.43-54
    • /
    • 2004
  • Studies of Internet algorithms or policies require experiments on the real large-scale networks. But practical problems with large real networks make them difficult. Instead many researchers use simulations on the Internet topology models. So, It is Important that study about topology model that reflect characteristic of the internet exactly. We propose new topology model which reflect of hierarchical network and addition, removal of nodes and accompanied change of topologies. In the modeling scheme for network generation, we applied DEVS formalism and analyzed the topologies generated by our algorithms.

  • PDF

Bidirectional MIN에서 효율적인 라우팅을 지원하기 위한 계층적 버퍼링 기법 (Hierarchical buffering scheme for supporting effective routing scheme in bidirectional MIN)

  • 장창수;김성천
    • 전자공학회논문지B
    • /
    • 제33B권10호
    • /
    • pp.12-19
    • /
    • 1996
  • Many recent supercomputers employ a kind of switch-based multistage interconnection network architectrues (MINs) for constructing scalabel parallel compters. This paper proposed a new routing method, hybrid wormhole and virtual-cut through routing (HWCR) for the prevention of rapid performance degradation comming from a conflict in links usage at hot traffic situation. This HWCR through (VCT) for the fast removing temporal stagger, result in seamless flow of packet stream. When the blocked link is removed, wormhole routing is resumed. The HWCR method adopted a hierachical buffer scheme for improving the network performance and reducing the cost in BMINs. We could get optimum buffer size and communicatin latency through the computer simulation based on proposed HWCR, and the results were compared to those using wormhole and VCT.

  • PDF

무선 센서네트워크를 위한 이중 계층 진화적 매체접근제어 프로토콜 설계 (HiPERMAC: Hierarchically-Paired Evolutionary Radio MAC Protocol for Wireless Sensor Network)

  • 김일환;장기석;강충구
    • 한국통신학회논문지
    • /
    • 제31권7A호
    • /
    • pp.709-716
    • /
    • 2006
  • 본 논문에서는 무선 센서 네트워크의 다양한 응용 환경 및 상/하향 트래픽 스트림의 특성에 따라 유연하게 적용할 수 있는 새로운 매체접근제어 프로토콜을 제안한다. HiPERMAC(Hierarchically-Paired Evolutionary Radio MAC)이라고 불리는 제안 매체접근제어방식은 다양한 클러스터링 방식에 의하여 구축된 다 계층 (Hierarchical) 네트워크에서 별도의 대역 확산 전송방식이나 다수의 주파수 채널을 사용하지 않고, 단 2개의 시간 구간을 공간적으로 재활용하여 N 계층의 개별적인 통신이 가능한 구조를 제공한다. 즉, 제안방식은 단일 주파수 개념을 이용하여 계층화된 우선 센서 네트워크를 계층적 이중화(Hierarchically-Paired)하고 이때 발생하는 클러스터 간 상호 간섭의 요인들을 시간 및 공간적으로 분리하여 망 확장성과 자원 효율성을 극대화 하는 새로운 매체접근 제어 방식 이다.

클러스터 트리 라우팅 프로토콜 연구 (Study of Cluster Tree Routing Protocols)

  • 조무호
    • 조명전기설비학회논문지
    • /
    • 제19권8호
    • /
    • pp.138-143
    • /
    • 2005
  • 클러스터 기반의 계층적 트리 구조는 대형화가 용이하면서 라우팅 프로토콜이 단순하다는 점에서 장점을 가진다. 본 논문에서는 무선 센스 네트워크에서 클러스터 트리 네트워크 관리를 효과적으로 지원할 수 있는 방안과 라우팅 프로토콜의 데이터 모음과 지연에 대해 분석한다. 수치 해석의 결과에서 보면 중간 노드에서의 데이터 모음을 통한 통신 메시지 수를 줄임으로 센스 노드의 전력 소모를 크게 절약할 수 있지만, 이에 따른 메시지 전달 지연이 커짐을 알 수 있었다. 또한 클러스터 헤드를 무작위로 선정하게 되면 메시지 지연이 매우 많이 증가될 수 있는 것이 확인되었다.

Comprehensive review on Clustering Techniques and its application on High Dimensional Data

  • Alam, Afroj;Muqeem, Mohd;Ahmad, Sultan
    • International Journal of Computer Science & Network Security
    • /
    • 제21권6호
    • /
    • pp.237-244
    • /
    • 2021
  • Clustering is a most powerful un-supervised machine learning techniques for division of instances into homogenous group, which is called cluster. This Clustering is mainly used for generating a good quality of cluster through which we can discover hidden patterns and knowledge from the large datasets. It has huge application in different field like in medicine field, healthcare, gene-expression, image processing, agriculture, fraud detection, profitability analysis etc. The goal of this paper is to explore both hierarchical as well as partitioning clustering and understanding their problem with various approaches for their solution. Among different clustering K-means is better than other clustering due to its linear time complexity. Further this paper also focused on data mining that dealing with high-dimensional datasets with their problems and their existing approaches for their relevancy

A Visual Communication Design Study: Graphic Element Design Under Traditional Handwork

  • Gengming Li
    • Journal of Information Processing Systems
    • /
    • 제19권2호
    • /
    • pp.203-210
    • /
    • 2023
  • The addition of traditional elements can enhance the uniqueness of visual communication design. This paper briefly introduced visual communication and applications of traditional elements in visual communication design and applied paper cuts, a handmade graphic element, to the logo design of Dezhou University's 50th anniversary. The convolutional neural network (CNN) algorithm and the analytic hierarchy process method were applied to evaluation analysis and compared with the support vector machine (SVM) algorithm. The results of the CNN algorithm on the test set verified its effectiveness. The evaluation results of the CNN algorithm were similar to the manual evaluation results, further proving the effectiveness and high efficiency of the CNN algorithm. The hierarchical analysis and the analysis of the assessment results of the CNN algorithm found that the two logo designs made full use of paper cuts.