基于路由协议分析的路由管理系统

为了能够在路由层面更好地管理IP网,路由管理系统通过对网络路由实体及其会话连接,路由拓扑结构的自动发现和采集,构建IP城域网全网路由拓扑数据库,完成对路由实体状态和配置信息的管理,及时捕获网上路由更新信息和抖动变化,为路由稳定性监测和路由系统运行分析提供支撑数据,并为网络流量分析和业务梳理提供分析参考依据。     

路由策略与策略路由的具体应用

路由策略是路由发布和接收的策略，是使用某些策略改变规则，影响路由发布，接收或者路由选择的参教而改变路由发现的结果。策略路由技术是对传统路由技术的扩展和改进，基于策略的路由比传统路由使用更灵活，不仅能够根据目的地址，而且能够根据报文大小、应用或IP源地址来选择转发路径。     

ASON分层路由和域间路由

文章描述了ASON中路由域的划分,介绍了ASON中的分层路由及其实现,从路由模式出发,着重描述了层次路由、源路由及逐跳路由模式的连接建立和操作过程,并在此基础上提出了基于源路由模式的ASON域间路由的设计方案。     

容迟／容断网络路由技术研究

容迟／容断网络（DTN）由于其长延迟、高误码率及频繁断路等网络特性不满足互联网较短传输延迟、低误码率及存在端到端路径的基本假设,传统Internet体系结构和协议无法直接用于DTN。DTN路由机制可以按照连接的确定性分为确定性路由和随机性路由。确定性路由主要有基于树的路由、时空路由和修正的最短路径路由等方法;随机性路由主要有流行性路由、基于历史消息的路由、基于模型的路由、可控移动路由和基于编码的路由。DTN在游牧计算、军事战场通信、紧急营救及灾后重建方面具有广泛应用前景。     

Ad hoc网络技术讲座第2讲 Ad hoc网络中的路由选择问题

本文介绍了Ad hoc网络中路由选择问题的特点，并从路由的驱动机制方面介绍了主动式路由协议和按需式路由协议，从网络的拓扑结构方面介绍了平面式路由协议和分簇式路由协议，最后给出了这几类路由协议的性能比较。     

Ad hoc网络技术讲座 第2讲 Ad hoc网络中的路由选择问题

本文介绍了Adhoc网络中路由选择问题的特点,并从路由的驱动机制方面介绍了主动式路由协议和按需式路由协议,从网络的拓扑结构方面介绍了平面式路由协议和分簇式路由协议,最后给出了这几类路由协议的性能比较。     

基于Matlab的Ad Hoc网络定向/全向路由仿真分析

通过分析Ad Hoc网络组网、网络拓扑、网络管理等方面特性,定性分析并比较了Ad Hoc网络的全向和定向路由性能,选用AODV全向路由和结合贪婪转发策略与AODV的定向路由两种路由协议,并利用Matlab仿真路由发现机制,进一步直观比较全向路由与定向路由的差异。仿真实验结果表明,节点在正态分布、泊松分布以及自主移动条件下,定向路由性能优于全向路由。     

基于位置无关名字的可扩展几何路由方案

名字路由已成为未来网络的研究热点之一,由于网络中节点和信息规模的持续增长,可扩展问题成为其瓶颈.几何路由作为新型可扩展路由方案,可同时满足路由表规模和路由路径的可扩展,但难以支持名字路由.首先在几何路由基础上提出了一种通用的基于位置无关名字的可扩展几何路由方案——GRIN,结合源路由和贪心路由实现混合几何路由,在混合几何路由上引入基于双层稀疏群组的名字解析(映射).然后理论分析了节点状态及名字映射的路径延展度上界.最后通过仿真验证了GRIN具备可扩展、低延展度以及高可靠性等特征,并优于其他名字路由方案.     

移动自组织网路由稳定性分析

针对移动自组织网络中的路由建立和维护问题,研究了衡量路由稳定性的准则,以节点的不确定性特征作为路由选择的标准,提出了基于局部拓扑结构变化熵度量的稳定路由选择策略,并在此基础上设计了一种稳定路由协议。通过NS-2仿真软件对路由选择策略和路由协议进行了验证,仿真结果表明所提出的稳定路由选择策略和路由协议能够有效地提高移动自组织网络的性能。     

下一代高速网络中的QOS路由选择

