自组网的路由协议及其QoS保障

自组网是一种新型的移动计算机网络，它应用广泛，并具有重要的商业价值。首先介绍了自组网的概念和特点，然后分析了自组网路由协议的特点与设计思路，并丰此基础上讨论了在自组网环境下实现QoS的策略与方法。     

移动自组网QoS路由协议研究

移动自组网是由一组带有无线收发装置的移动节点组成的一个多跳的临时性的自治系统。随着无线通信中多媒体业务的增加,在移动自组网中提供QoS(Quality of Sevice服务质量)保障具有越来越重要的意义,而QoS路由技术则是其中的核心技术和热点问题。文章指出移动自组网QoS路由的困难,对移动自组网典型QoS路由协议进行了详细的分析与比较,并对几种较新的移动自组网QoS路由协议进行了介绍,末了对移动自组网QoS路由协议的发展进行了展望。     

一种QoS保证的移动自组网低能耗资源发现协议

如何在大规模的移动自组网络中快速地找到所需的资源是一个迫切需要解决的问题.提出了一种称为EAQOS(Energy Aware QoS)的资源发现协议,本协议将资源查询请求过程同路由协议紧密结合,通过合并资源请求、QoS探测以及路径请求信息能够快速定位网络中的最优QoS的资源供应者并进行访问,同时有效降低了网络中的通信量以及能量消耗.最后通过NS2进行模拟实验,与两种不同的Qos资源发现协议相比,结果表明所提出协议的性能,包括查询延迟、通信代价以及能量消耗都有显著的提高.     

高动态移动自组网路由协议研究

目前的移动自组网研究主要针对运动速度较慢的地面网络。本文研究由高速节点组成的高动态移动自组网的路由协议,提出了一个结合表驱动路由和地理位置路由的混合路由协议TOPOS,在局部使用表驱动路由加快数据包的转发,而在全局使用地理位置路由以适应快速变化的网络拓扑。在OPNET仿真平台上对TOPOS和已有的AODV及GRP协议的性能比较表明,TOPOS对于节点的运动速度和网络规模具有更好的适应性。     

无线Ad Hoc网络支持QoS的路由协议研究

当前,Ad Hoc网络传输多媒体业务需求提出了服务质量（QoS）的要求。由于Ad Hoc网络本身具有分布式控制、无线信道容量受限以及节点、链路和网络拓扑状态不断变化等特点,使其相对于固定无线网络及有线网络提供有保证且稳定的QoS要困难得多。文章总结了当前DSR协议的QoS研究进展,对不同的改进方案加以分类比较,指出了存在的问题：并针对hdHoc网络中基于资源预留的QoS算法所带来的复杂度问题,提出了适合该网络的测量可用带宽算法,构造了一种支持实时业务的Ad Hoc网络QoS服务机制。     

一种基于MANET的多路径优化路由算法

针对AOMDV协议的多路径路由机制和特点,提出一种基于带宽、时延与链路拥塞度约束的多路径优化路由算法。仿真实验结果表明,对于中低速动态的MANET网络环境,算法能在一定程度上延长网络生存时间以及提高分组投递率。     

无线网络路由协议性能的研究与仿真

文章简要介绍自组网中常用的路由协议,利用网络仿真软件NS2对DSDV、DSR和AODV路由协议进行仿真,通过不同仿真场景计算出路由协议的第一个包收到时间、平均延时和包投递率.结果表明DSDV路由协议适合用于节点静止的网络场景,在移动环境下使用AODV和DSR路由协议有更好的网络性能.     

一种新的高动态军事航空自组网路由协议

提出了一种新的基于地理位置的高动态军事航空自组网路由协议(HDMARP),给出了在不同运行模式下分组转发的路由选择机制.仿真结果表明,HDMARP路由协议相对于其他已有的Ad hoc网络路由协议分别在平均时延、报文交付率以及路由开销等方面具有更好的协议性能,能够较好地满足军事航空自组网的高动态需求和作战应用,对军事航空...     

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

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

移动Ad hoc网络中路由协议的研究

