• Title/Summary/Keyword: Routing metric

Search Result 116, Processing Time 0.024 seconds

An Enhanced Routing Protocol for Support Mobility in Mobile Ad hoc Networks (이동 ad hoc 네트워크의 이동성을 지원하기 위한 향상된 라우팅 프로토콜)

  • Kim, Kwan-Woong;Kim, Dae-Ik
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.6
    • /
    • pp.131-138
    • /
    • 2008
  • Mobile Ad hoc NETworks (MANETs) refer to autonomous networks in which wireless data communications are established between multiple nodes in a given coverage area without a base station or centralized administration. Because of node mobility and limited battery life, the network topology may changes frequently. Selecting the most reliable path during route discovery process is important to improve performance in ad hoc networks. In this paper, an enhanced routing protocol based on AODV(Ad hoc On-demand Distance Vector routing) by monitoring variation of receiving signal strength is proposed. New metric function that consists of node mobility and hops of path is used for routing decision. For preventing route failure by node movement during data transmission, a new route maintenance named as LRC (Local Route Change) is presented. If the node movement is detected, the routing agent switches path to its neighbor node in LRC. Simulation results show that the performance of the proposed routing scheme is superior to previous AODY protocol.

An Efficient Multipath Routing with Dynamic Load Balancing (효율적인 동적 부하 균등 분산을 적용한 다중 경로 라우팅)

  • Jung, Sun;Lee, Mee-Jeong
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.3
    • /
    • pp.406-416
    • /
    • 2001
  • Single path routing schemes using dynamic routing metric amy find out the dynamic network status and recompute paths to keep the traffic from the highly loaded regions of the network. This type of routing approach, however, may lead to a routing oscillation, and further, it cannot exploit multi-paths that may frequently exist in the real network. We propose a multipath routing scheme with dynamic load balancing, called MP-DLB, which is capable of reducing the overhead incurred by the multipath routing with dynamic load balancing approach while taking advantage of the high routing performance provided by the approach. According to the analysis of Internet packet traces which show that a high percentage of network traffic is destined for a small number of networks, MP-DLB applies the multipath routing with dynamic load balancing only to a limited subset of all the destinations in the network. For the rest of the destinations, it applies traditional single path routing scheme. This approach may reduce overall routing overheads by limiting the number of destinations to apply the more complicated routing scheme while it can keep the routing performance high by providing efficient routing for the most significant traffic in the routing performance. A series of simulations are done to analyze the performance of MP-DLB. The simulation results show that MP-DLB may effectively cope with the congestion and achieve high routing performance by distributing traffic streams that are generated from varying sources and heading toward a specific hot destination over multi-paths.

  • PDF

Energy Saving Characteristics of OSPF Routing Based on Energy Profiles (Energy Profile에 기반한 OSPF 라우팅 방식의 에너지 절약 특성)

  • Seo, Yusik;Han, Chimoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.7
    • /
    • pp.1296-1306
    • /
    • 2015
  • Nowadays the research of energy saving on the IP networks have been studied the various methods in many research institutes. This paper suggests the energy saving method in IP networks which have the various energy profiles, and analyzes its energy saving characteristics in detail. Especially this paper proposes the energy profile based OSPF routing method which have the selectable weighted value in OSPF metric and energy consumption in IP network. This paper analyzes the energy saving effects of the various situations to minimize the energy consumption using the various weighted value on the proposed scheme. The results show that the energy saving efficiency can get about 67% at in ingress input load ${\rho}=0.5$ by using random energy profiles in IP networks. Although the number of hops is a slight increased due to routing the paths for the minimum energy consumption in the algorithm of this method, the increment hop number is limited the mean 1.4 hops. This paper confirms that the energy profile of core router has the large effects of energy saving than the energy profile of edge router, and the proposed method has the excellent energy saving characteristics in IP networks.

