一种基于定向扩散的QoS路由算法

提出了一种基于定向扩散的分布式能耗均衡QoS路由选择算法QRDD。QRDD基于路径节点最大最小剩余能量（MaxMPE）和最小跳数（MHC）信息得到梯度,组合利用这两类梯度来得到观测节点和有效传感节点间的多条可选路径,通过多路径路由支持路径的平滑切换,保证性能最优路径被选择,提供失效节点的路径修复和主动通告机制。网络仿真实验表明,QRDD能很好地支持不同业务的资源需求分配,可实现全网能耗均衡。     

一种QoS路由多目标遗传算法

对网络拓扑结构和QoS路由指标进行了形式化分析，基于多目标规划问题，给出了QoS路由数学模型。针对这个模型，提出了一种QoS路由多目标遗传算法。通过仿真实验证明该算法是可行、有效率的。     

改进蚁群算法在QoS路由中的应用与研究

在分析传统蚁群算法缺陷及其在QoS路由中的应用的基础上,提出了一种与真实蚁群系统更加相符的基于双向寻路和信息素扩散的蚁群算法,采用来自源节点和目的节点两个方向的蚂蚁探路的同时进行信息扩散.仿真结果表明,该改进蚁群算法在网络规模较大的条件下仍能快速找到满足QoS路由性能指标的路由,节省了QoS路由搜索时间,提高了网络服务能力.     

Ad Hoc中基于效用最大的优先级流控机制

针对AdHoc中流竞争,提出了一种分布式节点的最优化速率控制机制。给出了基于流优先级的效用函数。以最大化网络整体效用为目标,通过运用对偶理论和梯度投影算法,给出了每一端到端流获得最优值的迭代机制,它能够保证高优先级流的QoS。仿真结果表明该机制可以使网络资源根据流优先级进行有效分配,并且具有很好的收敛性。     

Ad Hoc网络中基于协商机制的QoS多播路由研究

针对移动Ad Hoc网络QoS多播路由中普遍存在的拥塞问题,提出了一种基于协商机制的QoS多播路由协议,节点协商使用以一定QoS约束建立起的多播链路,避免过度使用多播资源引起网络拥塞,从而提高分组投递率和网络吞吐量。通过NS2仿真证明,该协议能够保证不同类型业务在网络中传输的服务质量,提高网络的利用率。     

MAQF:一种新的移动Ad-Hoc网络自适应QoS结构框架

链路的时变特性及节点移动的无规则性是造成移动Ad-Hoc网络QoS保障难以实现的根本原因，针对这一难题，本文在对INSIGNIA结构框架进行个性的基础上，通过增加动态资源调整、QoS路由及MAC层QoS保障等组件和机制，提出了一种新的自适应QoS结构框架MAQF。此外，本文还涉及及移动接入时的QoS保障问题，并对动态资源调整算法进行了详细阐述。仿真结果表明，MAQF可以更好地适应网络环境的动态变化。     

战术Ad Hoc网络中的QoS路由协议设计与仿真

基于TDMA的战术Ad Hoc网络,提出一种分布式的资源预约机制,其中收/发节点采用协商的方式预约时隙,邻居节点通过侦听方式获得时隙被预约的信息,然后依托该机制提出一种QoS路由协议,该协议能够在网络节点之间选择一条满足QoS要求且相时短的路径进行预约时隙,同时对于网络拓扑变化引起的链路故障也能局部修复.仿真表明该协议...     

无线Ad Hoc网络中一种基于DSR的QoS路由协议

QoS是无线Ad Hoc网络中的一个重要问题,而QoS路由技术是解决这一问题的关键技术之一.假定无线AdHoc网络中的每个节点的MAC子层能够提供一个参量,这个参量可以量化地表示该节点的忙闲状态,在这个假设的基础上,本文提出一种以DSR路由协议为基础的改进路由,在新的路由协议中,路由请求包中增加一个参量,用这个参量来表示路由请求包所经过的所有节点的状态总和,当路由请求包到达目的节点就找到了源节点到目的节点的路径,并且可以得到每条路径的状况.通过这些信息可以使得发现的路径是状况最好的路径,从而来满足QoS.     

具有不确定信息的QOS路由的选择与分析

为了减少不确定信息对QoS(服务质量)路由的选择产生的影响，因此有必要对具有不确定信息的QoS路由问题进行研究，讨论了网络状态的不确定信息产生的原因，并基于NS(网络仿真)软件，仿真分析了不确定信息对QoS路由和网络性能的影响，然后，结合QoS单播路由问题，通过对有关问题的形式化描述，讨论了相关的解决方案，最后，综合目前相关解决方案存在的优缺点，从实现的角度探讨了以延迟保证为约束条件的多路径QoS路由机制。     

基于合作中继的OFDM蜂窝网络的QoS感知资源调度算法