移动Ad hoc网络由无线移动节点在没有任何现存的网络基础设施的情况下组成的自治系统,成为一个具有任意通信拓扑图模型的通信网络.由于网络节点的多跳性、有限的传输带宽、高速移动性、能量受限等特点,使路由协议成为Ad hoc网络设计的关键.主要介绍了Ad hoc网络的路由协议设计策略及分类原则,并对现有的具有代表性的路由协议性能进行了比较分析,为进一步研究提出新的课题.     

Message redundancy removal of multi-copy routing in delay tolerant MANET

This article puts forward a new scheme to control message redundancy efficiently in delay tolerant mobile Ad-hoc networks(MANET).The class of networks generally lacks end-to-end connectivity.In order to improve the efficiency that messages are delivered successfully,multiple message copies routing protocols are usually used,but the network load is increased due to a large number of message redundancies.In the study,by using counter method,every node adds an encounter counter based on epidemic routing scheme...     

RQAR: Location-free reliable and QoS-aware routing protocol for mobile sink underwater wireless sensor networks

Underwater Wireless Sensor Networks (UWSNs) have attracted attention from academics and industries due to many applications such as pollution monitoring, military, tsunami warning, and underwater exploration. One of the effective factors in these applications is efficient communication between underwater sensors. But this process is very challenging in UWSNs due to special conditions and underwater harsh environments. Therefore, designing routing protocols for efficient communication between sensors and sink is an important issue in UWSNs. In this context, this paper proposed a location-free Reliable and QoS-Aware Routing (RQAR) protocol for mobile sink UWSNs. RQAR designed using Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) and does not require the position information of the sensor nodes, which is cumbersome and difficult to obtain. Proposed protocol considers multiple parameters including link quality, hop count, congestion, and residual energy for qos support, and reliable data delivery RQAR also minimizes the effects of hole occurrence by increasing the transmission range as much as possible and ensures communication stability. The simulation results using NS2 showed the superiority of RQAR in improving end-to-end delay, packet delivery ratio, and network throughput compared to the previous methods.     

Toward path reliability by using adaptive multi-path routing mechanism for multimedia service in mobile Ad-hoc network

Traditional multi-path routing mechanisms aim to establish complete node or link disjoint paths.However,under some circumstances if multiple paths cannot be established based on the current network topology,the traditional multi-path routing mechanism will degenerate into single path routing mechanism,thus the advantages of multi-path routing cannot be exhibited.To enhance the end-to-end path reliability,an adaptive multi-path routing mechanism with path segment is proposed,in which multi-path can be establ...     

Queue‐based multiple path load balancing routing protocol for MANETs

Congestion in the network is the main cause for packet drop and increased end‐to‐end transmission delay of packet between source and destination nodes. Congestion occurs because of the simultaneous contention for network resources. It is very important to efficiently utilize the available resources so that a load can be distributed efficiently throughout the network. Otherwise, the resources of heavily loaded nodes may be depleted very soon, which ultimately affects network performances. In this paper, we have proposed a new routing protocol named queue‐based multiple path load balancing routing protocol. This protocol discovers several node‐disjoint paths from source to destination nodes. It also finds minimum queue length with respect to individual paths, sorts the node‐disjoint paths based on queue length, and distributes the packets through these paths based on the minimum queue length. Simulation results show that the proposed routing protocol distributes the load efficiently and achieves better network performances in terms of packet delivery ratio, end‐to‐end delay, and routing overhead. Copyright © 2016 John Wiley & Sons, Ltd.     

Graph partitioning algorithm for opportunistic routing in large-scale wireless network

.     

An efficient routing protocol for the QoS support of large‐scale MANETs

The hierarchical routing algorithm is categorized as a kind of routing method using node clustering to create a hierarchical structure in large‐scale mobile ad hoc network (LMANET). In this paper, we proposed a new hierarchical clustering algorithm (HCAL) and a corresponded protocol for hierarchical routing in LMANET. The HCAL is designed based on a cost metric in the form of the link expiration time and node's relative degree. Correspondingly, the routing protocol for HCAL adopts a reactive protocol to control the existing cluster head (CH) nodes and handle proactive nodes to be considered as a cluster in LMANET. Hierarchical clustering algorithm jointly utilizes table‐driven and on‐demand routing by using a combined weight metric to search dominant set of nodes. This set is composed by link expiration time and node's relative degree to establish the intra/intercommunication paths in LMANET. The performance of the proposed algorithm and protocol is numerically evaluated in average end‐to‐end delay, number of CH per round, iteration count between the CHs, average CH keeping time, normalized routing overhead, and packet delivery ratio over a number of randomly generated benchmark scenarios. Furthermore, to corroborate the actual effectiveness of the HCAL algorithm, extensive performance comparisons are carried out with some state‐of‐the‐art routing algorithms, namely, Dynamic Doppler Velocity Clustering, Signal Characteristic‐Based Clustering, Dynamic Link Duration Clustering, and mobility‐based clustering algorithms.     