A Priority Based Multipath Routing Mechanism in the Tactical Backbone Network (전술 백본망에서 우선순위를 고려한 다중 경로 라우팅 방안)

  • Kim, Yongsin;Shin, Sang-heon;Kim, Younghan
    • Journal of KIISE
    • /
    • v.42 no.8
    • /
    • pp.1057-1064
    • /
    • 2015
  • The tactical network is system based on wireless networking technologies that ties together surveillance reconnaissance systems, precision strike systems and command and control systems. Several alternative paths exist in the network because it is connected as a grid to improve its survivability. In addition, the network topology changes frequently as forces and combatants change their network access points while conducting operations. However, most Internet routing standards have been designed for use in stable backbone networks. Therefore, tactical networks may exhibit a deterioration in performance when these standards are implemented. In this paper, we propose Priority based Multi-Path routing with Local Optimization(PMPLO) for a tactical backbone network. The PMPLO separately manages the global and local metrics. The global metric propagates to other routers through the use of a routing protocol, and it is used for a multi-path configuration that is guaranteed to be loop free. The local metric reflects the link utilization that is used to find an alternate path when congestion occurs, and it is managed internally only within each router. It also produces traffic that has a high priority privilege when choosing the optimal path. Finally, we conducted a simulation to verify that the PMPLO can effectively distribute the user traffic among available routers.

A Novel Adaptive Routing Algorithm for Delay-Sensitive Service in Multihop LEO Satellite Network

  • Liu, Liang;Zhang, Tao;Lu, Yong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.8
    • /
    • pp.3551-3567
    • /
    • 2016
  • The Low Earth Orbit satellite network has the unique characteristics of the non-uniform and time-variant traffic load distribution, which often causes severe link congestion and thus results in poor performance for delay-sensitive flows, especially when the network is heavily loaded. To solve this problem, a novel adaptive routing algorithm, referred to as the delay-oriented adaptive routing algorithm (DOAR), is proposed. Different from current reactive schemes, DOAR employs Destination-Sequenced Distance-Vector (DSDV) routing algorithm, which is a proactive scheme. DSDV is extended to a multipath QoS version to generate alternative routes in active with real-time delay metric, which leads to two significant advantages. First, the flows can be timely and accurately detected for route adjustment. Second, it enables fast, flexible, and optimized QoS matching between the alternative routes and adjustment requiring flows and meanwhile avoids delay growth caused by increased hop number and diffused congestion range. In addition, a retrospective route adjustment requesting scheme is designed in DOAR to enlarge the alternative routes set in the severe congestion state in a large area. Simulation result suggests that DOAR performs better than typical adaptive routing algorithms in terms of the throughput and the delay in a variety of traffic intensity.

Hybrid Link State Update Algorithm in QoS Routing (하이브리드 QoS 라우팅 링크 상태 갱신 기법)

  • Cho, Kang Hong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.3
    • /
    • pp.55-62
    • /
    • 2014
  • This paper has proposed Hybrid QoS Routing Link State Update(LSU) Algorithm that has had a both advantage of LSU message control in periodic QoS routing LSU algorithm and QoS routing performance in adaptive LSU algorithm. Hybrid LSU algorithm can adapt the threshold based network traffic information and has the mechanism that calculate LSU message transmission priority using the flow of statistical request bandwidth and available bandwidth and determine the transmission of the message according to update rate per a unit of time. We have evaluated the performance of the proposed algorithm and the existing algorithms on MCI simulation network using the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm that it can diminish to 10% of the LSU message count.

