Optimized link state routing for quality‐of‐service provisioning: implementation,measurement, and performance evaluation

This paper provides a measurement‐based performance evaluation of the Optimized Link State Routing (OLSR) protocol. Two versions of OLSR, OLSR‐ETX and OLSR‐ETT, are implemented and evaluated on a mesh network that we built from off‐the‐shelf commercial components and deployed within our department building. OLSR‐ETX uses the Expected Transmission Count (ETX) metric, whereas OLSR‐ETT uses the Expected Transmission Time (ETT) metric as a means of assessing link quality. The paper describes our implementation process of the ETT metric using the plug‐in feature of OLSRd, and our calculation method of link bandwidth using the packet‐pair technique. A series of measurements are conducted in our testbed to analyze and compare the performance of ETX and ETT metrics deemed useful for quality of service. Our measurements show that OLSR‐ETT outperforms OLSR‐ETX significantly in terms of packet loss, end‐to‐end delay, jitter, route changes, bandwidth, and overall stability, yielding much more robust, reliable, and efficient routing. Copyright © 2012 John Wiley & Sons, Ltd.     

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.     

Energy Efficient and Scalable Routing Protocol for Extreme Emergency Ad Hoc Communications

In this paper, we firstly present an energy efficient (E2) and protocol independent mechanism for Mobile Ad-hoc Networks (MANETs) routing in disaster rescue operations. In such extreme emergency scenarios, protocols need to be energy efficient and scalable. We therefore proceed to integrate the E2 mechanism with the scalable ChaMeLeon (CML) protocol and consequently term it as E2CML. We support the E2 mechanism design using an energy consumption model for MANET nodes and use a packet delivery delay model to explain the scalability and energy efficiency of CML. Through the integration process of E2-CML, we primarily aim at satisfying the requirements for emergency MANETs (eMANETs), but also intend to demonstrate that the proposed mechanism is portable across popular protocols such as Optimized Link State Routing (OLSR) and Ad hoc On-Demand Vector (AODV). Finally, the paper presents simulation results to compare the improved routing performance of E2CML against both AODV and OLSR.     

I2TS 03 Dynamic Metric Choice Routing for Wireless Mesh Networks

The increasing demand of multimedia applications requires a new conduct of routing protocols for Wireless Mesh Networks (WMN). It is necessary to support the minimum requirements for Quality of Service (QoS). In this work we propose an extension to the proactive Optimized Link State Routing (OLSR) protocol that differentiates the data traffic and multimedia traffic, in order to provide quality of service and support to applications which use TCP as their transport protocol. The proposal performance, called OLSR Dynamic Choice (OLSR-DC), is evaluated using the Network Simulator     

DLSA: Delay and Link Stability Aware Routing Protocol for Flying Ad-hoc Networks (FANETs)

Flying Ad-hoc Network (FANET) is a new class of Mobile Ad-hoc Network in which the nodes move in three-dimensional (3-D) ways in the air simultaneously. These nodes are known as Unmanned Aerial Vehicles (UAVs) that are operated live remotely or by the pre-defined mechanism which involves no human personnel. Due to the high mobility of nodes and dynamic topology, link stability is a research challenge in FANET. From this viewpoint, recent research has focused on link stability with the highest threshold value by maximizing Packet Delivery Ratio and minimizing End-to-End Delay. In this paper, a hybrid scheme named Delay and Link Stability Aware (DLSA) routing scheme has been proposed with the contrast of Distributed Priority Tree-based Routing and Link Stability Estimation-based Routing FANET’s existing routing schemes. Unlike existing schemes, the proposed scheme possesses the features of collaborative data forwarding and link stability. The simulation results have shown the improved performance of the proposed DLSA routing protocol in contrast to the selected existing ones DPTR and LEPR in terms of E2ED, PDR, Network Lifetime, and Transmission Loss. The Average E2ED in milliseconds of DLSA was measured 0.457 while DPTR was 1.492 and LEPR was 1.006. Similarly, the Average PDR in %age of DLSA measured 3.106 while DPTR was 2.303 and LEPR was 0.682. The average Network Lifetime of DLSA measured 62.141 while DPTR was 23.026 and LEPR was 27.298. At finally, the Average Transmission Loss in dBm of DLSA measured 0.975 while DPTR was 1.053 and LEPR was 1.227.

     