路由是网络支持多媒体业务的关键技术之一，QOS(Quality of Service)路由选择的目的是要选择一条具有足够资源满足对某些度量标准的限制条件的路径。路由选择可以分为单播路由选择和多播路由选择两种，其又包含了三种具体的策略：源端路由选择、分布式路由选择和分级路由选择。本文将具体的讨论QOS路由选择的基本问题和基本策略。     

多层卫星网络链路中断容忍路由策略设计

链路中断和接续对卫星网络路由有重要影响,该文针对多层卫星网络,设计了链路中断容忍路由策略,利用非均匀时间段内卫星网络拓扑结构的可预测性进行路由表计算,采取动态的拥塞控制机制和洪泛策略,解决由于卫星运动、通信设备故障引发链路中断情况下的路由问题。仿真结果表明,该路由策略具有较高的链路利用率,能够减少动态路由计算中时延信息收集和星上路由表生成给卫星节点带来的时空开销。     

On-demand loop-free routing with link vectors

We present the on-demand link vector (OLIVE) protocol, a routing protocol for ad hoc networks based on link-state information that is free of routing loops and supports destination-based packet forwarding. Routers exchange routing information reactively for each destination in the form of complete paths, and each node creates a labeled source graph based on the paths advertised by its neighbors. A node originates a broadcast route request (RREQ) to obtain a route for a destination for which a complete path does not exist in its source graph. When the original path breaks, a node can select an alternative path based on information reported by neighbors, and a node can send a unicast RREQ to verify that the route is still active. A node that cannot find any alternate path to a destination sends route errors reliably to those neighbors that were using it as next hop to the destination. Using simulation experiments in ns2, OLIVE is shown to outperform dynamic source routing, ad hoc on-demand distance vector, optimized link-state routing protocol, and topology broadcast based on reverse-path forwarding, in terms of control overhead, throughput, and average network delay, while maintaining loop-free routing with no need for source routes.     

Stability-Based RREQ Forwarding Game for Stability-Oriented Route Discovery in MANETs

In traditional stability-oriented route discovery of mobile ad hoc networks, in-between nodes need to rebroadcast identical route request (RREQ) packets, which contain same source node ID and broadcast sequence number, to discover more stable route, yet it increases routing overhead and data transmission delay obviously. Therefore, a stability-oriented route discovery algorithm is proposed to limit routing overhead and decrease transmission delay. In this algorithm, all neighbor nodes of some node will play a mix strategy game named stability-based RREQ forwarding game after receiving an identical RREQ, and independently determine the RREQ forwarding probability based on Nash equilibrium, respectively. The simulation results show that the proposed stability-oriented route discovery algorithm not only reduces routing overhead and transmission delay effectively, but also improve other routing performance.     

Active detection in mitigating routing misbehavior for MANETs

Mobile ad hoc network (MANET) is vulnerable to security attacks because of the shared radio medium and lack of centralized coordination. Since most multi-hop routing protocols implicitly assume cooperative routing and are not originally designed for security attacks, MANET has been challenged by diverse denial-of-service attacks that often interfere with the protocol and interrupt on-going communication. In this paper, we propose an explore-based active detection scheme, called EBAD, to efficiently mitigate the routing misbehaviors in MANETs running with dynamic source routing. The basic idea is that a source node broadcasts a route request packet with a fictitious destination node to lure potential malicious nodes to reply a fake route reply packet. If the source node receives the fake route reply packet or an intermediate node cannot decrypt the received route reply packet, the routing misbehavior can be detected. We also propose a route expiry timer based approach to reduce the effect of route cache pollution because of the fake route reply. We present a simple analytical model of the EBAD and its numerical result in terms of detection rate. We also conduct extensive simulation experiments using the OMNeT++ for performance evaluation and comparison with the existing schemes, CBDS and 2ACK. The simulation results show that the proposed countermeasure can not only improve the detection rate and packet delivery ratio but also can reduce the energy consumption and detection latency.

     

面向高动态高空平台网络的路由协议研究

提出了一种面向高动态高空平台网络的路由协议,该协议通过按需查找方式确定高动态用户所属的高空平台,根据最短延时路由表在高空平台之间转发数据,并通过用户切换策略保证数据传输的连续性。仿真结果表明,该协议能够适应用户高速移动和频繁切换的高动态环境,具有可靠性高、延时小、路由开销小、抗毁性强等特点,为高动态高空平台网络的数据转发提供了一种可行的解决方法。     

