一种具有能量感知的多路径Ad hoc路由算法

该文针对无线移动Ad hoc网络的动态变化拓扑逻辑,存在单向链路,节点能量有限等特点,提出了一种具有能量感知的多路径路由算法。该算法是一种反应式的基于路径池的多路径路由算法,数据和应答消息的路由根据路由池中路径的性能尺度,即跳数、可靠性和剩余能量以一定的概率分布随机选择。路径的可靠性和剩余能量在数据传输过程中动态更新。仿真结果表明该算法能有效地延长网络的生存时间。     

Ad hoc网络中基于数据流的QoS路由协议

已有ad hoc网络中的QoS路由都是基于目的地址的选路并预留资源,当源节点针对同一个目的节点先后建立两个或者多个实时业务流的时候,将导致几个数据流争用资源,使得几个流的QoS都无法得到保证。针对这个问题,文章提出了基于流的QoS路由机制,并且进行了仿真分析,仿真结果表明这种机制能够解决这个问题,使QoS得到保证。     

蚁群优化和能量有效的Ad Hoc路由协议

为了延长Ad Hoc网络的生存周期,提出了一种基于蚁群优化和能量有效的Ad Hoc网络多路径动态路由算法ACOERA。该算法根据路径的有效能量率进行路由选择,路径建立后通过蚁群优化算法动态收集路径信息,并对路由表进行更新。仿真结果表明,该算法能有效延长网络生存时间,增强通信网络的自适应能力。     

移动Ad Hoc网络关键技术研究

文章介绍了移动ad hoc网络的概念、各种应用以及关键技术,着重对无线TCP进行了研究对TCP Reno中选择确认(SACK)的缺点提出一种新的ASACK方法,使吞吐量得以提高,在节点高速移动时效果尤为明显对TCP Vegas作了改进,提出一种采用RTT通知的TCP Vegas方案,结果使节点高速移动时系统吞吐量明显提高.     

基于能量感知的Ad hoc网络路由协议的研究

Adhoc网络是指由一组带有无线通信收发装置的移动节点组成的一个多跳、自组织、无中心网络。作为一个不需要固定基础设施特殊的无线网络,它在民用、军事与测量通信领域占据一席之地,成为当前网络研究的热点。本论文的主要研究目标是利用国内外现有的相关研究成果,对Adhoc自组网常用的AODV路由协议进行节能的研究,使其达到能耗低,长时间工作的目标,以应用在测试与监控中。最后通过仿真比较得以证明其改进的有效性。     

基于Ad hoc网络的QoS路由问题研究

由于Adhoc网络的特殊性,传统的路由协议不能直接应用到Adhoc网络中。因此有必要对Adhoc网络QoS路由协议发展现状进行探究。本文介绍了Adhoc网络QoS路由的概况和它存在的主要问题,以及应对的策略,这有助于进一步改进和完善Adhoc网络的QoS路由技术。     

Ad hoc网络中基于能量的AODV双径路由算法研究

在Ad hoc网络中AODV路由的健壮性、路由开销、网络的生存时间以及分组报文传送率等都是评价该算法优良的指标。为了提高该路由算法的各项指标本文提出了改进的路由算法协议,在Ad hoc网络中避免使用的低于能量阈值的节点作为路由节点以提高整体网络的生存时间,提供主次路径使报文的到达率、网络的健壮性得以提高,同时也减少了链路的修复,减少了路由开销。     

基于预测的Ad Hoc路由协议研究

Ad Hoe网中节点的任意运动,导致了大量的重路由操作,从而降低了网络性能。而基于预测的路由协议能够有效地减少网络拓扑结构的变化对于路由操作的影响。文章主要讨论了Ad Hoc网的特点以及目前已经提出的几种节点运动预测方案,同时对基于预测的路由协议进行研究。     

移动Ad Hoc网络中AODV路由协议的改进

