无线Mesh网络路由判据的研究

无线网状网(wMN)相关技术的研究非常活跃,路由判据的设计是提高其性能的关键.文章研究了几种现有的路由判据,包括HOP、ETX、ETT、WCETT、MIC、WCETT-LB,并对其进行了详细的分析;提出了对路由判据的改进思路,指出多准则路由判据、跨层路由判据是以后的研究方向.     

无线Mesh网中一种基于综合准则的DSR扩展路由方法

无线Mesh网(Wireless Mesh Network:WMN)是一种新型的分布式宽带无线网络结构,相对于典型的移动Ad hoc网络,该网络由于具有节点移动性小、不受电池动力限制等特点,从而导致传统的移动Ad hoc路由协议不再适用.为了满足WMN多媒体业务传输的性能要求,WMN路由必须满足负载均衡、路由容错与网络容量等目标.本文首先介绍了当前几种已有的WMN路由协议,在此基础上,提出了一种适用于WMN的基于综合准则的动态源路由(Dynamic Source Routing:DSR)扩展路由方法,该方法综合考虑了投递率、剩余带宽以及节点负载等因素.分析与仿真结果表明,该算法极大地提高了网络吞吐量,并且达到了负载均衡的设计目标.     

无线Mesh网络路由协议研究

首先讨论了无线Mesh网络（WMN）路由协议的研究背景及其特点，阐述了WMN路由协议研究现状，介绍了其相关商业应用情况，并对其特性进行了简要分析。分别对多判据路由、QOS路由、分级路由、多信道路由、跨层路由等路由协议的设计原则和思路进行了详细讨论。最后。结合一些研究热点问题，展望了WMN路由协议的研发前景。     

一种面向小型无人机自组网的路由判据

针对小型无人机自组网节点数量多、位置动态变化、续航时间有限等特点,对经典航空路由协议(The Aeronautical Routing Protocol, AeroRP)中的判据进行改进,设计了一种基于节点生存时间的路由判据,综合考虑网络内无人机节点的剩余飞行时间、当前矢量速度、相关节点间距离和单跳最大传输距离等参数,通过对上述参数的无纲化处理得到判距,进而选取最优的下一跳节点。利用ns-3网络软件对改进判据进行仿真实现和性能分析,结果表明,新的路由判据在AeroRP中应用后,网络的传输吞吐量、准确度和时延等指标都明显好于经典的主动式路由协议——优化链路状态路由协议(Optimized Link State Routing Protocol, OLSR);并且相比经典AeroRP协议中的判据,改进判据在数据传输准确度提高的前提下,当网内节点数量超过70个时网络数据传输的吞吐量明显提升,更适合节点数量较多的应用场合。     

无线Mesh网络路由协议研究

无线网状网络（WMN）的路由协议是无线Mesh领域的研究重点。文章先对移动Ad hoc网络的经典路由协议进行分类和比较,在此基础上总结了将Adhoc路由协议应用于无线Mesh网络的几种主流的改进思路,最后对各种改进思路的代表性路由协议进行了分析和讨论。     

基于跨层设计的AODV路由优化机制

以AODV(无线自组网按需平面距离矢量路由)协议为原型,针对WMN(无线Mesh网)中传统AODV协议路由判据单一从而导致路由性能较差的缺陷,采用跨层设计方法为WMN设计了一种新的IAODV(优化的AODV)协议。在路由计算过程中通过跨层操作机制提取节点当前负载和链路投递率这两个影响链路质量的因素,结合路由跳数设计出合理的路由判决函数。理论分析和NS2仿真结果证明,这种路由优化机制提高了吞吐量,降低了网络时延,并且能够达到负载均衡的路由效果。     

链路累积干扰（CIL）在无线Mesh网络中的应用

由于无线Mesh网络具有无线节点的静态性或半静态性以及共享无线媒介等特性,因此在无线Mesh网络中设计路由判据对网络的整体性能起着至关重要的作用。分析了现有的最小跳数（hop count）、期望传输次数（ETX）、加权累积ETT（WCETT）、MIC等4种路由判据,并指出它们的优缺点。最后提出了一种链路累积干扰（CIL）的路由判据方法,从理论上分析其优点,给出仿真结果。仿真结果说明,这种链路累积干扰路由判据能明显改善网络性能。     

无线Mesh网络路由协议研究

无线网状网络(WMN)的路由算法是Mesh领域的研究重点,采用何种路由协议使无线Mesh网络在需要的环境中性能达到最优,是目前WMN路由协议应用的实际问题.文中提出了设计无线网状网路由协议时需具备的特点,对目前提出WMN路由协议进行了分析研究,并比较了WMN路由协议优缺点,对WMN路由协议的选择提供了依据.     

无线Mesh网络中路由算法的研究

无线Mesh网络(WMN)近年来受到了越来越多的关注,对其路由协议的研究一直是个热点问题。WMN是由移动自组织网络(MANET)发展起来,针对应用在MANET中的DSR、AODV、DSDV、CEDAR等4种路由协议算法,分析并总结它们的优缺点,并对上述4种算法在WMN中应用的可行性进行了分析。     

