• Title/Summary/Keyword: Hierarchical Network

Search Result 975, Processing Time 0.027 seconds

Topology Aggregation for Hierarchical Wireless Tactical Networks

  • Pak, Woo-Guil;Choi, Young-June
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.2
    • /
    • pp.344-358
    • /
    • 2011
  • Wireless tactical network (WTN) is the most important present-day technology enabling modern network centric warfare. It inherits many features from WMNs, since the WTN is based on existing wireless mesh networks (WMNs). However, it also has distinctive characteristics, such as hierarchical structures and tight QoS (Quality-of-Service) requirements. Little research has been conducted on hierarchical protocols to support various QoS in WMN. We require new protocols specifically optimized for WTNs. Control packets are generally required to find paths and reserve resources for QoS requirements, so data throughput is not degraded due to overhead. The fundamental solution is to adopt topology aggregation, in which a low tier node aggregates and simplifies the topology information and delivers it to a high tier node. The overhead from control packet exchange can be reduced greatly due to decreased information size. Although topology aggregation is effective for low overhead, it also causes the inaccuracy of topology information; thus, incurring low QoS support capability. Therefore, we need a new topology aggregation algorithm to achieve high accuracy. In this paper, we propose a new aggregation algorithm based on star topology. Noting the hierarchical characteristics in military and hierarchical networks, star topology aggregation can be used effectively. Our algorithm uses a limited number of bypasses to increase the exactness of the star topology aggregation. It adjusts topology parameters whenever it adds a bypass. Consequently, the result is highly accurate and has low computational complexity.

A Multi-Chain Based Hierarchical Topology Control Algorithm for Wireless Sensor Networks

  • Tang, Hong;Wang, Hui-Zhu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3468-3495
    • /
    • 2015
  • In this paper, we present a multi-chain based hierarchical topology control algorithm (MCHTC) for wireless sensor networks. In this algorithm, the topology control process using static clustering is divided into sensing layer that is composed by sensor nodes and multi-hop data forwarding layer that is composed by leader nodes. The communication cost and residual energy of nodes are considered to organize nodes into a chain in each cluster, and leader nodes form a tree topology. Leader nodes are elected based on the residual energy and distance between themselves and the base station. Analysis and simulation results show that MCHTC outperforms LEACH, PEGASIS and IEEPB in terms of network lifetime, energy consumption and network energy balance.

Hierarchical Routing Algorithm for Improving Survivability of WSAN

  • Cho, Ji-Yong;Choi, Seung-Kwon;Cho, Yong-Hwan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.2
    • /
    • pp.51-60
    • /
    • 2016
  • This paper proposes a hierarchical routing algorithm for enhancing survivability of sensor nodes on WSAN. Proposed algorithm has two important parts. The first is a clustering algorithm that uses distance between sensor and actor, and remaining energy of sensor nodes for selecting cluster head. It will induce uniform energy consumption, and this has a beneficial effect on network lifetime. The second is an enhanced routing algorithm that uses the shortest path tree. The energy efficient routing is very important in WSAN which has energy limitation. As a result, proposed algorithm extends network and nodes lifetime through consuming energy efficiently. Simulation results show that the proposed clustering algorithm outperforms conventional routing algorithms such as VDSPT in terms of node and network life time, delay, fairness, and data transmission ratio to BS.

Design of Hierarchical Classifier for Classifying Defects of Cold Mill Strip using Neural Networks (신경회로망을 이용한 냉연 표면흠 분류를 위한 계층적 분류기의 설계)

  • Kim, Kyoung-Min;Lyou, Kyoung;Jung, Woo-Yong;Park, Gwi-Tae;Park, Joong-Jo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.4 no.4
    • /
    • pp.499-505
    • /
    • 1998
  • In developing an automated surface inspect algorithm, we have designed a hierarchical classifier using neural network. The defects which exist on the surface of cold mill strip have a scattering or singular distribution. We have considered three major problems, that is preprocessing, feature extraction and defect classification. In preprocessing, Top-hit transform, adaptive thresholding, thinning and noise rejection are used Especially, Top-hit transform using local minimax operation diminishes the effect of bad lighting. In feature extraction, geometric, moment, co-occurrence matrix, and histogram ratio features are calculated. The histogram ratio feature is taken from the gray-level image. For defect classification, we suggest a hierarchical structure of which nodes are multilayer neural network classifiers. The proposed algorithm reduced error rate by comparing to one-stage structure.

  • PDF

Interactive Human Intention Reading by Learning Hierarchical Behavior Knowledge Networks for Human-Robot Interaction

  • Han, Ji-Hyeong;Choi, Seung-Hwan;Kim, Jong-Hwan
    • ETRI Journal
    • /
    • v.38 no.6
    • /
    • pp.1229-1239
    • /
    • 2016
  • For efficient interaction between humans and robots, robots should be able to understand the meaning and intention of human behaviors as well as recognize them. This paper proposes an interactive human intention reading method in which a robot develops its own knowledge about the human intention for an object. A robot needs to understand different human behavior structures for different objects. To this end, this paper proposes a hierarchical behavior knowledge network that consists of behavior nodes and directional edges between them. In addition, a human intention reading algorithm that incorporates reinforcement learning is proposed to interactively learn the hierarchical behavior knowledge networks based on context information and human feedback through human behaviors. The effectiveness of the proposed method is demonstrated through play-based experiments between a human and a virtual teddy bear robot with two virtual objects. Experiments with multiple participants are also conducted.

