容迟容断网络路由协议研究

容迟容断网络近年来得到了广泛的研究和应用.容迟容断网络中源节点和目的节点之间不存在持续稳定的端到端路径,因而传统网络的路由协议无法适用于容迟容断网络.为了完成容迟容断网络消息传输,采用基于存储-转发的路由机制.容迟容断网络路由协议性能受链路生存时间、节点缓存大小以及网络中节点移动模型等影响.对容迟容断网络路由协议的研究和进展进行了较为深入的探讨,对主要路由协议的性能进行了比较,并总结了未来的研究方向.     

容迟网络场景监测自适应路由研究

在容迟网络中,由于节点分别相对稀疏,节点的移动性较强,造成链路时断时续,不存在端到端的路径,因此节点的移动性对路由性能有很大影响.不同的运动模型链路连通规律是不同的,设计针对性的路由算法,充分利用节点运动规律对提高路由整体性能有极大帮助.然而节点的运动模型不是一成不变的,监测运动模型变化并且切换路由策略是提高复杂运动中节点间数据收发的成功率的基础.设计监测节点运动环境变化算法,建立自适应路由模型,很好地解决了路由算法随节点运动状态改变的问题.通过仿真实验可以看出,算法可以准确监测运动模型变化,及时调整路由策略.     

战术通信中异构Ad-hoc网络路由策略

针对战术通信中的网络异构性和节点群组移动性,在建立群组移动模型的基础上,采用簇头稳定分簇算法动态划分管理异构网络分层结构,提出基于链路状态的分层路由策略整合异构无线资源。该策略分为区内路由策略和区间路由策略,面向不同网络层次采用不同路由机制。OPNET仿真结果表明,该策略的分组成功接收率和平均端到端延时性能均优于分层AODV协议。     

一种基于历史相遇信息的容迟网络地理路由算法

为使消息在容迟网络中更有效地传输,将节点的地理位置、移动方向等地理信息与节点间的历史相遇频繁程度相结合,提出一种新的容迟网络地理路由算法。该算法将移动节点间的历史相遇信息作为分配消息副本的依据,从而减少复制策略路由算法中的副本数量。利用邻居节点移动方向所构成的夹角对中继节点的选择进一步优化,得到较高的投递率以及较低的端到端平均时延。仿真结果表明,当节点移动相对缓慢并且消息生存周期较短时,该算法的消息投递率优于Spray&Wait,Epidemic,Prophet等路由算法,在消息生存周期较短的情况下,当节点的缓存资源为限制路由算法性能的瓶颈因素时,与Epidemic算法相比,网络负载率降低40%,与Prophet算法相比负载降低了25%,有效减少了平均跳数和平均时延。     

一种移动容迟网络体系结构及其应用

移动容迟网络利用节点移动带来的通信机会,在非全连通的网络中提供低成本高可用性的传输服务.移动公交车组成的网络是典型的移动容迟网络,城市中公交车网络具有覆盖范围广、移动路线固定等优点,适合城市环境信息收集和分发等多种应用.结合移动容迟网络的特性,提出了层次化的移动容迟网络体系结构和3层网络架构,结合城市中公交车辆,研究并设计了若干关键技术,包括Internet快速接入机制、公平的数据收集机制、基于地理位置的数据分发机制和缓存管理与调度机制.通过真实场景下的实验和基于trace的仿真实验,验证了提出的算法和机制具有较好的性能和鲁棒性.     

EMRPP：一种DTMSN组播路由算法

针对容迟移动传感器网络（Delay Tolerant Mobile Sensor Network,DTMSN）网络的容迟及节点的移动性特点,提出了一种新的基于概率预测的能量均衡组播路由算法（Energy-balanced Multicast Routing based Probability Probabilistic,EMRPP）。该算法采用到达概率选择路由下一跳的方式,且考虑了节点能量对算法性能的影响。仿真结果表明,EMRPP算法在数据传输率和平均传输延迟方面的性能要优于改进之前的PROPHET算法,是一种有效的容迟移动网络组播路由方案。     

容迟容断网络中基于模型的动态路由算法

通过对容迟容断网络中无拓扑信息路由算法进行分析,提出了基于模型的容迟容断网络动态路由算法.针对节点位置信息事先难以确定的特点,动态更新节点到访概率及相遇概率,并在此基础上自适应选择中继节点.对所提算法进行了仿真实现和性能分析.结果表明,基于模型的容迟容断网络动态路由算法不仅可以提高报文递交率并降低平均传输延时,而且可以避免产生大量冗余报文副本.     

基于效用的容迟网络路由技术研究*

容迟网络作为移动自组网和传感器网络最新的发展形式,在智能公路、生物监测、卫星通信、乡村通信、个人信息交换等领域具有十分广阔的应用前景。容迟网络路由设计是一个富有挑战性和前景的新兴研究领域,本文概述了容迟网络路由技术的发展、面临的挑战和评价指标,对容迟网络路由协议进行了分类,详细介绍了目前主要基于效用的路由协议基本原理和特点,并进行深入分析和比较,最后结合该领域当前研究现状,对未来研究容迟网络效用路由算法进行了总结和展望。     