WMN多路径路由算法安全性分析与仿真

高效、安全的路由机制是保证无线网状网络(WMN)正常工作的一个重要因素。对WMN中的多径路由(MPR)算法进行了研究。由于MPR算法存在路由分离性约束,提出了一种基于转移概率的随机路由(SR)算法,并对这两种算法进行了仿真。仿真结果表明:在节点转发次数的标准方差和最高截获率两个性能指标方面,SR算法均优于MPR算法,这说明与MPR算法相比,所提算法进一步增强了WMN网络的路由安全性。     

Design and Performance Evaluation of IAR: Interference-Aware Routing Metric for Wireless Mesh Networks

Multihop wireless mesh networks are an attractive solution for providing last-mile connectivity. However, the shared nature of the transmission medium makes it challenging to fully exploit these networks. In an attempt to improve the radio resource utilization, several routing metrics have been specifically designed for wireless mesh networks. However none of these routing metrics efficiently tackles interference issues. Moreover, although some evaluations have been conducted to assess the performance of these metrics in some contrived scenarios, no overall comparison has been performed. The contributions of this paper are consequently twofold. First, we propose a new routing metric, Interference-Aware Routing metric (IAR), specifically designed for WMNs. IAR uses MAC-level information to measure the share of the channel that each link is able to utilize effectively. As a result, paths that exhibit the least interference will be selected to route the data traffic. Then we evaluate the performance of IAR against some of the most popular routing metrics currently used in wireless mesh networks: Hop Count, Blocking Metric, Expected Transmission Count (ETX), Expected Transmission Time (ETT), Modified ETX (mETX), Network Allocation Vector Count (NAVC) and Metric of Interference and Channel-Switching (MIC). We show under various simulation scenarios that IAR performs the best in terms of end-to-end delay and packet loss, and provides the fairest resource utilization.     

On Routing in Multichannel Wireless Mesh Networks: Challenges and Solutions

Wireless mesh networks have emerged as a promising solution to providing cost-effective last-mile connectivity. Employing multiple channels is shown to be an effective approach to overcoming the problem of capacity degradation in multihop wireless networks. However, existing routing schemes that are designed for single-channel multihop wireless networks may lead to inefficient routing paths in multichannel WMNs. To fully exploit the capacity gain due to multiple channels, one must consider the availability of multiple channels and distribute traffic load among channels as well as among nodes in routing algorithms. In this article we focus on the routing problem in multichannel WMNs. We highlight the challenges in designing routing algorithms for multichannel WMNs and examine existing routing metrics that are designed for multichannel WMNs, along with a simulation-based performance study. We also address some open research issues related to routing in multichannel WMNs.     

Reinforcement learning based routing in wireless mesh networks

This paper addresses the problem of efficient routing in backbone wireless mesh networks (WMNs) where each mesh router is equipped with multiple radio interfaces and a subset of nodes serve as gateways to the Internet. Most routing schemes have been designed to reduce routing costs by optimizing one metric, e.g., hop count and interference ratio. However, when considering these metrics together, the complexity of the routing problem increases drastically. Thus, an efficient and adaptive routing scheme that takes into account several metrics simultaneously and considers traffic congestion around the gateways is needed. In this paper, we propose an adaptive scheme for routing traffic in WMNs, called Reinforcement Learning-based Distributed Routing (RLBDR), that (1) considers the critical areas around the gateways where mesh routers are much more likely to become congested and (2) adaptively learns an optimal routing policy taking into account multiple metrics, such as loss ratio, interference ratio, load at the gateways and end-to end delay. Simulation results show that RLBDR can significantly improve the overall network performance compared to schemes using either Metric of Interference and Channel switching, Best Path to Best Gateway, Expected Transmission count, nearest gateway (i.e., shortest path to gateway) or load at gateways as a metric for path selection.     

基于无线Mesh网络的干扰感知型路由判据

在无线Mesh网络路由判据的研究中,最小跳数、ETX、ETT等路由判据没有考虑到无线网络中的干扰问题,据此选出的一般不是最佳路由。因此,基于它们的路由协议会对整个无线Mesh网络的延时、丢包率、吞吐量等性能产生较大影响。干扰感知型路由判据的提出对无线Mesh网络性能的提升起到了一定的作用。     

The Impact of Deployment Pattern and Routing Scheme on the Lifetime in Multi-Sink Wireless Sensor Network

Extensive use of sensor and actuator networks in many real-life applications introduced several new performance metrics at the node and network level. Since wireless sensor nodes have significant battery constraints, therefore, energy efficiency, as well as network lifetime, are among the most significant performance metrics to measure the effectiveness of given network architecture. This work investigates the performance of an event-based data delivery model using a multipath routing scheme for a wireless sensor network with multiple sink nodes. This routing algorithm follows a sink initiated route discovery process with the location information of the source nodes already known to the sink nodes. It also considers communication link costs before making decisions for packet forwarding. Carried out simulation compares the network performance of a wireless sensor network with a single sink, dual sink, and multi sink networking approaches. Based on a series of simulation experiments, the lifetime aware multipath routing approach is found appropriate for increasing the lifetime of sensor nodes significantly when compared to other similar routing schemes. However, energy-efficient packet forwarding is a major concern of this work; other network performance metrics like delay, average packet latency, and packet delivery ratio are also taken into the account.

     