OLSR performance measurement in a military mobile ad hoc network

Wireless ad hoc networks are autonomous, self-configurating and adaptive. Thus, such networks are excellent candidates for military tactical networks, where their ability to be operational rapidly and without any centralized entity is essential. As radio coverage is usually limited, multihop routing is often needed; this is achieved by an ad hoc routing protocol supporting nodes mobility. In this paper, we present performance measurements of the Optimized Link State Routing (OLSR) routing protocol, having the status of IETF RFC. The measurements are performed at CELAR site on a platform representative of military scenarios in urban areas. This platform consists of ten routers, eight PDAs and laptops using a IEEE 802.11b radio interface and implementing OLSR v7. Some nodes are mobile within vehicles. The emphasis of the measurements is on the performance of the network (route repair, network convergence speed, user traffic performance) in presence of this mobility.     

New MPR Computation for Securing OLSR Routing Protocol Against Single Black Hole Attack

Wireless Personal Communications - The Optimized Link State Routing Protocol (OLSR) operates as proactive routing protocol destined for Mobile Ad hoc Network, OLSR is considering as one of the four...     

Ad Hoc网络中实现定位的OLSR协议研究

针对Ad Hoc网络中的节点位置估计和路由控制问题,在基于OLSR(最优链路状态路由)协议的基础上提出了一种能够同时实现路由和定位的综合协议OLSR-P(最优链路状态路由和定位)。该协议对OLSR协议进行了改进,能够将路由开销和定位有效结合,并对数据包结构进行改良,利用原协议的路由开销实现定位。仿真实验结果表明:OLSR-P协议不仅能够同时实现路由和定位,还能有效地控制开销。     

Energy- and Delay-Efficient Routing in Mobile Ad Hoc Networks

In this paper we discuss how we improved the MChannel group communication middleware for Mobile Ad-hoc Networks (MANETs) in order to let it become both delay- and energy-aware. MChannel makes use of the Optimized Link State Routing (OLSR) protocol, which is natively based on a simple hop-count metric for the route selection process. Based on such metric, OLSR exploits Dijkstra’s algorithm to find optimal paths across the network. We added a new module to MChannel, enabling unicast routing based on two alternative metrics, namely end-to-end delay and overall network lifetime. With such new module, we prove that network lifetime and average end-to-end delay improve, compared to the original OLSR protocol implementation included in the mentioned middleware. Thanks to MChannel’s approach, which implements routing in the user’s space, the improvements achieved in the unicast jOLSR routing protocol are transparently applied to the upstanding MChannel overlay multicast OMOLSR protocol. We also discuss how the proposed new module actually represents a general framework which can be used by programmers to introduce in MChannel novel metrics and path selection algorithms.     

一种低时延的短波自组网优化链路状态路由协议

优化链路状态路由(Optimized Link State Routing,OLSR)协议是一种先验式路由协议,网络中的所有节点通过周期性地发送控制消息来计算全网路由信息。在短波自组织网络中,节点周期性地发送控制消息会占据大量的信道资源,大幅增加网络的控制开销,浪费短波有限的带宽资源,导致网络通信性能急剧下降。其次,受到地形地貌、天线方向和接收性能的个体差异等影响,造成无线链路不稳定,导致网络中存在非对称链路,增加了通信端到端时延。为此,提出了一种低时延的短波自组网OLSR协议。该协议在执行MPR(Multipoint Relay)选择算法时综合考虑了节点的连接度和链路可靠性,在优化MPR节点个数的同时选择链路可靠性较大的节点作为MPR节点,在进行路由选择时能够利用网络中的非对称链路。仿真结果表明,该协议能优化数据包投递成功率、吞吐量、端到端时延和网络控制开销等性能指标。     

Modified Least Load Multicast Routings for Single Rate Fully-Connected Loss Networks