Optimal Operations of the Virtual Link System in Hierarchical Link-State Routing: A Multi-Criteria Genetic Algorithm Approach (계층화된 링크 - 상태 인터넷 라우팅에서 가상 링크 운용 최적화를 위한 다기준 유전자 알고리즘의 응용)

  • Kim, Do-Hoon
    • IE interfaces
    • /
    • v.16 no.spc
    • /
    • pp.14-20
    • /
    • 2003
  • This paper presents a multi-criteria decision model and Multi-Criteria Generic Algorithm(MCGA) approach to improve backbone topology by leveraging the Virtual Link(VL) system in an hierarchical Link-State(LS) routing domain. Given that the sound backbone topology structure has a great impact on the overall routing performance in an hierarchical LS domain, the importance of this research is evident. The proposed decision model is to find an optimal configuration of VLs that properly meets two-pronged engineering goals in installing and maintaining VLs: i.e., operational costs and network reliability. The experiment results clearly indicates that it is essential to the effective operations of hierarchical LS routing domain to consider not only engineering aspects but also specific benefits from systematical layout of VLs, thereby presenting the validity of the decision model and MCGA.

Multi-task learning with contextual hierarchical attention for Korean coreference resolution

  • Cheoneum Park
    • ETRI Journal
    • /
    • v.45 no.1
    • /
    • pp.93-104
    • /
    • 2023
  • Coreference resolution is a task in discourse analysis that links several headwords used in any document object. We suggest pointer networks-based coreference resolution for Korean using multi-task learning (MTL) with an attention mechanism for a hierarchical structure. As Korean is a head-final language, the head can easily be found. Our model learns the distribution by referring to the same entity position and utilizes a pointer network to conduct coreference resolution depending on the input headword. As the input is a document, the input sequence is very long. Thus, the core idea is to learn the word- and sentence-level distributions in parallel with MTL, while using a shared representation to address the long sequence problem. The suggested technique is used to generate word representations for Korean based on contextual information using pre-trained language models for Korean. In the same experimental conditions, our model performed roughly 1.8% better on CoNLL F1 than previous research without hierarchical structure.

An Energy-Efficient Data Aggregation using Hierarchical Filtering in Sensor Network (센서 네트워크에서 계층적 필터링을 이용한 에너지 효율적인 데이터 집계연산)

  • Kim, Jin-Su;Park, Chan-Heum;Kim, Chong-Gun;Kang, Byung-Wook
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.1 s.45
    • /
    • pp.73-82
    • /
    • 2007
  • This paper proposes how to reduce the amount of data transmitted in each sensor and cluster head in order to lengthen the lifetime of sensor network by data aggregation of the continuous queries. The most important factor of refuting the sensor's energy dissipation is to reduce the amount of messages transmitted. The method proposed is basically to combine clustering, in-network data aggregation and hierarchical filtering. Hierarchical filtering is to divide sensor network by two tiers when filtering it. First tier performs filtering when transmitting the data from cluster member to cluster head, and second tier performs filtering when transmitting the data from cluster head to base station. This method is much more efficient and effective than the previous work. We show through various experiments that our scheme reduces the network traffic significantly and increases the network's lifetime than existing methods.

  • PDF

Assessing Throughput and Availability based on Hierarchical Clustering in Wireless Sensor Networks (계층적 클러스터링을 기반으로 하는 무선 센서 네트워크의 Throughput 과 Availability 평가)

  • Lee Jun-Hyuk;Oh Young-Hwan
    • Journal of Applied Reliability
    • /
    • v.5 no.4
    • /
    • pp.465-486
    • /
    • 2005
  • A unreliable network system results in unsatisfied performance. A performance criterion of a network is throughput and availability. One of the most compelling technological advances of this decade has been the advent of deploying wireless networks of heterogeneous smart sensor nodes for complex information gathering tasks, The advancement and popularization of wireless communication technologies make more efficiency to network devices with wireless technology than with wired technology. Recently, the research of wireless sensor network has been drawing much attentions. In this paper, We evaluate throughput and availability of wireless sensor network, which have hierarchical structure based on clustering and estimate the maximum hroughput, average throughput and availability of the network considering several link failure patterns likely to happen at a cluster consisted of sensor nodes. Also increasing a number of sensor nodes in a cluster, We analysis the average throughput and availability of the network.

  • PDF

Localized Positioning method for Optimal path Hierarchical clustering algorithm in Ad hoc network (에드 혹 네트워크에서 노드의 국부 위치 정보를 이용한 최적 계층적 클러스터링 경로 라우팅 알고리즘)

  • Oh, Young-Jun;Lee, Kang-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.11
    • /
    • pp.2550-2556
    • /
    • 2012
  • We proposed the energy-efficient routing algorithm ALPS (Ad hoc network Localized Positioning System) algorithm that is range-free based on the distance information. The routing coordinate method of ALPS algorithm consists of hierarchical cluster routing that provides immediately relative coordinate location using RSSI(Received Signal Strength Indication) information. Existing conventional DV-hop algorithm also to manage based on normalized the range free method, the proposed hierarchical cluster routing algorithm simulation results show more optimized energy consumption sustainable path routing technique to improve the network management.