EFT: a high throughput routing metric for IEEE 802.11s wireless mesh networks

In this paper, we present a throughput-maximizing routing metric, referred to as expected forwarding time (EFT), for IEEE 802.11s-based wireless mesh networks. Our study reveals that most of the existing routing metrics select the paths with minimum aggregate transmission time of a packet. However, we show by analyses that, due to the shared nature of the wireless medium, other factors, such as transmission time of the contending nodes and their densities and loads, also affect the performance of routing metrics. We therefore first identify the factors that hinder the forwarding time of a packet. Furthermore, we add a new dimension to our metric by introducing traffic priority into our routing metric design, which, to the best of our knowledge, is completely unaddressed by existing studies. We also show how EFT can be incorporated into the hybrid wireless mesh protocol (HWMP), the path selection protocol used in the IEEE 802.11s draft standard. Finally, we study the performance of EFT through simulations under different network scenarios. Simulation results show that EFT outperforms other routing metrics in terms of average network throughput, end-to-end delay, and packet loss rate.     

Quality-Aware Routing Metrics for Time-Varying Wireless Mesh Networks

This paper considers the problem of selecting good paths in a wireless mesh network. It is well-known that picking the path with the smallest number of hops between two nodes often leads to poor performance, because such paths tend to use links that could have marginal quality. As a result, quality-aware routing metrics are desired for networks that are built solely from wireless radios. Previous work has developed metrics (such as ETX) that work well when wireless channel conditions are relatively static (DeCouto , 2003), but typical wireless channels experience variations at many time-scales. For example, channels may have low average packet loss ratios, but with high variability, implying that metrics that use the mean loss ratio will perform poorly. In this paper, we describe two new metrics, called modified expected number of transmissions (mETX) and effective number of transmissions (ENT) that work well under a wide variety of channel conditions. In addition to analyzing and evaluating the performance of these metrics, we provide a unified geometric interpretation for wireless quality-aware routing metrics. Empirical observations of a real-world wireless mesh network suggest that mETX and ENT could achieve a 50% reduction in the average packet loss rate compared with ETX     

High-throughput multicast routing metrics in wireless mesh networks

The stationary nature of nodes in a mesh network has shifted the main design goal of routing protocols from maintaining connectivity between source and destination nodes to finding high-throughput paths between them. Numerous link-quality-based routing metrics have been proposed for choosing high-throughput routing paths in recent years. In this paper, we study routing metrics for high-throughput tree or mesh construction in multicast protocols. We show that there is a fundamental difference between unicast and multicast routing in how data packets are transmitted at the link layer, and accordingly how the routing metrics for unicast routing should be adapted for high-throughput multicast routing. We propose a low-overhead adaptive online algorithm to incorporate link-quality metrics to a representative multicast routing protocol. We then study the performance improvement achieved by using different link-quality-based routing metrics via extensive simulation and experiments on a mesh-network testbed, using ODMRP as a representative multicast protocol.Our extensive simulation studies show that: (1) ODMRP equipped with any of the link-quality-based routing metrics can achieve higher throughput than the original ODMRP. In particular, under a tree topology, on average, ODMRP enhanced with link-quality routing metrics achieve up to 34% higher throughput than the original ODMRP under low multicast sending rate; (2) the improvement reduces to 21% under high multicast sending rate due to higher interference experienced by the data packets from the probe packets; (3) heavily penalizing lossy links is an effective way in the link-quality metric design to avoid low-throughput paths; and (4) the path redundancy from a mesh data dissemination topology in mesh-based multicast protocols provides another degree of robustness to link characteristics and reduces the additional throughput gain achieved by using link-quality-based routing metrics. Finally, our experiments on an eight-node testbed show that on average, ODMRP using SPP and PP achieves 14% and 17% higher throughput over ODMRP, respectively, validating the simulation results.     

An interconnection architecture for network-on-chip systems

Network on Chip (NoC) is a discipline research path that primarily addresses the global communication in System on Chip (SoC). It is inspired and uses the same routing and switching techniques needed in multi-computer networks. Current shared-bus based on-chip communication architectures generally have limited scalability due to the nature of the buses especially when complex on-chip communication SoC is needed. The main goal is to have a dedicated communication infrastructure in the system that can scale up while minimizing the area and power. The selected topology of the components interconnects plays prime rule in the performance of NoC architecture as well as routing and switching techniques that can be used. In this paper, we introduce a new NoC architecture by adapting a recursive topology structure. An experimental study is performed to compare this structure with basic NoC topologies represented by 2D mesh and Spidergon. The analysis illustrates the main features of this topology and its unique benefits. The simulation results show that recursive network outperforms 2D mesh and Spidergon in main performance metrics.