The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] routing metric(4hit)

1-4hit
  • Node Degree Based Routing Metric for Traffic Load Distribution in the Internet

    Jun'ichi SHIMADA  Hitomi TAMURA  Masato UCHIDA  Yuji OIE  

     
    PAPER

      Vol:
    E96-D No:2
      Page(s):
    202-212

    Congestion inherently occurs on the Internet due to traffic concentration on certain nodes or links of networks. The traffic concentration is caused by inefficient use of topological information of networks in existing routing protocols, which reduces to inefficient mapping between traffic demands and network resources. Actually, the route with minimum cost, i.e., number of hops, selected as a transmission route by existing routing protocols would pass through specific nodes with common topological characteristics that could contribute to a large improvement in minimizing the cost. However, this would result in traffic concentration on such specific nodes. Therefore, we propose a measure of the distance between two nodes that is suitable for reducing traffic concentration on specific nodes. To consider the topological characteristics of the congestion points of networks, we define node-to-node distance by using a generalized norm, p-norm, of a vector of which elements are degrees of intermediate nodes of the route. Simulation results show that both the maximum Stress Centrality (SC) and the coefficient of variation of the SC are minimized in some network topologies by selecting transmission routes based on the proposed measure of node-to-node distance.

  • A Hidden-Exposed Terminal Interference Aware Routing Metric for Multi-Radio and Multi-Rate Wireless Mesh Networks

    Shouguang JIN  Kenichi MASE  

     
    PAPER

      Vol:
    E92-B No:3
      Page(s):
    709-716

    In this paper, we propose a novel Hidden-terminal and Exposed-terminal Interference aware routing metric (HEI-ETT) for Multi-Radio and Multi-Rate wireless mesh networks in which each stationary mesh node is equipped with multi-radio interfaces that relays traffic to the extend networks by using multi-hop transmissions. We have two main design goals for HEI-ETT. First, we will characterize interferences as Hidden-terminal Interference and Exposed-terminal Interference regardless of inter- or intra-flow interference and should take into account both interference effects while computing the path metric. Second, an efficient transmission rate adaptation should be employed in HEI-ETT to enhance the network throughput. We incorporated our metric in well known Optimized Link State Routing protocol version 2 (OLSRv2) which is one of the two standard routing protocols for MANETs and evaluated the performance of our metric by simulation. The results show that our metric outperforms existing metrics such as ETX, ETT and WCETT.

  • Routing with Load-Balancing in Multi-Radio Wireless Mesh Networks

    Anh-Ngoc LE  Dong-Won KUM  You-Ze CHO  Chai-Keong TOH  

     
    PAPER

      Vol:
    E92-B No:3
      Page(s):
    700-708

    This paper addresses the interference and load imbalance problems in multi-radio infrastructure mesh networks where each mesh node is equipped with multiple radio interfaces and a subset of nodes serve as Internet gateways. To provide backbone support, it is necessary to reduce interference and balance load in Wireless Mesh Networks (WMNs). In this paper, we propose a new Load-Aware Routing Metric, called LARM, which captures the differences in transmission rates, packet loss ratio, intra/inter-flow interference and traffic load in multi-radio mesh networks. This metric is incorporated into the proposed load-balancing routing, called LBM, to provide load balancing for multi-radio mesh network. Simulation results show that LARM provides better performance compared to WCETT and hop-count routing metrics in LBM routing protocol.

  • Hidden Node Problem Aware Routing Metrics for WLAN Mesh Networks

    Jaturong SANGIAMWONG  Kengo YAGYU  Toshihiro SUZUKI  

     
    PAPER

      Vol:
    E91-B No:10
      Page(s):
    3113-3121

    This paper proposes two novel hidden node problem aware routing metrics for wireless local area network (WLAN) mesh networks. To select the path that is least affected by the serious hidden node problem, we propose two routing metrics, MNn and MPCP, that take into account the number of neighboring nodes (Nn) and the packet collision probability (PCP), respectively. The PCP is estimated from neighbor information that is periodically gathered as state announcement packets, which include the transmission time ratio and the neighbor list. Simulation results show that the first proposed MNn routing metric tends to be less effective as the number of WLAN nodes increases, i.e., the mesh network becomes denser. On the other hand, with an acceptable increased in the control overhead in the mesh network due to the neighbor information, the second proposed MPCP routing metric improves the number of allowable concurrent voice over Internet Protocol (VoIP) calls and the user datagram protocol (UDP) data throughput compared to the MNn metric. The MPCP also provides better performance than the other conventional routing metrics, the hop count, and the Airtime proposed in IEEE 802.11s.