RoutingConvNet: A Light-weight Speech Emotion Recognition Model Based on Bidirectional MFCC (RoutingConvNet: 양방향 MFCC 기반 경량 음성감정인식 모델)

  • Hyun Taek Lim;Soo Hyung Kim;Guee Sang Lee;Hyung Jeong Yang
    • Smart Media Journal
    • /
    • v.12 no.5
    • /
    • pp.28-35
    • /
    • 2023
  • In this study, we propose a new light-weight model RoutingConvNet with fewer parameters to improve the applicability and practicality of speech emotion recognition. To reduce the number of learnable parameters, the proposed model connects bidirectional MFCCs on a channel-by-channel basis to learn long-term emotion dependence and extract contextual features. A light-weight deep CNN is constructed for low-level feature extraction, and self-attention is used to obtain information about channel and spatial signals in speech signals. In addition, we apply dynamic routing to improve the accuracy and construct a model that is robust to feature variations. The proposed model shows parameter reduction and accuracy improvement in the overall experiments of speech emotion datasets (EMO-DB, RAVDESS, and IEMOCAP), achieving 87.86%, 83.44%, and 66.06% accuracy respectively with about 156,000 parameters. In this study, we proposed a metric to calculate the trade-off between the number of parameters and accuracy for performance evaluation against light-weight.

Virtual Cluster-based Routing Protocol for Mobile Ad-Hoc Networks (이동 Ad-hoc 네트워크를 위한 가상 클러스터 방식의 경로 설정 프로토콜)

  • 안창욱;강충구
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.6C
    • /
    • pp.544-561
    • /
    • 2002
  • In this paper, we propose a new hybrid type of the routing protocol (Virtual Cluster-based Routing Protocol: VCRP) for mobile ad-hoc networks, based on a virtual cluster, which is defined as a narrow-sense network to exchange the basic information related to the routing among the adjacent nodes. This particular approach combines advantage of proactive routing protocol (PRP), which immediately provides the route collecting the network-wide topological and metric information, with that of reactive routing protocol, which relies on the route query packet to collect the route information on its way to the destination without exchanging any information between nodes. Furthermore, it also provides the back-up route as a byproduct, along with the optimal route, which leads to the VCBRP (Virtual Cluster-based Routing Protocol with Backup Route) establishing the alternative route immediately after a network topology is changed due to degradation of link quality and terminal mobility, Our simulation studies have shown that the proposed routing protocols are robust against dynamics of network topology while improving the performances of packet transfer delay, link failure ratio, and throughput over those of the existing routing protocols without much compromising the control overhead efficiency.

A Study on WMNs Based Routing Metrics for High Throughput Multicast

  • Gao, Hui;Kwag, Young-wan;Lee, Hyung-ok;Park, Jun-seok;Nam, Ji-seung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.11a
    • /
    • pp.785-788
    • /
    • 2012
  • There has been growing interest in multicast technologies for wireless mesh networks with increasing demand for enjoying seamless multimedia broadcast service such as mobile IPTV anytime anywhere for any content on any device. This paper addressed the factors that should be considered when designing multicast algorithm in WMNs. Several routing metrics which are adapted for WMNs based multicast are described in detail to show that the main design goal for multicast metric is to achieve high throughput. Those metrics that take into account the characteristics of WMNs such as wireless broadcast advantage or channel diversity can arrange load balancing more effectively.

Multi-interface Wireless Mesh Network Testbed using Wireless Distribution System (무선 분산 시스템을 이용한 멀티 인터페이스 무선 메쉬 네트워크 테스트베드)

  • Yoon, Mi-Kyung;Yang, Seung-Chur;Kim, Jong-Deok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.6
    • /
    • pp.1077-1082
    • /
    • 2009
  • Wireless Mesh Network(WMN) is wireless backbone networks technique which has ease of network configuration and cost of advantage. Recently, WNM released a new product, but most of existing research and technology analysis the performance through the simulation. This paper build the wireless mesh network testbed for actual situation. Testbed supports multi-channel multi-interface using bridge, the Wireless Distribution System and dynamic location-based routing protocol. This routing protocol strongly design against wireless interference using metric for link channel change and real distance. Then, the address of mesh clients assigned by the centralized address management server. Mesh clients is designed and implemented to manage network through Simple Network Management Protocol.