针对基于中继的OFDM蜂窝网络,该文考虑具有不同QoS要求的混合业务场景,引入合作传输机制,提出了一种基于合作中继的QoS感知资源调度算法,解决了合作中继节点选取,子载波分配以及功率控制等问题。以最大化系统效用为目标,在考虑QoS业务的速率要求与基站功率约束的同时,针对中继结构引入了中继节点的功率约束。为降低计算复杂度,将原非线性组合优化问题分解为子载波分配与功率控制两个子问题。仿真结果表明,该文所提算法在能量节约、系统效用,吞吐量等性能方面都有显著优势。     

A Shoelace-Based QoS Routing Protocol for Mobile Ad Hoc Networks Using Directional Antenna

In this paper, we propose a new quality-of-service (QoS) routing protocol for mobile ad hoc network (MANET) using directional antennas. The proposed scheme offers a bandwidth-based routing protocol for QoS support in MANET using the concept of multi-path. Our MAC sub-layer adopts the CDMA-over-TDMA channel model. The on-demand QoS routing protocol calculates the end-to-end bandwidth and allocates bandwidth from the source node to the destination node. The paths are combined with multiple cross links, called shoelace, when the network bandwidth is strictly limited. Due to the property of the directional antenna, these cross links can transmit data simultaneously without any data interference. We develop a shoelace-based on-demand QoS routing protocol by identifying shoelaces in a MANET so as to construct a QoS route, which satisfied the bandwidth requirement, more easily. The shoelace-based route from the source to the destination is a route whose sub-path is constructed by shoelace structure. With the identified shoelaces, our shoelace-based scheme offers a higher success rate to construct a QoS route. Finally, simulation results demonstrate that the proposed routing protocol outperform existing QoS routing protocols in terms of success rate, throughput, and average latency.     

Energy Efficient QoS Aware Hierarchical KF-MAC Routing Protocol in Manet

The paper proposes an energy efficient quality of services (QoS) aware hierarchical KF-MAC routing protocol in mobile ad-hoc networks. The proposed KF-MAC (K-means cluster formation firefly cluster head selection based MAC routing) protocol reduces the concentration of QoS parameters when the node transmits data from source to destination. At first, K-means clustering technique is utilized for clustering the network into nodes. Then the clustered nodes are classified and optimized by the firefly optimization algorithm to find cluster heads for the clustered nodes. The transmission of data begins in the network nodes and TDMA based MAC routing does communication. The observation on KF-MAC protocol performs well for QoS parameters such as bandwidth, delay, bit error rate and jitter. The evaluation of proposed protocol based on a simulation study concludes that the proposed protocol provides a better result in contrast to the existing fuzzy based energy aware routing protocol and modified dynamic source routing protocol. With KF-MAC protocol, the collision free data transmission with low average energy consumption is achieved.     

MANET网络中基于移动虚拟节点的QoS路由算法

讨论了一种基于移动虚拟节点(VMN)的QoS路由算法—QoSRAVMN,通过移动WAVE在VMN节点间交换网络信息,允许在没有网络拓扑状态信息精确描述的情况下而能快速地发现路由。测试结果表明该算法路由开销低于HDP协议,算法产生的移动WAVE能很好地满足所有源和目的节点路径的QOS要求。     

无线网络中一种高QoS保证的路由协议研究

随着多媒体及实时应用的普及,在移动自组网中为业务流提供服务质量保证现已成为研究热点.提出一种在大规模移动自组网中提供服务质量保证的分段式路由协议.该协议采用直线逼近的方法,逐段建立满足带宽要求且延迟小的路径,并选择到源节点和目的节点连线距离最近的节点作为转发节点.通过分段、独立地维护路由,减小了路由维护的代价,提高了可扩展性.模拟结果表明该路由协议具有路由成功率高、路径短和延迟小等特点.     

移动自组网基于动态蜂窝的QoS路由协议

本文为移动自组网提出了一个基于动态蜂窝的QoS路由协议，它利用移动跟踪技术实现了一个分布式动态蜂窝生成协议；采用一个多Qos路由探测算法选择一条能够最大满足QoS要求的路由，并在这条路由上建立端．端主动资源预留；使用移动预测和被动资源预留技术预测源结点和目的结点可能进入的蜂窝集合，并在这些蜂窝集合与目的结点和源结点之间提前进行端．端被动资源预留；融合蜂窝动态检测技术与QoS路由修补技术自动发现和修补断裂的QoS路由．由于该路由协议模仿了固定蜂窝网络中的操作，所以，大大改善了QoS路由的性能．仿真结果表明：在满足QoS条件下，它明显提高了包传输率，减轻了路由负载．     

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.     

QoS routing in ad hoc wireless networks

