节点密度感知的容迟网络路由协议*

为适应容迟网络的动态变化,提高路由性能,结合空间节点分布和节点度中心性,提出一种节点密度感知的容迟网络路由协议DAR。该协议引入移动模型的节点分布,通过感知节点当前所处位置的节点密度,动态选择在网络中传播的消息副本数量,并根据节点的度中心性选择中继和分配消息副本数量。仿真结果表明,DAR能够提高传输率、降低传输延迟,在一定程度上降低了资源消耗。     

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

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

Minimum delay algorithm based on time aggregated graph in DTN network

The DTN network has the characteristics of dynamic topology change,thus the routing algorithm of static network can not solve the routing problem of time-varying network,and can not support fast transmission of given tasks.The existing time-variant routing algorithm CGR (contact graph routing) uses the earliest contact to obtain the shortest path,but because of the influence of the order of the connectivity period,the CGR algorithm has low link utilization.To solve this problem,the method of finding the shortest path was proposed.Besides,in order to characterize the relation between the different connect periods of the same link,the time series of node cache was added to the time aggregated graph.Based on this,the end-to-end multi-path shortest delay routing algorithm for the known task requirements was proposed.Finally,the feasibility of the algorithm was proved by an example.     

天基信息网络的软件定义网络应用探析

现有各种空间、地面网络节点的互连互通,在一定程度上可满足特定应用需求,但由于各节点在空间、物理以及功能的局限,限制了天基信息高效传输、融合以及按需地应用。分析了天基信息网络的发展趋势,提出了网络架构构想,并对主要关键技术的研究方向进行了梳理。在空间核心节点上采用软件定义的多功能载荷平台,并基于软件定义网络( SDN)架构和空间容中断网络协议构建天基信息网络。通过资源虚拟化、处理多元化、应用无阻化的方式,保障天基信息网络适应信息按需定制和高效共享等应用需求。     

深空通信网络协议的发展与展望

分析了发展深空通信网络的需求,结合深空通信网络的特点,对深空通信网络协议体系和路由策略等的技术现状进行了综述,对其中的关键技术进行了分析,并对深空通信网络的未来发展进行了展望。     

容迟网络中传染路由协议优化

针对传染路由协议（EPI）的泛洪机制会造成容迟网络资源浪费的问题,提出将节点间的历史相遇信息引入传染路由协议的改进算法（EPI-HT）,以达到准确选择数据下一跳转发节点的目的。仿真结果表明,改进后的EPI-HT比EPI明显抑制了数据泛洪传输,可提高交付率,同时降低端到端时延。     

稀疏车辆Ad Hoc网络中基于受控机制的自适应Epidemic路由算法

针对传统Epidemic的性能缺陷,提出了基于控制机制的自适应Epidemic 路由(Ad-EPI)算法。Ad-EPI算法采用受控洪泛机制和信息副本控制等机制,并引入信息生存时间和自适应控制策略,在确保有较高到达率的条件下,取得了峰值传输控制、带宽资源占用、缓存利用和时延等方面的综合平衡。在VanetMobiSim仿真平台上,对Ad-EPI算法进行了VC++6.0编程实现和仿真,并与经典Epidemic算法进行了性能对比。仿真结果证实,Ad-EPI算法与Epidemic比较,付出较小的时延代价,却具有了带宽占用减少27.62%,峰值平均降低15.19%,缓存利用率提高92.14%等优势。Ad-EPI算法在上述三个方面的性能提升,具有工程意义和应用价值。     

容迟网络中基于演化博弈的合作行为

针对容迟网络中节点由于资源有限而表现出来的自私特性,为改善网络中节点的合作行为,进而提高网络的整体性能,提出一种基于演化博弈(EGT)的节点合作行为促进机制。首先,采用囚徒困境模型建立节点与其邻居博弈的收益矩阵;其次,基于度中心性定义节点的社会权威性;进一步地,在节点策略更新规则时考虑社会权威的影响,选择当前邻居中社会权威较高的节点进行模仿学习;最后,在机会网络环境仿真器上基于真实的动态网络拓扑数据进行仿真实验。仿真结果表明,与随机选择邻居的费米(Fermi)更新规则相比,考虑社会权威的更新规则能够更好地促进节点合作行为的涌现,进而提升网络的整体性能。     

Graph-based single-copy routing in delay tolerant networks

This paper presents a new graph-based single-copy routing method in delay tolerant networks (DTN). With time goes on in the networks, a DTN connectivity graph is constituted with mobility ofnodes and communication, and a corresponding greedy tree is obtained using a greedy algorithm inDTN connectivity graph. While there are some bad nodes such as disabled nodes or selfish nodes in delay tolerant networks, the nodes can choose the next proper intermediate node to transmit the mes- sage by comparing the location of neighboring nodes in the greedy tree. The single-copy routing method is very appropriate for energy-constrained, storage-constrained and bandwidth-constrained applications such as mobile wireless DTN networks. We show that delivery ratio is increased signifi- cantly by using the graph-based single-copy routing when bad nodes exist.     

From the Far Side of the Moon： Delay/Disruption- Tolerant Networking Communications via Lunar Satellites

Delay/Disruption-Tolerant Network- ing （DTN） originated from research on Interplanetary Internet and still today space appli- cations are the most important application field and research stimulus. This paper investigates DTN communications between the Earth and the far side of the Moon, by means of a lunar orbiter acting as relay. After an introductory part, the paper presents a comprehensive ana- lysis of the DTN performance that can be ac- hieved on the identified communication scen- ario. The focus is on the evaluation of the state- of-the-art ability of Interplanetary Overlay Network （ION）, the NASA DTN implementation of Bundle Protocol （BP） and Contact Graph Routing （CGR）, to meet the many challenges of the space communication scenario investigated （and more generally of a future interplay- netary Internet）： intermittent links, network partitioning, scarce bandwidth, long delays, dyn- amic routing, handling of high priority and emergency traffic, interoperability issues. A study of security threats and Bundle Security Protocol （BSP） countermeasures complete the work. The many results provided, confirm the essential role of DTN in future space communications.