一种能量有效控制的实时无线传感器网络路由协议

提出了一种能量有效控制实时无线传感器网络路由协议.该协议通过信息类分处理,动态聚点策略,基于遗传算法的单跳延迟实现了网络传输端到端的实时性保证以及网络能量有效性控制;利用上溯重新路由方法,来处理网络拥塞问题,并实现了处理拥塞的智能化.经过实际应用,证明该协议是十分有效的,能满足无线传感器网络传输实时性和能量有效性要求.     

多信道无线Mesh网络的路由协议

针对单径路由协议不能充分利用多信道无线Mesh网络的信道资源的问题,提出了一种基于拥塞控制的并行多径路由协议PMRP。该协议将一个数据流分配到多条路径同时传输,当所有路径都发生中断时,才重新寻找路由;并采取相应的拥塞感知技术,避免拥塞节点再转发新的数据流。仿真结果证明：与无线自组网按需平面距离矢量路由协议（AODV）协议相比,PMRP在网络负载较大时,能有效地减小端到端延迟,提高数据包的成功投递率,增加网络的整体吞吐量。     

基于稳定性的认知Ad Hoc网络路由协议

针对认知无线电Ad Hoc网络中各个节点可用频谱的多样性、时变性和差异性的问题,传统路由协议不能适用于认知无线电Ad Hoe网络,提出了一种基于稳定性的路由协议.该协议综合考虑认知无线电Ad Hoc网络特性,通过计算每个节点的稳定性并引入分集传输,进行传输模式选择和信道选择,利用包括路径稳定性、路径跳数、路径信道切换次数的路由尺度进行路径选择.仿真分析表明,该协议能减少路径信道切换次数,提高路径稳定性和路径建立成功概率.     

低空多无人机自组网数据可靠传输的跨层方法

低空多无人机自组织网络由于数据传输容易被地形或建筑物等遮挡,通信中断时有发生,同时传统拥塞处理体系已不能满足无人机间通信的质量要求。针对以上问题,提出一种数据可靠传输的跨层方法。运用该方法在物理层根据信道条件得出3种通信方式的中断概率,在MAC层根据数据包进入缓存队列时间,进行拥塞等级划分,在传输层根据拥塞情况控制滑动窗口大小,自适应控制源无人机的数据发送速率,在网络层以中断概率与拥塞值的联合权重为依据,提供数据可靠传输的路由选择。仿真结果表明,与移动自组网拥塞感知路由协议、动态拥塞感知路由协议相比,该方法有效降低了中断概率,并随着数据发送速率以及无人机速度的增加,可获得更低的平均时延和较高的投递成功率。     

多速率环境下AODV协议的改进

分析AODV协议在多速率环境下的不足,提出一种改进的协议AODV-HC.AODV-HC采用传输容量作为判断路径优劣的标准,通过链路单向稳定性和链路传输能力的度量,构建路径传输容量度量体系.在路径选择上将每条链路的稳定性和链路可承载的容量纳入考虑因素,能有效解决多速率环境下多跳低速链路带来的吞吐量限制.通过对AODV协议的路由请求信息和路由表的扩充以及对路由发现和路由回复过程的改进来实现AODV-HC协议.仿真实验表明基于传输容量度量的AODV-HC协议在节点高密度分布时能够提高网络的饱和吞吐量和分组交付率,降低平均分组传输时延.     

RAODV:一种基于拥塞跳数改进的AODV路由协议

针对移动Ad Hoc网络的AODV路由协议在通信过程中存在的局部拥塞问题,本文提出基于拥塞跳数的路由协议RAODV。该协议引进平均队列长度预测拥塞情况,在路由节点转发路由请求包时,考虑自身的拥塞情况动态调整跳数计数方式,得到的路径跳数称为拥塞跳数,基于拥塞跳数建立最短路由。仿真结果表明,RAODV路由协议在不影响收敛速度的情况下有效地提高了数据的传输投递率,降低了平均时延。     

主动队列管理下大时滞网络路径拥塞控制算法

与传统的无线网络相比,大时滞网络对路径拥塞环境下的无线通道交换具有较高的要求.为此提出主动队列管理下大时滞网络路径拥塞控制算法.首先利用主动队列管理算法对相邻路由节点网络路径的拥塞情况展开预测,进而分析网络路由节点的队列状态;然后以优化后续节点队列、传输距离以及传输方向为目的,从路径概率选择、分组丢弃函数、WSN蚁群路由选取三个角度优化网络路径,从而实现路径拥塞控制.实验结果表明,上述算法能够有效缩短网络的传输时滞,且能耗和丢包率较低,具有较高的应用价值.     

基于距离矢量的多下一跳路由信息协议