移动Ad Hoc网络研究中,路由协议是一个关键问题。鉴于Ad Hoc网络的高移动性,通信路径的稳定性显得尤为重要。本文在基于AODV（Ad Hoc On-Demand Distance Vector）按需距离矢量路由的思想上,提出一种新的双径路由改进方案。旨在提高协议的健壮性,增强网络对拓扑变化的适应能力。性能分析和仿真结果表明,改进后的AODV路由协议,降低了端到端时延,减少了数据包的丢失,提高了网络的吞吐量,使得网络的性能得到了提升。     

AODV路由协议的改进算法

无线Ad hoc网络拓扑结构动态变化的特点,决定了路径断裂是不可避免的。路径断裂会引起源节点路由重建,源节点频繁地发起路由重建过程会降低网络的性能。AODV协议中采用本地修复机制来减少源节点路由重建的次数。基于这一思想,文章提出了一种AODV路由协议改进算法SRP,旨在进一步提高本地修复的成功率。仿真结果表明,在拓扑结构变化迅速的Ad hoc网络中,SRP协议比AODV路由协议有更好的网络性能。     

Localized power‐aware alternate routing for wireless ad hoc networks

In this paper, we design a localized power‐aware alternate routing (LPAR) protocol for dynamic wireless ad hoc networks. The design objective is to prolong the lifetime of wireless ad hoc networks wherein nodes can adaptively adjust their transmission power based on communication ranges. LPAR achieves this goal via two phases. In the first phase, energy draining balancing is achieved by identifying end‐to‐end paths with high residual energy. The second phase is designed to effectively reduce the power consumed for packet forwarding. This is achieved by iteratively performing adaptive localized power‐aware alternate rerouting to bypass each (potentially) high‐power link along the end‐to‐end path identified in the first phase. Further, the design of LPAR enables nodes to collect their neighborhood information ‘on‐demand’, which can effectively reduce the overhead for gathering such information. LPAR is suitable for both homogeneous and non‐homogeneous networks. Simulation results demonstrate that LPAR achieves improved performance in reducing protocol overhead and also in prolonging network lifetime as compared with existing work. Copyright © 2008 John Wiley & Sons, Ltd.     

Ad hoc网络中带宽保证路由协议

研究ad hoc网络中无线链路存在邻近链路干扰及隐藏终端和暴露终端问题，提出新的带宽预留模型及带宽保证路由协议(BGRP)，旨在按需探测符合带宽需要的路由路径并预留可靠的带宽资源。理论分析证明，BGRP探测的路由路径能满足带宽需要，而且预留的带宽资源准确有效。仿真结果表明，就有效带宽而言，BGRP较INSIGNIA和BGSR算法有效，而且消息复杂性较小，具有良好的网络扩展性。     

自组网路由协议综述

自组网路由协议用于监控网络拓扑结构变化,交换路由信息,定位目的节点位置,产生、维护和选择路由,并根据选择的路由转发数据。本文综述了自组网路由协议研究方面的一些最新工作,描述了设计自组网路由协议所面临的问题,并着重对该研究开展以来所提出的各种主要协议进行了对比、分析和分类阐述,为进一步的研究提出了新的课题。     

低开销的MANET网络按需路由协议

针对简单泛洪效率低的问题,提出了一个限制洪泛的高效的路由广播算法,通过Euclidean距离来限制路由发现过程中请求分组被转发的次数;研究了减少路由维护开销,并降低路由发现的频率的方法,提出了一个基于节点高度的路由修复与优化算法,该算法使用节点监听来对链路断裂的路由进行修复与优化.基于限制泛洪的高效的路由广播算法和路由修复优化算法,提出了一种新的低开销的MANET网络按需路由协议LOOR(low overhead on-demand routing).仿真结果表明,新协议增强了路由的顽健性,减少了路由跳数,降低了路由发现的频率,提高了数据分组递送率,并显著地降低了路由控制开销.     

基于粒子群优化的ad hoc网络最小能耗多播路由算法

