• Title/Summary/Keyword: mesh network

Search Result 527, Processing Time 0.029 seconds

Performance Analysis of Available Superframe Size and Device Discovery Time for Multi-hop Communications in IEEE 802.15.3 High-rate WPAN Mesh Network (IEEE 802.15.3 고속 WPAN 메쉬 네트워크의 멀티-홉 통신을 위한 가용 슈퍼프레임 크기와 디바이스 탐색 성능 분석)

  • Jung, Ssang-Bong;Yim, Soon-Bin;Kim, Hyun-Ki;Lee, Tae-Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.6B
    • /
    • pp.350-357
    • /
    • 2007
  • The IEEE 802.15.3 high-rate WPAN has been developed to communicate with devices within l0m. A piconet consists of one Piconet Coordinator (PNC) and several devices. The devices associated with a parent piconet can become child PNCs in order to form child piconets. A mesh network made up of a parent piconet and several child piconets can support multi-hop communications. In this paper, we analyze the maximum level and the avaliable superframe size to make the best use of bandwidth for multi-hop communications, and compare the analysis with the simulation results in terms of time to discover devices for multi-hop communications. The average number of levels in mesh networks is shown to be about 1.9 when the number of devices increases within a fixed area. We have also shown that the maximum available superframe size is 52ms and the discovery time is approximately 155ms.

Distributed Virtual Topology Adaptation Method to Support IP Traffic in WDM Mesh Networks (WDM Mesh 네트워크에서 IP 트래픽을 수용하기 위한 분산형 가상토폴로지 적응 기법)

  • Kim, Eal-Lae;Lee, Sung-Kuen;Lee, Yong-Won;Chang, Sun-Hyok;Lee, Myung-Moon;Park, Jin-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.1B
    • /
    • pp.1-10
    • /
    • 2007
  • We propose a new approach to accommodate bidirectional asymmetric traffic demands as well as unexpected dynamic internet traffic variation in the WDM mesh network by using optical networking technologies. In the proposed scheme, an intermediate node determines the optical path based on the switching statistics of IP router of the node which characterizes the Internet traffic variation, which in effect provides a dynamic and distributed traffic control over the network. It is expected to reduce the efficiency deterioration of RWA(Routing and Wavelength Assignment) due to the real-time variation of Internet traffic so that expandability and flexibility of the network can be enhanced. In this paper, we describe a methodology for traffic behavior analysis at a node, and the decision policy of the establishment/release of optical path. In addition, we evaluate the performance of the proposed scheme through the computer simulations.

Performance Evaluation of Directional AODV Routing Protocol for Wireless Mesh Networks (무선 메쉬 네트워크를 위한 방향섬 AODV 라우팅 프로토콜의 성능 평가)

  • Choi, Jae-In;Kim, Dae-Hwan;Le, Anh Ngoc;Lee, In-Soo;Cho, You-Ze
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.9B
    • /
    • pp.795-801
    • /
    • 2008
  • Wireless Mesh Networks (WMNs) are popular due to their low cost and rapid deployment. Currently, many WMN researchers often considers the use of ad-hoc routing protocols because WMNs are similar to the ad-hoc networks. Some of currently deployed WMNs consider to use on-demand routing protocols such as Ad-hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR). But, AODV are not appropriate for Wireless Mesh Networks (WMNs), because flooding-based route discovery is both redundant and expensive in terms of control message overhead. In this paper, we propose a directional AODV (D-AODV) routing protocol based on hop count to a gateway. We implement the D-AODV routing protocol and evaluate the performance of the D-AODV on the testbed. The measurement results show that the D-AODV can enhance the network throughput by reducing the routing overhead.

Topology Design Optimization for Improving Fail-over Performance in Wired Mesh Network (유선 메시 구조에서의 절체 성능 향상을 위한 네트워크 설계 기법)

  • Hwang, Jongsu;Jang, Eunjeong;Lee, Wonoh;Kim, Jonghyeok;Kim, Heearn
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.14 no.4
    • /
    • pp.165-175
    • /
    • 2019
  • Networks use relatively slow heartbeat mechanisms, usually in routing protocols, to detect failures when there is no hardware signaling to help out. The time to detect failures available in the existing protocols is no better than a second, which is far too long for some applications and represents a great deal of lost data at 10 Gigabit rates. We compare the convergence time of routing protocol applying Bidirectional Forwarding Detection (BFD) protocol in wired mesh network topology. This paper suggests the combinations of protocols improving fail-over performance. Through the performance analysis, we contribute to reduce convergence time when system is fail-over.

Local Feature Map Using Triangle Area and Variation for Efficient Learning of 3D Mesh (3차원 메쉬의 효율적인 학습을 위한 삼각형의 면적과 변화를 이용한 로컬 특징맵)

  • Na, Hong Eun;Kim, Jong-Hyun
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2022.07a
    • /
    • pp.573-576
    • /
    • 2022
  • 본 논문에서는 삼각형 구조로 구성된 3차원 메쉬(Mesh)에서 합성곱 신경망(Convolutional Neural Network, CNN)의 정확도를 개선시킬 수 있는 새로운 학습 표현 기법을 제시한다. 우리는 메쉬를 구성하고 있는 삼각형의 넓이와 그 로컬 특징을 기반으로 학습을 진행한다. 일반적으로 딥러닝은 인공신경망을 수많은 계층 형태로 연결한 기법을 말하며, 주요 처리 대상은 오디오 파일과 이미지이었다. 인공지능에 대한 연구가 지속되면서 3차원 딥러닝이 도입되었지만, 기존의 학습과는 달리 3차원 학습은 데이터의 확보가 쉽지 않다. 혼합현실과 메타버스 시장으로 인해 3차원 모델링 시장이 증가가 하면서 기술의 발전으로 데이터를 획득할 수 있는 방법이 생겼지만, 3차원 데이터를 직접적으로 학습 표현하는 방식으로 적용하는 것은 쉽지 않다. 그렇기 때문에 본 논문에서는 산업 현장에서 사용되는 데이터인 삼각형 메쉬 구조를 바탕으로 기존 방법보다 정확도가 높은 학습 기법을 제안한다.

  • PDF