针对传统单下一跳路由协议总是选择最优路径进行路由,容易导致网络拥塞的问题,提出多下一跳路由信息协议。在邻居节点之间交换最优路由信息并构建路由有向图,为节点建立多下一跳路由表,以实现无环并行传输。基于扩展SSFNet的仿真结果表明,该协议可以降低网络拥塞风险。     

HWMN中基于动态选择的混合路由协议

为解决现有的先验式路由协议不能根据网络负载动态变化的问题,提出动态路由选择和拥塞避让混合路由协议。采用新的路由度量、先验式路由选择方法和拥塞处理机制,根据整条链路的节点负载动态选择最优的路径,实现根据整个网络的负载情况进行动态选择,避让拥塞节点,提高网络的鲁棒性。ns-3的实验结果表明,与区域条件感知混合路由协议(regional condition-aware hybrid routing protocol, RCA-HRP)协议相比,该混合路由协议可以有效改善网络的平均吞吐量、延迟和丢包率。     

无线传感器网络的能量均衡路由算法

针对大部分无线传感器网络路由协议只能实现局部能量均衡的问题,提出一种改进的能量均衡路由算法,把传感器网络构建成按最小跳数分层的网络,利用节点直接传输和逐跳转发相结合的混合传输策略,在多跳传输时,使用改进的基于多路径路由的最大能量路径算法。仿真结果表明,该算法能有效延长网络的生存时间。     

基于跨层设计的认知无线Mesh网络拥塞反馈研究

在认知无线Mesh网络中,由于信道状态变化导致的链路负载差异,网络拥塞成为影响认知无线Mesh网络系统性能的重要因素。针对这一问题,提出了基于最大最小公平策略的拥塞反馈算法。该算法通过综合分析基于随机搜索-遗传算法的多速率编解码调制、多重数据流的信道分配机制,以及优化的路由选择三种机制的网络资源分配约束条件,来构建跨层模型,计算网络拥塞。同时,通过拥塞值反馈,实现对物理层、链路层和网络层的联合跨层优化,最大程度避免网络拥塞。仿真结果表明,该算法在网络发生拥塞时收敛更快,能够有效避免拥塞,均衡负载,并能提升网络吞吐量。     

基于SDN架构的高性能网络拥塞避免策略

拥塞管理是高性能网络领域的重要研究方向,网络拥塞会对网络的全局性能产生较大影响。现有的拥塞管理多采用分布式拥塞避免策略,能够在一定程度上解决网络的拥塞问题,但其处理过程基于局部信息,不能充分利用网络资源,处理效率偏低。近期,人们提出软件定义网络(SDN)架构,该架构采用集中控制器和多层网络技术,能够较好地获取网络的全局信息。在原有工作的基础上提出了一种基于SDN架构的全局拥塞避免策略OSCP,该策略在拥塞信息获取和控制信息的传输上,改进了原有的解决方案,并结合自适应传输进行网络路由。实验结果表明,该策略可以较好地避免和解决网络中存在的拥塞问题,降低网络延迟并提高饱和吞吐率。     

Joint routing and flow rate optimization in multi-rate ad hoc networks

Typical radios in ad hoc networks can support multi-rate transmissions. However, traditional routing protocols do not use this feature well in multi-rate ad hoc networks and therefore, the network performance and resource utilization are not optimized. Some algorithms have been proposed to take advantage of the multi-rate transmission scheme, but their performance is not optimized either. In this paper, we show that a cross-layer optimization based approach can significantly improve the performance of multi-rate ad hoc networks over existing routing algorithms. For this, we consider link interference and propose joint routing and flow rate optimization for optimal performance in multi-rate ad hoc networks, i.e., a Cross-layer Optimization based Model for Multi-rate Ad hoc Networks (COMMAN). Considering the characteristics of multi-rate ad hoc networks, we design and implement a distributed heuristic of this centralized model. It is shown that the distributed heuristic algorithm can approximate the performance of COMMAN closely.     

多速率机制下拥塞识别的Ad Hoc跨层路由方案

利用跨层设计的思想,论文提出了一种自适应多速率机制下,基于节点信息的AdHoc路由算法。根据物理层SNR的测量,结合MAC层的信息进行延迟估计,引入一种新的路由度量来选择路径,避开拥塞,减少延迟,提高网络吞吐量,从而能改善网络的整体性能。     

一种多速率移动自组网中的拓扑控制算法

提出了一种移动自组网中的拓扑控制算法MATC(multi-rate aware topology control),该算法充分考虑了无线环境中固有的多速率特性,在保证原有网络连接性的前提下删除部分低速链路,为上层的路由协议构造一个良好的拓扑,确保按需路由协议能够在一跳范围内发现最优路由.大量仿真结果表明,MATC对网络性能有较大的提高.     

