• Title/Summary/Keyword: 메쉬 라우팅

Search Result 92, Processing Time 0.021 seconds

An Enhanced-WCETT Routing Metric based on Available Bandwidth and Traffic Load in Wireless Mesh Networks (무선 메쉬 네트워크에서 가용 대역폭과 부하를 고려한 확장된 WCETT 라우팅 메트릭)

  • Lee, Ji-Soo;Hwang, Jun-Ho;Yoo, Myung-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.3B
    • /
    • pp.204-211
    • /
    • 2012
  • Wireless Mesh Network (WMN) has drawn much attention due to wide service coverage with low system cost. However, WMN suffers from high bit error rate, which provides different link capacity among wireless mesh routers. The conventional routing metrics select the path based on link quality. The link with the best quality is preferred as the data transmission path, and they becomes the bottleneck links, which leads to network performance degradation. In this paper, we propose a routing metric that considers the available bandwidth and the number of nodes suffering congestion in the path. Through computer simulations, we verified that the proposed routing metric outperforms the existing routing metrics in terms of average transmission delay, packet loss, system throughput.

A deadlock-Free Fault-Tolerant routing Method Using Partial-Adaptiveness in a N-Dimensional Meshed Network (N-차원 메쉬 네트워크에서의 부분적 적응성을 이용한 Deadlock-Free 결함포용 라우팅 기법)

  • Mun, Dae-Geun;Gam, Hak-Bae
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.4
    • /
    • pp.1090-1097
    • /
    • 1999
  • the multi computers operated in harsh environments should be designed to guarantee normal operations in the presence of the component faults. One solution for this is a fault-tolerant routing. In the paper, we consider n-dimensional meshed network for the basic topology and propose a simple fault-tolerant routing algorithm that can transfer messages to their destination as desired in the presence of some component faults. the built algorithms basically adopts a WormHole(WH) routing method and uses the virtual channels sharing a physical channel for deadlock-freedom. Consequently, we show that the suggested algorithm has a higher performance than the X-Y routing algorithm through simulation results.

  • PDF

Link-Disjoint Embedding of Complete Binary Trees in 3D-Meshes (3차원 메쉬에 대한 완전 이진트리의 링크 충돌없는 임베딩)

  • 이주영;이상규
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.7_8
    • /
    • pp.381-386
    • /
    • 2003
  • In this paper, we consider the problem of embedding complete binary trees into 3-dimensional meshes. The method of embedding a complete binary tree into 3-dimensional mesh with the link congestion two is considered in [1], and the embedding in [2] shows that a complete binary tree can be embedded into a ,3-dimensional mesh of expansion 1.27. The proposed embedding in this paper shows that a complete binary tree can be embedded into a 3-dimensional mesh of expansion approximately 1.125 with the link congestion one, using the dimensional ordered routing. Such method yields some improved features in terms of minimizing the link congestion or the expansion of embedding comparing to the previous results.

Mesh Network Implementation using DWDS-based Link Layer Routing (DWDS 기반의 링크 계층 라우팅을 통한 메쉬 네트워크 구현)

  • Yoon, Mi-Kyung;Yang, Seung-Chur;Kim, Jong-Deok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.2A
    • /
    • pp.165-173
    • /
    • 2010
  • WMN(Wireless Mesh Network) is an wireless backbone network technology that is an easily configurable network in the low cost compared to the wireless LAN(Local Area Network). Most of the previous researches have evaluated their algorithms by the simulations rather than by the implementation. There exist some implementation papers, however, they have the limitations of the flexibility on the link establishment and the link quality utilization. Consequently, the benefit of the WMN - configuration flexibility is degraded and the performance deterioration occurs in the multi-hop wireless environment. In this paper, we introduce a Linux-based link layer Wireless Mesh Routing System - WBMR. The design and implementation of WBMR provides the dynamic link establishment and the effective multi-channel usage. We have modified the ntroof the original WLAN operation for the dynamic link establishment, and the Linux bridge for the link layer routing. The result of performance evaluation verifies that our WBMR supports fast self-configuration and increases data transmission throughput compared to the other researches of the wireless multi-hop environment.

A Performance Analysis of Efficient Wormhole Routing for Multicast Communication in Torus Networks (토러스에서 다중전송을 위한 효율적 웜홀 라우팅의 성능 분석)

  • 김소은;김창수;윤성대
    • Proceedings of the Korea Association of Information Systems Conference
    • /
    • 1998.10a
    • /
    • pp.145-149
    • /
    • 1998
  • 본 논문에서는 동일한 목적지 노드들의 집합을 가지는 다중 멀티캐스트(multiple multicast)가 동시에 일어날 경우 노드간의 경쟁을 최소화하고 메시지 전송 경로를 단축시 키기 위한 알고리즘을 제시하고, 2차원 네트워크인 토러스 구조에서 제시된 본 논문의 알고 리즘을 기존 알고리즘과 비교한다. 기존 논문에서는 멀티캐스트 메시지 패싱 시스템 (multicast message-passing system)에서 여러 개의 소스노드로부터 목적지 노드가 중첩 되는 다중 멀티캐스트를 구현하기 위한 방법으로 2차원 메쉬 구조의 특징을 이용한 SCHL(Source-Centered Hierarchical Leader) 기법[7,8]이 제안되었다. 본 논문에서는 이 를 토러스 구조에 적합하게 변형하여, 기존의 메쉬 구조에 적용된 SCHL 기법[7]과 성능을 분석함으로써 제안된 알고리즘이 메쉬 구조보다 토로스 구조에서 구현될 때, 더 향상된 성 능을 가진다는 것을 보인다. 본 논문에서의 메시지 전송기법은 결정적 웜홀 라우팅 방식을 이용한다.

  • PDF