A Parallel Algorithm for Finding Routes in Cities with Diagonal Streets

  • Hatem M. El-Boghdadi
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.1
    • /
    • pp.45-51
    • /
    • 2024
  • The subject of navigation has drawn a large interest in the last few years. The navigation within a city is to find the path between two points, source location and destination location. In many cities, solving the routing problem is very essential as to find the route between different locations (starting location (source) and an ending location (destination)) in a fast and efficient way. This paper considers streets with diagonal streets. Such streets pose a problem in determining the directions of the route to be followed. The paper presents a solution for the path planning using the reconfigurable mesh (R-Mesh). R-Mesh is a parallel platform that has very fast solutions to many problems and can be deployed in moving vehicles and moving robots. This paper presents a solution that is very fast in computing the routes.

A Study on QoS Routing Performance Enhancement by using LSQR Scheduling in WiMAX Mesh Networks (와이맥스 메쉬 네트워크에서 LSQR 스케줄링을 이용한 QoS 라우팅 성능 향상에 관한 연구)

  • Tak, Wooyoung;Lee, Gowoon;Joh, Hangki;Ryoo, Intae
    • Journal of Digital Contents Society
    • /
    • v.14 no.4
    • /
    • pp.429-437
    • /
    • 2013
  • Recently, wireless mesh network has been focused as a core technology for resolving the issues of shadow zone and distributed bypass route as it has broad service coverage as well as good scalability features. It, however, provides users with relatively lower QoS than infrastructure-based networks. In order for addressing this QoS issue and also enhancing the routing performance of mobile WiMax mesh network, this paper proposes a load sensing QoS routing (LSQR) scheme. In the proposed LSQR, each node figures out network congestion status and selects a bypass route accordingly. With this scheme, we can expect good load balancing effect by changing the routing paths from centralized links to distributed links under a heavy traffic condition. From the simulation results using NS-2, it has been verified that the LSQR shows lower packet loss rates and data transmission delays than the existing representative routing schemes.

Frame Management Method to Support QoS of MAC Protocol Based TDMA in Mesh Network Environment (메쉬네트워크 환경에서 TDMA기반 MAC 프로토콜의 QoS를 지원하기 위한 프레임 관리기법)

  • Jang, In-Yong;Lee, Sun-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.6
    • /
    • pp.75-87
    • /
    • 2009
  • It is difficult to support QoS service in existing MAC Protocols in Wireless Mesh Network environments. while DCF can not support QoS, EDCA is operated with prioritized channel access method but can not give full performance. This thesis proposes frame management method to support QoS in Multi-Media DCF(MMDCF) MAC Protocol working in wireless mesh network. MMDCF uses ACH phase in TDMA frame to perform selection and elimination. Prioritized phases's count m and Fair Elimination phases's count n determine contention level and make string probability to only one win the contention. Forced TDMA Frame release method can support QoS requirements. MMDCF results good performance and good channel efficiency to support QoS requirements better than EDCA in multimedia stream environments.

  • PDF

A Study on Design Scheme of Mesh-Based Survivable WDM Networks (메쉬 기반의 생존성 WDM망의 설계 기법에 관한 연구)

  • 현기호;정영철
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.40 no.7
    • /
    • pp.507-517
    • /
    • 2003
  • A single fiber failure in mesh-based WDM networks may result in the loss of a large number of data. To remedy this problem, an efficient restoration algorithm for a single fiber failure in the mesh- based WDM network is necessary. We propose a new algorithm for restoration scheme in WDM networks and compare it with previous schemes. Path restoration and link restoration are two representative restoration schemes which deal with only a single link failure. In this paper, we propose two kinds of efficient restoration scheme. In the proposed schemes the restoration path for each link failure is not secured. The mesh network is decomposed into a number of small loops. In one algorithm, any link failure in a certain loop is regarded as the failure of the loop and the restoration lightpath is selected by detouring the failed loop. In another scheme any link failure in a certain loop is restored within the loop. We compare performance of the proposed schemes with conventional path restoration scheme and link restoration scheme. Simulation results show that CPU time in the proposed schemes decreases compared with that in path restoration scheme and link restoration scheme, although total wavelength mileage usage increases by 10% to 50%.

High Performance QoS Multicast Routing Scheme for Real-Time Mobile Multimedia Applications in Wireless Mesh Networks (무선메쉬네트워크에서 실시간 이동 멀티미디어 응용을 위한 고성능 QoS 멀티캐스트 라우팅 기법)

  • Kang, Moonsik
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.6
    • /
    • pp.85-94
    • /
    • 2015
  • In this paper, an enhanced QoS multicast routing scheduling scheme is proposed to adapt to a dynamic mobile traffic condition for wireless mesh networks (WMNs). It handles the network QoS by controlling the delay constraints for multimedia applications. The group size will be controlled according to both the current network state and QoS requirements. The dynamic reconstruction of QoS multicast tree can be obtained from preprocessing with both the partial multicast routing scheme and the traffic estimation. Performance evaluation of the proposed scheme is carried out on randomly generated graph derived from the wireless mesh network, by choosing the optimal value related to the appropriate delay bounds. Simulation results show that the proposed scheme can improve the performance of QoS multicast routing for WMNs.