Unified routing protocol based on passive bandwidth measurement in heterogeneous WMNs

The past few years have witnessed a surge of wireless mesh networks (WMNs)‐based applications and heterogeneous WMNs are taking advantage of multiple radio interfaces to improve network performance. Although many routing protocols have been proposed for heterogeneous WMNs, most of them mainly relied on hierarchical or cluster techniques, which result in high routing overhead and performance degradation due to low utilization of wireless links. This is because only gateway nodes are aware of all the network resources. In contrast, a unified routing protocol (e.g., optimal link state routing (OLSR)), which treats the nodes and links equally, can avoid the performance bottleneck incurred by gateway nodes. However, OLSR has to pay the price for unification, that is, OLSR introduces a great amount of routing overhead for broadcasting routing message on every interface. In this paper, we propose unified routing protocol (URP), which is based on passive bandwidth measurement for heterogeneous WMNs. Firstly, we use the available bandwidth as a metric of the unification and propose a low‐cost passive available bandwidth estimation method to calculate expected transmission time that can capture the dynamics of wireless link more accurately. Secondly, based on the estimated available bandwidth, we propose a multipoint relays selection algorithm to achieve higher transmission ability and to help accelerate the routing message diffusion. Finally, instead of broadcasting routing message on all channels, nodes running URP transmit routing message on a set of selected high bandwidth channels. Results from extensive simulations show that URP helps improve the network throughput and to reduce the routing overhead compared with OLSR and hierarchical routing. Copyright © 2016 John Wiley & Sons, Ltd.     

Service Locating for Large-Scale Mobile Ad-Hoc Network

In a mobile ad-hoc network, an efficient service discovery system is needed to locate various service providers. However, because an ad-hoc network has no fixed topology, its service locating is quite different from traditional schemes for the Internet. In this article, we present a novel service locating system specifically designed for large-scale mobile ad-hoc networks. In our system, a subset of nodes is dynamically elected and self-organized into a virtual backbone (VB). These VB nodes manage the directory information of services and monitor path quality of service on behalf of end users. Such information is then used to direct the selection of appropriate providers. We evaluate the performance of our system through simulation. The result demonstrates that the proposed locating system greatly improves the quality of service delivery while maintaining reasonably low cost.     

基础设施增强的DTN路由协议

针对间歇性连通的移动网络环境,提出了一种新的DTN路由协议IEDR。其整合以往DTN路由算法中的设计经验,充分利用节点间相遇的机会交换数据,提高数据传达率并降低传输延迟,同时将资源开销控制在可接受的范围内。IEDR 还尝试将无线接入点作为辅助数据传播的有效途径,利用接入点间高速互联的特性为数据在广大地域内的高效传播提供便利。仿真结果表明,与一些经典路由协议相比,IEDR达到了更好的效能。     

Improved ant colony-based multi-constrained QoS energy-saving routing and throughput optimization in wireless Ad-hoc networks简

In order to establish a route supporting multi-constrained quality of service（QoS）, increase network throughput and reduce network energy consumption, an improved ant colony-based multi-constrained QoS energy-saving routing algorithm（IAMQER） is proposed. The ant colony algorithm, as one of the available heuristic algorithms, is used to find the optimal route from source node to destination node. The proposed IAMQER algorithm, which is based on the analysis of local node information such as node queue length, node forwarding number of data packets and node residual energy, balances the relationship between the network throughput and the energy consumption, thus improving the performance of network in multi-constrained QoS routing. Simulation results show that this IAMQER algorithm can find the QoS route that reduce average energy consumption and improves network packet delivery ratio under the end-to-end delay and packet loss ratio constraints.