Design of Fire Evacuation Guidance System using USN Mesh Routing in High-Rise Buildings (초고층 건물 화재에서 USN 메쉬 라우팅을 이용한 피난유도 시스템 설계)

  • Choi, Yeon-Yi;Joe, In-Whee
    • Fire Science and Engineering
    • /
    • v.22 no.3
    • /
    • pp.278-286
    • /
    • 2008
  • When big fire in high rise building and multiplex happens, the needs for high prevention system of disaster are being increased for getting the real-time scene state, quick lifesaver, and safe life security. In this paper the proposed evacuation guidance algorithm which analyzed the feature and danger of fire in high rise buildings, gave simplicity and scalability. Our research shows as fire and disaster occur in high rise buildings we construct sensor networks and sense realtime location information on fire alive people, and the situation information for fire instructed quick and safe escaping route by using mesh routing algorithm scheme relative to exit sign.

An Optimal Path Routing in Wireless Mesh Network (무선 메쉬 네트워크에서 최적화된 경로선정을 위한 라우팅)

  • Lee, Ae-Young;Roh, II-Soon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.6
    • /
    • pp.43-48
    • /
    • 2009
  • Wireless mesh networks, unlike Ad-hoc network, has low mobility and multi-path communication between terminals and other networks because it has the backbone structures. Most studies are advanced on finding the optimal routing path in multi-hop wireless mesh network environment. Various routing metric, minimum number of hops(Hop_count) and ETX, ETT metric, are proposed to wireless mesh networks. However, most metrics cannot identify the high throughput routing paths because this metric uses a different measurement parameters in each direction. So actual delivery rate does not provide to this metric. This paper describes the metric and implementation of IETC as a metric. This paper shows the improvement in performance.

  • PDF

MA(Mesh Adaptive)-CBRP Algorithm for Wireless Mesh Network (Wireless Mesh Network를 위한 MA(Mesh Adaptive)-CBRP 알고리즘의 제안)

  • Kim, Sung-Joon;Cho, Gyu-Seob
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.11B
    • /
    • pp.1607-1617
    • /
    • 2010
  • In this paper we propose MA-CBRP, mesh adaptive algorithm for wireless mesh networks. MA-CBRP is a hybrid algorithm based on ad-hoc CBRP protocol. In MA-CBRP, the mesh router periodically sends the ANN message as like Hello-message in CBRP. ANN message allows to all clients periodically store a route towards the mesh-router and renewal information in their routing cache. While CBRP periodically reply Hello-message, MA-CBRP does not reply to achieve less overhead. After receiving ANN message, mesh client send JOIN message to mesh router when the route towards mesh router changed. at the same time Register the entry to mesh router, it can achieve to reduce overhead of control the route and shorten the time to find route. consequently, MA-CBRP shows 7% reduced overhead and shortened time to find route than CBRP with regardless of clients number.

Improved AODV Routing Protocol for Optimized Path over Wireless Mesh Network (무선 메쉬 네트워크에서 최적의 경로 설정을 위한 개선된 AODV 라우팅 프로토콜)

  • Kim, Yu-Doo;Moon, Il-Young
    • Journal of Advanced Navigation Technology
    • /
    • v.12 no.4
    • /
    • pp.350-356
    • /
    • 2008
  • The recent networks are trending toward wireless networks. So wireless internet used to service of wired networks. But wireless networks can't show same performance of wired networks. Therefore, we are must concerned about Routing Protocol for improvement of a weak point of physical feature. But many researchers are not focusing on developing Routing Protocol. In this paper, we improve on AODV(Ad-hoc On-demand Distance Vector) for Wireless Mesh Networks. And it analyzed the result of simulation.

  • PDF

Cluster Label-based ZigBee Mesh Routing Protocol (클러스터 라벨 기반의 지그비 메쉬 라우팅 프로토콜)

  • Lee, Kwang-Koog;Kim, Seong-Hoon;Park, Hong-Seong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.11A
    • /
    • pp.1164-1172
    • /
    • 2007
  • To solve scalability problem in the ZigBee Network, this paper presents a new mesh routing protocol for ZigBee, called ZigBee Cluster Label (ZiCL). ZiCL divides the ZigBee network into one or more logical clusters and then assigns a unique Cluster Label to each cluster so that it discovers a route of a destination node based on Cluster Label. When a node collects new Cluster Label information of a destination node according to discovery based on Cluster Label, ZiCL encourages nodes with the same Cluster Label to share the information. Consequen tly, it contributes on reducing numerical potential route discoveries and improving network performances such as routing overhead, end-to-end delay, and packet delivery ratio. Simulation results using NS-2 show ZiCL performs well.