在无线ad hoc网络中,设备使用电池提供能量,随着多播应用日益广泛,如何构造最小能耗多播树是一个重要问题。针对选择不同的中继节点集对构造最小能耗多播树的影响,提出了一种优化最小能耗多播树构造的离散粒子群算法。为了避免离散粒子群算法早熟收敛,引入惯性权重策略,以平衡算法的全局搜索能力和局部搜索能力。模拟实验结果表明改进后的离散粒子群算法具有较强的优化能力,有效地优化了最小能耗多播树的构造。     

EEAODR: An energy‐efficient ad hoc on‐demand routing protocol for mobile ad hoc networks

Mobile ad hoc networks (MANETs) are characterized by random, multi‐hop topologies that do not have a centralized coordinating entity or a fixed infrastructure that may change rapidly over time. In addition, mobile nodes operate with portable and finite power sources. In this work, we propose an energy‐efficient routing protocol for MANETs to minimize energy consumption and increase the network's consistency. Traditional works mainly focused on the shortest path‐based schemes to minimize energy, which might result into network failure because some nodes might exhaust fast as they are used repetitively, while some other nodes might not be used at all. This can lead to energy imbalance and to network life reduction. We propose an energy‐efficient ad hoc on‐demand routing protocol that balances energy load among nodes so that a minimum energy level is maintained among nodes and the network life increases. We focused on increasing the network longevity by distributing energy consumption in the network. We also compared the simulation results with a popular existing on‐demand routing protocol in this area, AODV, to establish the superiority of our approach. Copyright © 2009 John Wiley & Sons, Ltd.     

Stable routing protocol based on fuzzy logic system in vehicular ad hoc networks

Vehicular ad‐hoc networks have several roles in alert messages dissemination between vehicles in danger, the most important role is to provide helpful information for drivers (eg, road traffic state). But, some performance improvements are frequently needed in terms of routing. Hence, several clustering approaches have been proposed to optimize the network services. These approaches are based on increasing data delivery, reducing data congestion, and dividing the traffic into clusters. However, a stable clustering algorithm is always required in order to ensure the data dissemination in a dense, mobile, or a large‐scale environment. Therefore, in this paper, we have proposed a stable routing protocol based on the fuzzy logic system, which can deliver alert messages with minimum delay and improve the stability of clusters structure by generating only a small number of clusters in the network. In this work, the fuzzy logic system has been used to create the clusters and select a cluster head for each cluster. We have used the network simulator (NS2) to generate the results. As a result, we could reduce the cluster head changes and increase the cluster member lifetime compared with recent approaches.     

基于节点接入能力的ad hoc网络按需路由协议

基于802.11协议MAC层重传策略,提出一个衡量节点接入能力的参数CAM(capacity of access to medium),以体现节点周围信道的繁忙程度及其抢占信道能力。在此基础上,联合MAC层和网络层进行跨层设计,提出了一个拥塞感知路由CAOR(congestion aware on-demand routing)协议。仿真表明:该协议能够在降低开销的前提下,显著增加网络吞吐量,并降低平均端到端的时延。     

QoS-aware minimum energy multicast tree construction in wireless ad hoc networks

Energy conservation is a critical issue in wireless ad hoc networks since batteries are the only limited-life energy source to power the nodes. One major metric for energy conservation is to route a communication session along the routes which require the lowest total energy consumption. Most recent algorithms for the MEM (Minimum Energy Multicast) problem considered energy efficiency as the ultimate objective in order to increase longevity of such networks. However, the introduction of real-time applications has posed additional challenges. Transmission of video and imaging data requires both energy and QoS-aware routing in order to ensure efficient usage of the networks. In this paper, we only consider “bandwidth” as the QoS in TDMA-based wireless ad hoc networks that use omni-directional antennas and have limited energy resources. We present a constraint formulation model for the QoS-MEM (QoS-aware Minimum Energy Multicast) problem in terms of mixed integer linear programming (MILP), which can be used for an optimal solution of the QoS-MEM problem. Experiment results show that in a typical static ad hoc network with 20 nodes, the optimal solutions can always be solved in a timely manner.