In this paper, we investigate the dynamic multicast routing problem and briefly discuss the common dynamic multicast routing algorithm called Least Load Multicast Routing (LLMR). We propose two new multicast routing algorithms called Least Load Multicast Routing with Maximum Occupied Circuits (LLMRMOC) and Least Load Multicast Routing with Minimum Measured Blocking Time (LLMRMMBT), both of which are based on LLMR. Simulation results show that these algorithms, compared with LLMR, not only produce a smaller network revenue loss, but also result in smaller call blocking probabilities for all classes of traffic. The moderate gain in the network performance comes only a slight additional cost. The implementation issues of the proposed algorithms are also discussed.     

基于NS-3的声电协同网络实现及路由性能分析

水下无线通信主要依靠水声通信的方式进行信息传输。但水声链路本身具有高时延和高误码率等不足,为水下应用提供低时延的通信服务是一项具有挑战性的工作。声电协同网(CRAN)旨在充分利用水面无线电链路弥补水声网络(UAN)的性能局限,提升网络的整体性能。其中,CRAN中的路由协议需要构建声、电混合路径,是声电协同网络研究中的关键问题。该文首先在网络模拟器3(NS-3)中设计并实现了声电浮标节点与CRAN协议栈,搭建了CRAN的仿真平台。随后探讨了以无线自组网按需平面距离向量路由协议(AODV)为代表的被动式路由在CRAN中的应用。该文发现,AODV协议使用的距离向量准则在CRAN中能够更多地选择高速的无线电链路进行数据转发,有效地降低了网络传输时延。最后,通过仿真对AODV与其他协议的性能进行了对比、分析。结果表明,CRAN在投递率、传输时延、网络吞吐量、能效和路由响应速度方面对比水声通信网有较大提升。同时,以AODV为代表的被动路由协议,相比于以优化链路状态路由协议(OLSR)为代表的主动路由协议更适用于CRAN。     

短波Ad Hoc路由协议仿真与性能分析

为找到一种适合短波Ad hoc网络使用的路由协议,通过OPNET仿真软件对短波信道进行建模,在该模型的基础上对无线Ad Hoc常用的3种路由协议:优化链路状态路由(Optimized Link State Routing,OLSR)、反应式路由中的动态源路由(Dynamic Source Routing,DSR)和按需距离矢量(Ad hoc On Demand Distance Vector,AODV)进行仿真分析。仿真结果表明,OLSR路由协议网络时延最小、吞吐量最高和数据丢失率最低,其整体性能优于AODV及DSR路由协议,更适合于短波信道,但是OLSR路由协议也存在着开销高的不足,下一步可以针对降低路由开销进行研究。     

基于有效带宽保证的路由协议OLSR—BW——无线自组网的路由协议算法及改进研究

无线自组网中无线频率资源严重受限,设计有效地利用无线带宽的路由协议是为多媒体提供服务质量保证（QOS）的重要内容。文中基于优化的链路状态协议（OLSR）及其扩展的最短路径算法,与多点中继技术（MPR）选择算法OLSR-R1及路由计算新量度mhMBW相结合,提出了基于有效带宽保证的路由协议-OLSR-BW,OLSR-SW比纯链路状态路由降低了控制开销,对于保障高速多媒体的连续顺畅传输起到重要的作用。     

Performance Modeling of MANET Interconnectivity

The proliferation of mobile wireless computing devices and the increasing usage of wireless networking have motivated substantial research in mobile ad hoc networks (MANETs). In addition, much has also been done to link autonomous MANETs to the Internet, and as MANETs become more prevalent, the need to interconnect multiple MANETs becomes increasingly important too. However, direct interconnection of MANETs has rarely been studied. In this paper, we first report an experimental study on the performance of interconnected MANETs running two different routing protocols, viz., the Ad hoc On-Demand Distance Vector (AODV) and Optimized Link State Routing (OLSR) protocols, which represent the two major categories, and show that with the use of multiple gateways, it is possible to viably interconnect multiple networks running different MANET routing protocols. We then follow with a simulation study to evaluate the performance in large networks, which not only validates the scalability of the proposed scheme, but also helps to identify various problems that were not apparent in small experimental networks.     

