位置关联的延迟容忍网络路由算法

提出一种位置关联的延迟容忍网络路由(LRR)算法。引入位置信息,将动态的节点间路由转化为静止的位置间路由,利用节点访问位置的概率信息计算并选择中继位置,无需获取全局的节点间概率信息。实验结果表明,与现有的延迟容忍网络路由算法相比,LRR算法具有较高的传输成功率和较小的平均传输延迟。     

DTN网络中Ferry节点的MSSL路由算法研究

在节点移动规律无法预知、连通性较差的延迟容忍网络中,针对DTN网络的Ferry节点自定位方案,能够有效提高网络中数据信息采集效率.该方案能够在节点移动过程中根据一个修正因子不断对Ferry的移动节点坐标进行调整,最后使坐标收敛到一个可用的范围.通过概率路由算法对Ferry节点的移动路线优化,使得Ferry节点能够在有限时间内最大限度地收集信息.实验证明,该方案通过合适的修正因子调整节点坐标,使路由算法具有良好的稳定性,在节点信息传输率、公平性和延迟性方面有良好的表现.     

延迟容忍网络中基于概率传递的可靠路由算法

针对延迟容忍网络中节点缓存受限引起大量消息被丢弃的问题,在概率路由算法的基础上,提出一种基于概率传递的可靠路由算法R PROPHET。该路由算法根据节点缓存中消息替换的历史情况评价节点的可靠性,以保证消息在可靠的节点间传输直至交付给目的节点。仿真结果表明,该算法能够减轻消息在节点间无效传递的情况,能够获得较高的消息交付率,并具有较低的通信开销。     

基于节点运动预测的社会性DTN高效路由

延迟容忍网络是一种缺乏持续连接的新型网络体系结构,采用存储-携带-转发的路由方式进行消息的转发.考虑到节点的特性及运动模式,基于分簇、社会网络的路由协议已成为近年来的一个研究热点.该文分析现有基于分簇、社会网络的路由算法的缺陷及社会网络的特点,提出了一种新型的混合路由算法CS-DTN(Clustering&Social Delay Tolerant Network):预测节点间的相遇概率并据此对节点进行分簇,簇内根据节点间相遇概率限定消息的副本数量,将消息以二分喷射的方式转发到更可能到达目的节点的中继节点;簇间对节点进行运动预测并结合节点的特性将消息不断地转发到更接近目的节点的中继节点.不同于已有的基于分簇、社会网络的路由算法,CS-DTN从多个角度结合了节点自身及节点间的特性,更考虑了对节点的运动预测,降低了由不必要的消息转发带来的资源浪费,同时也能更高效地将消息投递到目的节点.仿真结果表明CS-DTN较为明显地提升了消息的成功投递率并降低了消息的平均端到端延迟,在缓存足够的前提下,CS-DTN可以实现高达95%的投递率,而在资源有限的情况下也能获得80%以上的投递率.     

基于投递概率预测的DTN高效路由

在延迟容忍网络中,基于配额的多拷贝路由通过对消息拷贝数量的限制来控制开销,如何在控制开销的前提下尽可能提高消息投递成功率是其需要解决的关键问题.文中首先分析了提高消息投递成功率的配额分配策略,然后据此提出一种基于投递概率预测的配额路由算法.该路由算法根据节点的本地信息预测到其它节点的投递概率,在复制消息时,根据节点间投...     

基于委托转发技术的延迟容忍网络组播路由算法*

针对延迟容忍网络中的组播路由问题,提出了一种基于委托转发技术的组播路由算法。该算法是在详细分析组播路由设计需求的基础上,结合延迟容忍网络中节点移动特性,对委托转发技术中节点属性值和节点对转发标准进行重新设计。其节点属性值是面向组播会话的,节点对转发标准是动态适应网络状态的。仿真结果表明,相比于其他基于复制方式的组播路由算法,该算法具有更好的性能,尤其是在对网络开销的控制方面,因此,更适用于延迟容忍网络。     

基于节点紧密度中继转发的移动延迟容忍传感网传输算法

为解决移动延迟容忍传感网存在的时延突出、超宽带传输性能不佳等问题,提出了一种基于节点紧密度中继转发的移动延迟容忍传感网传输算法。引入邻域节点数量作为指标,以评估节点相遇概率,将节点相遇过程优化为邻域节点覆盖问题,以提升网络对节点相遇过程的感知能力。采用邻域节点重复覆盖数量作为判定依据,以评估节点运动性能,设计了基于紧密度的节点相遇感知机制,对节点运动活跃程度进行感知,增强节点对相遇过程的感知能力,有效提高下一跳目标节点的链接质量。基于马尔科夫评估机制,采用连接状态转移矩阵来评估节点链接概率,优选链接性能较高的节点作为下一跳节点,以优化源节点与目的节点间链路,增强链路对高带宽传输环境的适应能力。仿真结果表明,与基于分簇机制的传感网节能传输算法和基于低时延机制的传感网传输编码算法相比,所提算法具有更低的平均端对端时延和链路累计中断次数,以及更高的全网传输带宽。     

节点移动状态感知的社会化延迟容忍网络路由策略

针对延迟容忍网络因节点移动的时空特性变化导致网络性能下降的问题,建立半马尔可夫模型描述节点的移动过程,预测未来时刻节点处于某一地理区域的概率和节点间在未来时间段内的连接状态;同时,采用节点移动状态感知机制,对所预测结果的准确程度进行评估,进而提出了节点移动状态变化自适应的消息转发策略。仿真结果表明,基于节点移动状态感知的路由策略在网络交付率、开销比率及消息投递平均延时方面能够提升DTN的性能。     

