机动通信网中的DTN路由协议研究

针对DTN网络的核心机制-路由算法,分析了目前DTN路由算法的主要技术及其特点,包括队列管理、复制机制和转发机制。并且根据DTN网络的特点,采用了几种路由算法进行仿真。通过仿真表明,这几种路由算法都具有较高的消息投递成功率,但开销较大,消息的无限复制会大大地占用节点的缓存空间。因此平衡DTN网络中的开销与投递率还是一个设计的难点,需要根据实际网络参数做出适当的折中。仿真结果表明,DTN路由不能直接应用于机动通信网,但是一些设计思想可以借鉴。     

移动Ad hoc网络负载的NS2仿真分析

网络负载问题是移动Ad hoc路由算法的研究重点。通过设置不同发送数据频率和不同网络连接度来改变网络负载,利用NS2仿真Ad hoc路由协议分析性能参数：分组投递率、平均端到端延迟和路由开销,对不同负载下的网络性能进行研究。结果表明,在网络负载较小情况下,3种路由协议下的网络相差不大,当网络繁忙时,按需距离矢量路由协议...     

一种空基自组网路由协议的研究

针对传统Ad Hoc路由协议无法满足空基自组网在高动态拓扑下成功投递、路由开销和低延迟的要求,研究了一种利用空基平台已规划的航线信息来提高网络路由性能的路由协议.该路由协议由已知移动信息路由协议（MARP,mobility aware route protocol）和移动信息洪泛协议（MDP,mobility dissemination protocol）组成.MARP利用规划的航线信息预测网络拓扑并计算路由,MDP采用洪泛方式通知网络中所有节点实际拓扑和预测拓扑的差异信息.设计该协议的数据结构、链路预测机制、实际链路探测机制、多余广播减少机制.通过QualNet仿真验证,结果表明,MARP/MDP在平均报文传输延迟、报文成功投递率及路由开销方面比AODV和OLSR协议具有更优越的性能.     

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

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

基于Q-learning算法的无人机自组网AODV稳定路由改进方法

针对小型无人机集群组网中节点高速移动、网络拓扑变化剧烈导致的网络性能下降问题,在无线自组网按需平面距离向量（AODV）协议基础上,提出一种具有链路稳定度意识的无人机自组网路由协议（LN-AODV）。首先,通过加权计算链路维持时间和邻居节点变化度,从而选择稳定路径,解决拓扑结构动态变化条件下数据传输延迟和数据成功投递率下降的难题;然后,结合Q-learning算法自适应调整Hello消息的发送周期,使协议能够通过感知拓扑变化程度调整路由控制开销和拓扑感知灵敏度。仿真结果表明,相比于AODV,所提方法在端到端延迟、分组投递率、路由开销和数据吞吐量4个网络性能指标上分别提升7.56%,2.58%,17.39%,2.62%,可适应于节点高速运动的无人机自组网,对于无线自组网理论研究及拓展应用具有重要的借鉴意义。     

无线adhoc网络中的多径源路由

本文针对无线ad hoc网络提出了一种基于DSR(动态源路由)的路由算法,多径源路由(MSR).MSR对DSR中的路由搜索和路由维护机制进行了扩展,用来解决多径路由问题.本文还提出,在多条路径之间基于测量的RTT进行负载分配.仿真结果表明,MSR在只增加少量网络开销的情况下,提高了TCP和UDP的投递率,降低了丢包率,并减少了端到端之间的延迟以及队列长度,从而有效地减少了网络拥塞.     

基于闲时逆寻和路由学习机制的优化AODV路由协议

对AODV协议在不同MANET网络环境中的性能缺陷进行了研究,提出了节点闲时反向路由搜索机制和邻居节点路由监听学习机制,并进一步提出了优化的AODV路由协议O-AODV。利用O-AODV协议在MANET网络中产生多个局部路由,从而增加网络中的路由冗余度,提高路由发现的效率,加快故障路由的本地修复。仿真实验结果表明,O-AODV协议提高了分组投递率,降低了端到端延时,有效地减少了网络中的重路由开销,在大规模和拓扑变化快的网络环境中优于AODV协议。     

WAVE/WiMAX混合车载自组网路由研究

提出一种混合网络中节点密度自适应的路由协议,能够实现全网各条道路上实时车流的估算,并根据节点密度自适应地选择WiMAX或WAVE网络发送数据包,同时动态生成数据包转发的源路由.仿真实验表明,协议的数据包递送成功率有较大幅度提高,端到端平均递送延迟较小,并且WiMAX开销增长较小.     