Heuristic‐based link quality preservation for reliable data delivery

During the link failure conditions in Voice over Internet Protocol applications, the backup of routing information is an important requirement to offer the reliable data delivery to the destination. But the maintenance of multiple paths is the difficult and time consuming for the dynamic environment. But the hops reduction between the source and destination and the interference occurrence causes the transmission in multiple times and that leads to minimum network lifetime. Hence, the preservation of link between the multiple hops is the necessary task to improve the performance. This paper validates the link quality with the 4 measures as received signal strength indicator, bandwidth, node mobility, and the number of connections. The link quality factor (LQF) measurement considers the signal and noise level in 5 operating conditions to allow the automatic identification of closest neighbors and their location. The integration of tabu list and the heuristic‐based fitness search algorithm constructs the routing path and updates the path to identify the link failure. The LQF estimation and the dynamic update provide an efficient data delivery path with less number of iterations. The comparative analysis between the proposed hybrid tabu‐heuristic–based LQF with the existing protocols such as Adhoc On‐Demand Vector (AODV), Optimized Link State Routing (OLSR), and the Interference‐based Topology Control algorithm for Delay‐constrained (ITCD) proves the effectiveness of tabu‐heuristic–based LQF regarding the throughput, energy, packet delivery ratio with the minimum delay, and rebroadcasting probabilities.     

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.     

一种基于能量感知的延迟容忍移动无线传感器网络多拷贝路由协议(英文)

The two-phase replication-based routing has great prospects for Delay Tolerant Mobile Sensor Network (DTMSN) with its advantage of high message delivery ratio, but the blind spraying and the low efficiency forwarding algorithm directly influences the overall network performance. Considering the characteristic of the constrained energy and storage resources of sensors, we propose a novel two-phase multi-replica routing for DTMSN, called Energy-Aware Sociality-Based Spray and Search Routing (ESR), which imple...     

Novel power-based routing metrics for multi-channel multi-interface wireless mesh networks

In this paper the problem of selecting optimal paths in a MCMI (Multi-Channel Multi-Interface) WMN (Wireless Mesh Network) is considered. The WMNs are characterized by high dynamic range of the received signal level, especially in the indoor environment. To improve the existing routing metrics and track fast changes that occur in the link state, a corresponding parameter based on the received signal level was assigned to each link. By combining this parameter and known metrics, ETX (Expected Transmission Count), WCETT (Weighted Cumulative ETT) and MIC (Metric of Interference and Channel-switching), three new metrics were formed. All metrics were incorporated in MCR (Multi Channel Routing) protocol and an appropriate propagation model was used for simulations in a real, indoor environment. Proposed metrics, original metrics, MCR protocol, and indoor propagation model were implemented in Glomosim simulator. New metrics were compared against known metrics and also among each other in terms of throughput of user data and average end-to-end delay of the network. The results have shown that proposed metrics significantly outperform original metrics. With this approach, better network performance can be achieved without any additional hardware and with minimal software changes.     

Performance Evaluation of Video Streaming Over Ad Hoc Networks Using Flat and Hierarchical Routing Protocols

A performance evaluation of real time services (such as video streaming) over mobile ad-hoc networks using both hierarchical and flat routing protocols is shown in this paper. A variety of workload and scenarios, as characterized by mobility, load and size of the ad hoc network have been simulated using NS-2. We use OLSR (Optimized Link State Protocol) as the flat routing protocol and our own implementation of HOLSR (Hierarchical OLSR)—which uses HNA (Host and Network Association) messages—as the hierarchical one, modifying other previous HOLSR version and maintaining the maximum compatibility with the flat OLSR. We carry out a complete comparison between these protocols focused on video evaluation. The simulation lets us compare the quality of service (QoS) of the video streaming paying attention to objective parameters (PSNR, packet delivery ratio, packet delay and interruptions). Some drawbacks of the hierarchical environment are also analyzed, as the link load between cluster heads and the lack of QoS-state-aware in HOLSR design. Quantitative results indicate that the protocol overhead is reduced (more than 40% in larger networks) and the video quality is improved (from 1 to 6 dB in certain cases) using hierarchical protocols.