The emergence of nomadic applications have generated much interest in wireless network infrastructures that support real-time communications. We propose a bandwidth routing protocol for quality-of-service (QoS) support in a multihop mobile network. The QoS routing feature is important for a mobile network to interconnect wired networks with QoS support (e.g., ATM, Internet, etc.). The QoS routing protocol can also work in a stand-alone multihop mobile network for real-time applications. This QoS routing protocol contains end-to-end bandwidth calculation and bandwidth allocation. Under such a routing protocol, the source (or the ATM gateway) is informed of the bandwidth and QoS available to any destination in the mobile network. This knowledge enables the establishment of QoS connections within the mobile network and the efficient support of real-time applications. In addition, it enables more efficient call admission control. In the case of ATM interconnection, the bandwidth information can be used to carry out intelligent handoff between ATM gateways and/or to extend the ATM virtual circuit (VC) service to the mobile network with possible renegotiation of QoS parameters at the gateway. We examine the system performance in various QoS traffic flows and mobility environments via simulation. Simulation results suggest distinct performance advantages of our protocol that calculates the bandwidth information. It is particularly useful in call admission control. Furthermore, “standby” routing enhances the performance in the mobile environment. Simulation experiments show this improvement     

Collaboration of Trusted Node and QoS Based Energy Multi Path Routing Protocol for Vehicular Ad Hoc Networks

In the recent past information transmission through the vehicular ad hoc network (VANET) playing a vital role due to increase in accident statistics. There are numerous networking and VANET protocols helpful to control the trust while transmitting the data from source to destination nodes in traffic environment. In spite of many existing protocols for analyzing the trust in the network, the challenge of routing overhead, high energy consumption and malicious attacks issues still continue in the communication. This research introduces the trust collaboration nodes and Quality of Service (QoS) with energy multipath routing protocol for transmitting the information through VANET. Initially, the trusted nodes have been collected for analyzing the neighbouring nodes and the information are transmitted using the proposed QoS based energy efficient multipath routing protocol. During this transmission, the multi path protocol eliminates the intermediate attacks effectively when compared with the other existing protocols. The Proposed protocol maintains the QoS while routing the information from source to destination and further the efficiency has been analyzed through simulation experiments and Montgomery multiplier based Elliptic Curve Cryptography (ECC) will be used in future for better security and privacy.     

End-to-End Link Reliable Energy Efficient Multipath Routing for Mobile Ad Hoc Networks

Among the many multipath routing protocols, the AOMDV is widely used in highly dynamic ad hoc networks because of its generic feature. Since the communicating nodes in AOMDV are prone to link failures and route breaks due to the selection of multiple routes between any source and destination pair based on minimal hop count which does not ensure end-to-end reliable data transmission. To overcome such problems, we propose a novel node disjoint multipath routing protocol called End-to-End Link Reliable Energy Efficient Multipath Routing (E2E-LREEMR) protocol by extending AOMDV. The E2E-LREEMR finds multiple link reliable energy efficient paths between any source and destination pair for data transmission using two metrics such as Path-Link Quality Estimator and Path-Node Energy Estimator. We evaluate the performance of E2E-LREEMR protocol using NS 2.34 with varying network flows under random way-point mobility model and compare it with AOMDV routing protocol in terms of Quality of Service metrics. When there is a hike in network flows, the E2E-LREEMR reduces 30.43 % of average end-to-end delay, 29.44 % of routing overhead, 32.65 % of packet loss ratio, 18.79 % of normalized routing overhead and 12.87 % of energy consumption. It also increases rather 10.26 % of packet delivery ratio and 6.96 % of throughput than AOMDV routing protocol.     

A hop‐by‐hop delay‐constrained routing algorithm with explicit loop avoidance and backup routing information

QoS Routing is crucial for QoS provisioning in high‐speed networks. In general, QoS routing can be classified into two paradigms: source routing and hop‐by‐hop routing. In source routing, the entire path to the destination node of a communication request is locally computed at the source node based on the global state that it maintains, which does not scale well to large networks. In hop‐by‐hop routing, a path‐selecting process is shared among intermediate nodes between the source node and the destination node, which can largely improve the protocol scalability. In this paper, we present the design of hop‐by‐hop routing with backup route information such that each intermediate node can recursively update the best known feasible path, if possible, by collectively utilizing the routing information gathered thus far and the information that it locally stores. Such a route is kept as a backup route and its path cost is used as a reference to guide the subsequent routing process to search for a lower‐cost constrained path and avoid performance degradation. In this way, the information gathered is maximally utilized for improved performance. We prove the correctness of our presented algorithm and deduce its worst message complexity to be O(∣V∣²), where ∣V∣ is the number of network nodes. Simulation results indicate that, however, the designed algorithm requires much fewer messages on average. Therefore it scales well with respect to the network size. Moreover, simulation results demonstrate that the cost performance of our algorithm is near‐optimal. Copyright © 2004 John Wiley & Sons, Ltd.