DTN网络中基于生灭模型的节点运动模式检测

提出了一种DTN网络中基于生灭模型的节点运动模式检测方法(MMD-BDM, mobility model detection method based on birth and death model)。在节点数据传输过程中,根据数据传输量计算得到各个连通链路采样时刻的信道容量,在本节点构建以信道容量构成的三维时变连通矩阵,并在此基础上推导出基于边连通的节点连通性生灭模型,然后分析节点连通边的生灭特征并以此判断节点的运动模式,以优化DTN网络消息投递过程中的路由转发策略。最后,将该运动模式检测方法应用在喷射路由(SWR, spray and wait routing)和随机网络编码路由(RNCR, random network coding routing)算法中进行了仿真实验,实验表明,该方法能提高DTN网络机会路由的投递率和投递延迟等数据投递性能。     

基于动态分段网络编码的DTN高效路由算法

针对DTN现有的动态分段网络编码(Dynamic Segmented Network Coding,DSNC)路由算法在编码包头部存在冗余字段、ACK反馈阶段存在冗余开销和节点因无序转发编码包而影响数据包端到端时延等问题,提出基于动态分段网络编码的DTN高效路由算法—ERBNC(Efficient Routing Based on dynamic segmented Network Coding).该算法通过采取压缩编码包头部字段、删除冗余的ACK分组、设置编码包的发送优先级等措施以减少网络开销和数据包平均端到端时延.仿真结果表明,与DSNC算法相比,ERBNC算法在网络开销和端到端时延方面的性能均得到改善.     

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

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

面向混合DTN网络的新型传输架构 CAF

Delay-Tolerant Networks ( DTNs ) are wireless networks that often experience temporary, even long-duration partitioning. Current DTN researches mainly focus on pure delay-tolerant networks that are extreme environments within a limited application scope. It motivates the identification of a more reasonable and valuable DTN architecture, which can be applied in a wider range of environments to achieve interoperability between some networks suffering from frequent network partitioning, and other networks provided with stable and high speed Internet access. Such hybrid delay-tolerant networks have a lot of applications in real world. A novel and practical Cache-Assign-Forward (CAF) architecture is proposed as an appropriate approach to tie together such hybrid networks to achieve an efficient and flexible data communication. Based on CAF, we enhance the existing DTN routing protocols and apply them to complex hybrid delay-tolerant networks. Simulations show that CAF can improve DTN routing performance significantly in hybrid DTN environments.     

Safari: A self-organizing, hierarchical architecture for scalable ad hoc networking

As wireless devices become more pervasive, mobile ad hoc networks are gaining importance, motivating the development of highly scalable ad hoc networking techniques. In this paper, we give an overview of the Safari architecture for highly scalable ad hoc network routing, and we present the design and evaluation of a specific realization of the Safari architecture, which we call Masai. We focus in this work on the scalability of learning and maintaining the routing state necessary for a large ad hoc network. The Safari architecture provides scalable ad hoc network routing, the seamless integration of infrastructure networks when and where they are available, and the support of self-organizing, decentralized network applications. Safari’s architecture is based on (1) a self-organizing network hierarchy that recursively groups participating nodes into an adaptive, locality-based hierarchy of cells; (2) a routing protocol that uses a hybrid of proactive and reactive routing information in the cells and scales to much larger numbers of nodes than previous ad hoc network routing protocols; and (3) a distributed hash table grounded in the network hierarchy, which supports decentralized network services on top of Safari. We evaluate the Masai realization of the Safari architecture through analysis and simulations, under varying network sizes, fraction of mobile nodes, and offered traffic loads. Compared to both the DSR and the L+ routing protocols, our results show that the Masai realization of the Safari architecture is significantly more scalable, with much higher packet delivery ratio and lower overhead.     

Generic prediction assisted single-copy routing in underwater delay tolerant sensor networks

One challenge in delay tolerant networks (DTNs) is efficient routing, as the lack of contemporaneous end-to-end paths makes conventional routing schemes inapplicable. Although many DTN routing protocols have been proposed, they often have two limitations: many protocols are not mobility cognizant, so they only suit specific mobility models and become inefficient when the environment changes; some protocols employ multi-copy replication to accommodate mobility diversity for increased delivery probability or reduced delay, but they usually do not perform well in resource constrained networks. Due to the unique characteristics of underwater sensor networks (UWSNs), efficient DTN routing becomes even more challenging. In this paper, we propose a generic prediction assisted single-copy routing (PASR) scheme that can be instantiated for different mobility models. PASR first collects a short-duration trace with network connectivity information and employs an effective off-line greedy algorithm to characterize the underlying network mobility patterns, depict the features of best routing paths and provide guidance on how to use historical information. Then it instantiates prediction assisted single-copy online routing protocols based on the guidance. As a result, the instantiated protocols are energy efficient and cognizant of the underlying mobility patterns. We demonstrate the advantages of PASR in underwater sensor networks with various mobility models.     