A Safe Proactive Routing Protocol SDSDV for Ad Hoc Network

In mobile Ad Hoc network, nodes move freely, this can lead to frequent changes of network topology. Routing protocol algorithm is the strategy to establish communication links for network nodes, and its performance influences the availability of Ad Hoc network directly. By using wireless channel to transmit data in Ad Hoc network, the invaded malicious nodes will cause various attacks, aim to steal the transmission data or destroy the network. Based on the traditional proactive routing protocol for Ad Hoc network, an improved safe routing strategy SDSDV is put forward to resist attacks against routing protocols. The safe proactive routing protocol includes route request and route response two stages. When the network initialization is complete, after successful identity authentication by each other, secure communication paths are established between nodes and the encrypted data will be transmission through the path. The protocol integrates distributed authentication, encryption algorithm, hash check, and other security policy together. SDSDV protocol reduces the risk of malicious manipulation of routing information and ensures the safe and reliable routing between the source and destination nodes.     

认知无线网络中基于主用户行为的联合路由和信道分配算法

针对认知无线网络中主用户行为将导致频谱瞬时变化而影响路由稳定性的问题,提出了一种基于主用户行为的路由和信道联合分配算法。该算法通过采用呼叫模型对主用户行为建模,并根据动态源路由协议的路由寻找机制,在目的节点等待多个路由请求分组后选择受主用户行为影响最小的路由,然后沿着所选定路径的反方向传送路由回复分组并完成信道分配。理论分析证明了算法中的链路平均持续时间期望与主用户活动概率成反比且具有与网络节点数成正比的计算复杂度。仿真结果表明,该算法具有比Gymkhana路由方案更高的分组投递率和更低的平均分组时延。     

Adaptive load distribution approach based on congestion control scheme in ad-hoc networks

The ‘load distribution’ proposition in mobile ad-hoc networks (MANETs) is accomplishing great stimulation. This is because of the phenomenal facets it possesses including advanced network resilience, reliability and performance. Though there are other leading network layer routing protocols, but they radically utilise single-path communication paradigm, which is why they fail in achieving efficient load distribution in a network. Via this paper, we propose an efficient cross-layer adaptive load distribution approach to capitalise network’s channel utilisation and to rapidly adapt to dynamic wireless channel characteristic changes. The proposed method modifies the load balanced congestion adaptive routing (LBCAR) protocol and is developed using dynamic load distribution technique, by pioneering (i) novel parameters, which report for the availability of route pertaining to minimum traffic load and better link lifetime and also adapt according to varying available network resources; (ii) an absolute dynamic method to lessen the redundant route oscillations which further reduces the routing instabilities. The simulation results demonstrate the usefulness of the proposed method and yields better results in comparison to LBCAR and standard instead of dynamic ource outing, it is dynamic source routing (DSR) protocol.     

Analysis of MANET dynamic source routing and its performance enhancements

Since the inception of the dynamic source routing (DSR) protocol for mobile ad hoc networks, several enhancements have been proposed, along with other competing routing protocols. All of them provide different degrees of throughput improvement under different scenarios. In this paper, we use DSR as a base, diagnose the contribution of its constituent components, and provide the reason why certain routing enhancements can increase the throughput and under what conditions. A major finding of the study is that the broadcast mechanism used in propagating route request and route error messages has a significant impact on how routing behaves. We also show that unicast route error report and preventive cache update improve throughput at different sides of the mobility spectrum. Finally, we show that aggressive buffer combined with route management provides the best performance improvement on the entire mobility and loading spectrum. Copyright © 2013 John Wiley & Sons, Ltd.     

Robust multi-path routing for dynamic topology in wireless sensor networks

Wireless sensor networks are being widely researched and are expected to be used in several scenarios. On the leading edge of treads, on-demand, high-reliability, and low-latency routing protocol is desirable for indoor environment applications. This article proposes a routing scheme called robust multi-path routing that establishes and uses multiple node-disjoint routes. Providing multiple routes helps to reduce the route recovery process and control the message overhead. The performance comparison of this protocol with dynamic source routing (DSR) by OPNET simulations shows that this protocol is able to achieve a remarkable improvement in the packet delivery ratio and average end-to-end delay.