基于卡尔曼预测的VANET混合路由算法

在车载自组织网络(VANET)中,车辆高速移动和分布不均导致网络拓扑快速变化、传输路径频繁中断,造成路由效率低下。为此,提出一种适用于城市场景的、基于卡尔曼预测的VANET混合路由算法,每个车辆节点通过部署卡尔曼预测器对邻居节点位置进行预测,通过该预测位置进行路由计算。在GPSR算法贪婪模式和边缘模式的基础上,借助容迟网络(DTN)路由的思想,存储并携带无转发节点的分组直至找到合适的转发节点。仿真结果表明,与GPSR算法和带缓存的GPSR算法相比,该算法在分组投递率和端到端时延方面性能更好。     

基于蚁群的AdHoc网络分簇路由算法

无线AdHoc网络是一个多跳、临时性的对等移动自治系统,它由一组带有无线收发装置的移动节点组成。而路由协议是AdHoc网络体系结构中不可或缺的重要组成部分,因此路由协议的研究成为当前AdHoc网络研究的重点。针对AdHoc网络节点能量有限的特性,提出了一种基于分簇及蚁群的组合路由算法（CRBAC）。给出了分簇策略下的簇内簇间路由机制,簇内采用按需路由策略,将改进的蚁群算法应用到簇内路由机制中,通过扩散信息素选择能量高的邻节点均衡网络节点能量,而簇间采用尽可能简单的表驱动路由策略。仿真结果表明,该算法是合理的,不仅有效地减少了端到端时延,而且提高了网络的生存时间。     

容迟与容断网络中的路由协议

作为一种新型的端到端存储转发网络体系结构,容迟与容断网络(delay and disruption tolerant network)具有间歇连接、频繁割裂、时延极高、非对称的数据速率、较高的误码率、异构互连等特点,传统的Internet、移动Ad Hoc网络和传感网的路由协议难以有效应用在容迟与容断网络中,容迟与容断网络路由面临新的挑战.在简要介绍了容迟与容断网络的基本特性和路由协议设计挑战之后,提出了路由协议评估指标.然后从单播路由、组播路由和选播路由3个方面介绍了容迟与容断网络路由协议的研究进展,最后对主要路由协议进行了综合比较,并指出了未来的研究方向.     

SmallWorld Model-Based Polylogarithmic Routing Using Mobile Nodes

The use of mobile nodes to improve network system performance has drawn considerable attention recently. The movement-assisted model considers mobility as a desirable feature,where routing is based on the store-carry-forward paradigm with random or controlled movement of resource rich mobile nodes.The application of such a model has been used in several emerging networks,including mobile ad hoc networks(MANETs),wireless sensor networks(WSNs),and delay tolerant networks(DTNs).It is well known that mobility increases the capacity of MANETs by reducing the number of relays for routing,prolonging the lifespan of WSNs by using mobile nodes in place of bottleneck static sensors,and ensuring network connectivity in DTNs using mobile nodes to connect different parts of a disconnected network.Trajectory planning and the coordination of mobile nodes are two important design issues aiming to optimize or balance several measures, including delay,average number of relays,and moving distance.In this paper,we propose a new controlled mobility model with an expected polylogarithmic number of relays to achieve a good balance among several contradictory goals,including delay,the number of relays,and moving distance.The model is based on the small-world model where each static node has"short"link connections to its nearest neighbors and"long"link connections to other nodes following a certain probability distribution.Short links are regular wireless connections whereas long links are implemented using mobile nodes.Various issues are considered,including trade-offs between delay and average number of relays,selection of the number of mobile nodes,and selection of the number of long links.The effectiveness of the proposed model is evaluated analytically as well as through simulation.     

基于话题相关的文档集的无向基本要素网络的连通性探讨

基于数量有限的文档,该文构建以基本要素中的head和modifier为节点的无向网络UBEN,调查了话题相关文档的UBEN的连通性,指出了话题相关的文档的UBEN具有的特性。讨论停用词对UBEN连通性的影响,比较了相关文档集和随机文档集的UBEN的联通特性的差异,指出了连通性在一定程度上是文档之间内容相关导致的融合结果。结论对多文档自动文摘和信息检索等任务有一定的意义。     

延迟容忍传感器网络基于相对距离的数据传输

延迟容忍移动无线传感器网络(delay tolerant mobile sensor network,简称DTMSN)用于广泛数据收集.与传统的传感器网络不同,DTMSN 具有节点移动性、间歇连通性并且能够容忍适当的延迟,因此传统传感器网络的数据收集算法不能适用.提出了一种基于相对距离感知的动态数据传输策略RDAD(relative distance-aware data delivery scheme).RDAD采用传感器节点到汇聚点(sink node)的相对距离来计算节点传输概率的大小,并以此作为消     

On fault tolerance of 3-dimensional mesh networks