EMRPP：一种DTMSN组播路由算法

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

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

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

容迟网络中的路由算法研究及比较

容迟网络是一类新型的网络,根据不同的网络环境,容迟网络呈现不同的形式。在该类网络中,由于其具有较大且不定的时延以及网络拓扑结构频繁分裂的特性,使得传统的路由协议不能得到有效的利用。为此,路由问题即给出适合于容迟网络中有效的路由协议就成为容迟网络中的关键问题。本文主要针对近年来所提出的多种路由算法,进行分类剖析比较,并给出当前路由协议存在的有待研究解决的问题。     

一种基于好友簇的社交网络中的时延容忍路由协议

社交网络是一种以便携式移动通信设备为节点的无线网络,通常由于其规模较大、结构复杂并且拓扑变化频繁,而成为时延容忍网络的一个典型应用场景。通过分析社交网络的特性,构建了基于好友群组的网络拓扑模型,并基于该模型,提出了一种基于簇结构的时延容忍路由协议。通过实验证明了该路由协议可以在保证较高路由性能的前提下有效控制由于数据副本传染造成的对网络资源的消耗。     

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.     

容迟网络中低资源消耗Advanced Epidemic路由算法

容迟网络（DTN）架构涵盖无线传感网络、Ad Hoc网络等,但其中高效节能的路由算法是一个亟须解决的问题。 与传统网络相比,DTN路由的主要目的是最大化消息送达的可能性。Epidemic算法简单但网络资源消耗较高。针对消息自身因素、连接机会、连接稳定性等方面进行改进,并在对仿真平台ONE的分析基础之上,对算法进行性能分析,总结出算法的优缺点。     

无线容迟与容断传感器网络研究*

在简要分析了无线容迟与容断传感器网络的基本特征之后,根据其网络结构,提出了无线容迟与容断传感器网络体系结构;然后介绍了典型的应用领域;最后指出了其进一步的研究方向。     

A reinforcement learning-based routing for delay tolerant networks

Delay Tolerant Reinforcement-Based (DTRB) is a delay tolerant routing solution for IEEE 802.11 wireless networks which enables device to device data exchange without the support of any pre-existing network infrastructure. The solution utilizes Multi-Agent Reinforcement Learning techniques to learn about routes in the network and forward/replicate the messages that produce the best reward. The rewarding process is executed by a learning algorithm based on the distances between the nodes, which are calculated as a function of time from the last meetings. DTRB is a flooding-based delay tolerant routing solution. The simulation results show that DTRB can deliver more messages than a traditional delay tolerant routing solution does in densely populated areas, with similar end-to-end delay and lower network overhead.     

一种考虑节点拥塞情况的DTN概率路由算法*

容迟网络是一种新型网络,其概率路由算法根据历史相遇频率对相遇概率进行计算与更新,通过相遇概率判断是否转发报文。当节点缓存受限时,在网络中采用概率路由算法使得节点很容易发生拥塞,对报文的传送产生影响。为了减小拥塞对概率路由算法的影响,提出了一种考虑节点拥塞情况的概率路由算法,将节点相遇的概率和节点拥塞的情况综合起来,得到一个报文的递交概率,降低了由于拥塞对网络性能的影响,提高了报文的递交率,减小了报文在缓存中排队等候的时间。仿真结果表明,与传统的概率路由算法相比,在改进后的概率路由算法中报文递交率显著提高,平均延迟也在降低。     

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.     

Cross-layer routing metrics for mesh networks: Current status and research directions

Despite efforts to improve the current IEEE 802.11 standard to fully optimize the physical layer, the performance of wireless mesh networks still depends on the routing process for a correct selection of routes. With regard to this question, several cross-layer routing metrics have been developed to improve wireless multi-hop mesh routing. This paper sets out a new taxonomy that can be used to help understand, classify and compare the state-of-the-art situation with regard to cross-layer routing metrics for wireless mesh networks. A simulation study has been carried out to evaluate the capability of the most recent and promising cross-layer routing metrics to support multimedia applications, such as Voice over IP. The evaluation of the routing metrics has been undertaken from three main perspectives: user perception, network performance, and routing stability. The simulation results show that the impact of routing metrics is more noticeable on the network and routing stability evaluation parameters than on the user-perception parameters. Furthermore, the results show that the routing metrics, the level of stability attained, and the application performance are interdependent. Finally, there is a discussion of the direction that future research might take with regard to some open issues in the design of routing metrics for wireless mesh networks.     

基于分簇的无线传感器网络节能路由算法研究与应用探讨简

随着科技进步和经济的进一步发展,无线网络信息技术逐渐成为网络通信技术的重要组成部分。为了适应时代要求,节能环保,提高无线传感器网络路由的工作效率,进行基于分簇的无线传感器网络节能路由算法研究与应用探讨就显得尤为重要。本文基于现代信息技术高速发展的条件下基于分簇的无线传感器网络节能路由新算法的研究背景,从人文社会学的角度对基于分簇的无线传感器网络节能路由算法的现状、存在的问题及产生原因进行了分析,并在进行基于分簇的无线传感器网络节能路由算法研究与应用探讨的必要性探讨的基础上,提出了加强基于分簇的无线传感器网络节能路由算法研究与应用探讨的具体对策,为创新无线网络传感器路由算法,实现无线路由的节能高效,促进无线网络路由技术的向前发展,提供了一些切实可行的指导性意见,为其指明了前行的正确方向。