Ad Hoc移动网络多路径研究

在Ad Hoc移动网络中,由于结点的移动性,网络拓扑结构的易变性,路由成为研究的热点和难点。当前AdHoc路由协议一般都是单路径协议。然而由于多路径路由方式可以大大减少路由开销,提高数据传输率,减少网络拥塞,越来越多的研究表明,它将是未来Ad Hoc网络路由的主要方式。本文介绍了几种典型的多路径路由协议,并对这些多路径协议进行评价,对其性能进行比较,然后介绍多路径协议在QoS、能源和安全方面的应用,最后指出未来多路径研究的关键问题。     

MCAR: Non-local adaptive Network-on-Chip routing with message propagation of congestion information

Congestion occurs frequently in Networks-on-Chip (NoC) when the packet demands exceed the capacity of network resources. Non-local adaptive routing algorithms utilize the congestion information of both local and distant links to decide the output link selection, which can greatly improve the network performance. The existing non-local adaptive routing algorithms have two mechanisms to propagate the congestion information of distant links. One of mechanism is to increase additional wires/clusters. The other mechanism is to embed the propagated information in packet headers. This paper proposes a new non-local adaptive routing algorithm called MCAR. In MCAR, two special kinds of messages are used to propagate the congestion information of distant links across the network without introducing additional wires/clusters and leading to a better timeliness of congestion information. Moreover, MCAR efficiently utilizes the propagated information to decide the output link selection. Experimental results on both synthetic traffic patterns and application traces show that MCAR achieves better saturation throughput (5.84% on average) and smaller power consumption (7.58% on average) than a state-of-the-art adaptive routing algorithm.     

Providing QoS in OSPF based best effort network using load sensitive routing

In an open shortest path first (OSPF) based best effort network, when a packet experiences congestion, the routing subsystem cannot send it through an alternate path. Thus, it fails to provide desired quality of service (QoS) during congestion. In order to provide QoS we have reported three different load sensitive routing (LSR) protocols in [A. Sahoo, An OSPF based load-sensitive QoS routing algorithm using alternate paths, in: IEEE International Conference on Computer Communication Networks, October 2002; A. Tiwari, A. Sahoo, Providing QoS support in OSPF based best effort network, in: IEEE International Conference on Networks, November 2005; A. Tiwari, A. Sahoo, A local coefficient based load sensitive routing protocol for providing QoS, in: IEEE International Conference on Parallel and Distributed Systems, July 2006]. The LSR protocol forwards packets through alternate paths in case of congestion. The number of alternate paths at any node depends on the value of operating parameter or coefficient used for alternate path calculation. Though the basic protocol in these cases was the same, the methods of choosing operating parameter were different. We referred to these three methods as LSR [A. Sahoo, An OSPF based load-sensitive QoS routing algorithm using alternate paths, in: IEEE International Conference on Computer Communication Networks, October 2002], E-LSR [A. Tiwari, A. Sahoo, Providing QoS support in OSPF based best effort network, in: IEEE International Conference on Networks, November 2005] and L-LSR [A. Tiwari, A. Sahoo, A local coefficient based load sensitive routing protocol for providing QoS, in: IEEE International Conference on Parallel and Distributed Systems, July 2006] coefficient methods. In this paper, we present the LSR protocol along with the three coefficient calculation methods pointing out the reason for going from one method to the next. The main strength of our LSR protocol is that it provides loop free alternate paths in the event of congestion and can interwork with routers running vanilla OSPF protocol. We show through simulation that the LSR protocol based on any of the three different coefficient calculation methods performs much better than OSPF and that out of the three methods proposed by us, L-LSR performs the best.     

Applications of meta‐heuristics to traffic engineering in IP networks

Intra‐domain routing protocols are based on shortest path first (SPF) routing, where shortest paths are calculated between each pair of nodes (routers) using pre‐assigned link weights, also referred to as link metric. These link weights can be modified by network administrators in accordance with the routing policies of the network operator. The operator's objective is usually to minimize traffic congestion or minimize total routing cost subject to the traffic demands and the protocol constraints. However, determining a link weights combination that best suits the network operator's requirements is a difficult task. This paper provides a survey of meta‐heuristic approaches to traffic engineering, focusing on local search approaches and extensions to the basic problem taking into account changing demands and robustness issues with respect to network failures.     

缓解拥塞的IEEE802.11速率选择算法

IEEE802.11的速率选择算法OAR能有效利用信道条件,但不适合拥塞的网络环境。该文改进OAR算法,通过调整拥塞节点的初始竞争窗口值来增加其获得信道的概率,使其在拥塞时能尽快将分组转发出去,从而缓解了拥塞。仿真结果表明,改进后的OAR在网络负荷大时能有效地提高分组投递率。