Fair content dissemination in participatory DTNs

Thanks to advances in the computing capabilities and added functionalities of modern mobile devices, creating and consuming digital media on the move has never been so easy and popular. Most of the DTN routing protocols proposed in the literature to enable content sharing have been exploiting users’ mobility patterns, in order to maximise the delivery probability, while minimising the overall network overhead (e.g., number of message replicas in the system, messages’ path length). Common to all these protocols has been the assumption that devices are willing to participate in the content distribution network; however, because of battery constraints, participation cannot be taken for granted, especially if the very same subset of devices are continuously selected as content carriers, simply because of their mobility properties. Indeed, we demonstrate that state-of-the-art DTN routing protocols distribute load in a highly unfair manner, with detrimental effects on delivery once the assumption of unconditional participation is lifted. To overcome this limitation, we propose a load-balancing mechanism whereby nodes maintain local estimates of network workload, and use them to direct traffic towards the least loaded portion of the network. We implement the mechanism on top of a source-based DTN routing protocol, and demonstrate, by means of simulation using a variety of real mobility traces, that high delivery is now achieved without compromising fairness.     

典型航空自组网路由协议仿真与性能评估

航空自组网是自组网在航空领域的典型应用.航空自组网的关键技术在于路由协议的选取和设计.基于场景用NS2软件仿真研究了3种适用于航空自组网的路由协议及其网络性能,并定义了4个性能评估准则.仿真结果表明,单跳距离一定时,3种路由协议的网络性能随着节点密度的增加而总体变差.同等条件下,AODV路由协议路由开销高于DSVD和GRID路由协议,端到端平均延时低于DSVD和GRID路由协议,而GRID协议分组投递率和平均跳数保持最高.     

A link contact duration-based routing protocol in delay-tolerant networks

Delay Tolerant Networks (DTNs) provide message delivery services to users via intermittently connected nodes. In DTNs, routing is one of the most challenging issues since end-to-end connectivity between nodes may not be available most of the time. Although many routing protocols for DTNs have been proposed, they do not achieve satisfactory performance, since they exploit only some of the network characteristics. In this paper, we present a new DTN routing protocol, called the Link Contact Duration-based Routing Protocol (LCD). Like existing protocols, LCD uses the disconnect duration of a link between two nodes to find the routing path with the shortest end-to-end delay. In addition, LCD uses the contact duration of a link and the number of buffered messages to deliver as many messages as possible in a short time. Our simulation results show that LCD has better performance than existing DTN routing protocols.     

Integrated Social and QoS Trust-Based Routing in Delay Tolerant Networks

We propose and analyze a class of integrated social and quality of service (QoS) trust-based routing protocols in mobile ad-hoc delay tolerant networks. The underlying idea is to incorporate trust evaluation in the routing protocol, considering not only QoS trust properties but also social trust properties to evaluate other nodes encountered. We prove that our protocol is resilient against bad-mouthing, good-mouthing and whitewashing attacks performed by malicious nodes. By utilizing a stochastic Petri net model describing a delay tolerant network consisting of heterogeneous mobile nodes with vastly different social and networking behaviors, we analyze the performance characteristics of trust-based routing protocols in terms of message delivery ratio, message delay, and message overhead against connectivity-based, epidemic and PROPHET routing protocols. The results indicate that our trust-based routing protocols outperform PROPHET and can approach the ideal performance obtainable by epidemic routing in delivery ratio and message delay, without incurring high message overhead. Further, integrated social and QoS trust-based protocols can effectively trade off message delay for a significant gain in message delivery ratio and message overhead over traditional connectivity-based routing protocols.     

容迟与容断网络的研究进展

本文简要介绍了容迟与容断网络的基本特征、体系结构、应用领域和比较活跃的研究机构及其主要工作。采用分析和比较的方法,总结了容迟与容断网络路由协议和传输协议的主要研究成果,探讨了相关研究问题,分析比较了容迟与容断网络的仿真工具。最后总结并展望了容迟与容断网络进一步的发展方向。     

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

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