In this paper, the concept of k-submesh and k-submesh connectivity fault tolerance model is proposed. And the fault tolerance of 3-D mesh networks is studied under a more realistic model in which each network node has an independent failure probability. It is first observed that if the node failure probability is fixed, then the connectivity probability of 3-D mesh networks can be arbitrarily small when the network size is sufficiently large. Thus, it is practically important for multicomputer system manufacturer to determine the upper bound for node failure probability when the probability of network connectivity and the network size are given. A novel technique is developed to formally derive lower bounds on the connectivity probability for 3-D mesh networks. The study shows that 3-D mesh networks of practical size can tolerate a large number of faulty nodes thus are reliable enough for multicomputer systems. A number of advantages of 3-D mesh networks over other popular network topologies are given.     

机会网络中面向周期性间歇连通的数据传输

提出一种在机会网络中基于周期性间歇连通的数据传输策略PICD(periodic intermittently connectedbaseddata delivery in opportunistic networks).通过有效利用节点间的周期间歇连通性改善数据传输性能.节点传输概率的计算则充分考虑了其与汇聚点间存在的间歇多跳路径,并将其与消息容忍的传输延迟相结合.首先,采用随机动态规划的方法建立与延迟相关的传输概率模型;然后,通过基于多跳的函数空间迭代法求出一个周期内的与延迟相关的传输概率分布矩阵;节点面向不同消息延迟的传输概率则基于分布矩阵计算获得,以此作为选择下一跳的依据.与延迟相关的概率转发机制提高了消息在容忍的延迟内被成功递交的可能.仿真实验结果表明,与现有的几种数据传输算法相比,在节点具有循环运动特征的环境下,PICD具有较高的数据传输成功率和较低的递交延迟.     

Analytical evaluation of average delay and maximum stable throughput along a typical two-way street for vehicular ad hoc networks in sparse situations

Intermittent connectivity is an intrinsic feature of vehicular ad hoc networks (VANETs) in sparse situations. This type of network is in fact an example of delay and disruption tolerant networks (DTNs). In this paper, we focus on a typical two-way street and analytically evaluate the maximum stable throughput and the average delay for packet forwarding along the street. To this end, we map the mobility patterns of the vehicles with different speeds onto suitable parameters of a BCMP queueing network and derive the location density of vehicles. Then, we employ another queueing network in order to model opportunistic multi-hop packet forwarding along the street with respect to the specifications of MAC and routing schemes. We propose a two-mode MAC scheme suitable for DTNs with predictable mobility patterns. We also consider the effect of vehicles’ velocities and opportunistic relaying for routing schemes. In our analysis, we evaluate the average delay and the maximum stable throughput for the proposed MAC and routing schemes. In the last part of the paper, we show the efficiency of the proposed analytical approach by some numerical results and confirm our analysis by simulation.     

机会网络数据收集中的转发控制

针对机会网络中由于节点移动、网络稀疏等各种原因通常导致网络拓扑动态变化大,消息源节点到汇聚节点之间往往不存在稳定的端到端的通信链路,提出了一种基于偏好顺序决策法(the technique for order preference by similarity to ideal so-lution,TOPSIS)的数据收集策略(data gathering based on the TOPSIS,DGT)。DGT策略根据节点的剩余能量、感知节点到汇聚节点的距离以及传感器节点的连通变化,采用TOPSIS评估选择下一跳中继节点。仿真实验表明,与现有的几种典型转发控制机制相比,DGT策略在保证较低传输延迟和较高传输成功率的基础上,通过减少节点间的转发次数,降低了网络传输开销。     

An Efficient Message Dissemination Scheme for Minimizing Delivery Delay in Delay Tolerant Networks

Delay tolerant networks (DTNs) are a kind of sparse and highly mobile wireless networks, where no stable connectivity guarantee can be assumed. Most DTN users have several points of interest (PoIs), and they enjoy disseminating messages to the other users of the same PoI through WiFi. In DTNs, some time-sensitive messages (disaster warnings, search notices, etc.) need to be rapidly propagated among specific users or areas. Therefore, finding a path from the source to the destination with the shortest delay is the key problem. Taking the dissemination cost into consideration, we propose an efficient message dissemination strategy for minimizing delivery delay (MDMD) in DTNs, which first defines the user’s activeness according to the transiting habit among different PoIs. Furthermore, depending on the activeness, an optimal user in each PoI is selected to constitute the path with the shortest delay. Finally, the MDMD with inactive state (on the way between PoIs) is further proposed to enhance the applicability. Simulation results show that, compared with other dissemination strategies, MDMD achieves the lowest average delay, and the comparable average hopcounts, on the premise that the delivery ratio is guaranteed to be 100% by the sufficient simulation time.     

延迟／中断容忍网络发展研究

延迟／中断容忍网络（DTN）具有长延时、某一时刻不存在端到端链路或者链路频繁中断等特点,作为一种新型体系结构,近年来受到广泛关注与研究。介绍了DTN网络的研究现状,分析了其体系结构特点,详细描述了目前DTN关键技术包括网络协议、路由与安全机制方面的研究进展及面临的挑战,最后介绍了DTN在深空探测、军事通信等领域的应用,指出了DTN在未来通信网络发展中的作用。