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

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

一种GEO/LEO卫星网络中的路由优化策略

空间信息网络具有全球覆盖的能力,是能够保证高速率传输和较宽的带宽,支持灵活的、大规模的网络结构。GEO/LEO双层卫星网络由于具有覆盖关系简单、实施复杂性低等优势成为构建多层卫星网络的新思路。基于卫星群和卫星簇的分层结构,提出了一种GEO/LEO卫星网络中的路由优化策略,该策略主要是通过引入优化卫星路由表和路由信息数据报来实现的。最后的复杂性分析表明该策略在降低网络的星上存储开销和星间通信开销方面具有较高的优越性。     

卫星网络路由技术现状及展望

与地面固定通信网络不同,卫星网络的节点高度动态性、有限的星上处理能力和网络拓扑周期性变化的特点给卫星互联网的路由协议与算法设计带来了新的挑战。该文系统梳理了学术界针对卫星网络所提出的路由技术,提出了卫星路由技术未来的发展方向。首先介绍了卫星网络架构和目前在卫星通信系统上应用的主要路由协议,并且简要介绍了卫星光通信网络的路由问题;其次,根据卫星节点的管理方式以及路由表生成方式将路由算法分类为集中式卫星路由、分布式卫星路由以及混合式卫星路由,详细介绍了各类卫星路由方法的代表性成果并总结其优化目标和适用场景;接着,总结了不同卫星网络场景和网络需求下如何选择合适的卫星路由算法;最后,阐述目前卫星路由技术面临的挑战以及未来的发展趋势,并在附录中介绍了当前主流的卫星网络仿真平台。     

LEO卫星网络中一种安全的按需路由协议

低地球轨道(LEO)卫星网络的路由是当前卫星通信领域的研究热点,其安全问题也日益受到研究人员的重视。本文通过分析LEO卫星网络按需路由协议面临的安全威胁,使用基于身份的签密方案,提出了一种适合卫星网络拓扑特性的安全的按需路由协议。针对协议的密码算法处理时间开销较大的特点,设计了自适应的概率性延迟验证机制,能够降低协议的平均路由建立时间。安全性分析和仿真实验结果表明,该协议能够抵抗多种外部攻击行为,以有限的路由建立时间和路由开销为代价,保证了稳定的包传输率。      

基于时延调节的移动自组网多路径路由策略

针对AOMDV协议的多路径切换机制,提出了一种基于时延调节的移动自组网多路径路由策略,根据目的端获得的分组时延规律主动切换路径,达到负载均衡的目的。仿真实验结果表明,能在一定程度上降低路由开销以及延长网络生存时间。     

移动卫星网络中基于最小费用的切换算法

对于移动卫星网络,合理的星地链路切换方案需要在保证最小切换时延的同时,能够最优地使用网络资源。该文通过引入业务的中断概率和费用模型,给出了切换过程中重路由的最优触发条件,提出一种基于最小费用的切换(SMCH)算法。该算法可在保证切换业务通信的连续性和时延等指标不被破坏的基础上,通过适当的触发重路由来降低切换费用。仿真表明该算法在保证切换业务的QoS,降低切换费用以及适应性、灵活性等方面都优于同类切换算法。     

卫星网络基于时空的动态IP路由

研究宽带卫星网络的拓扑结构和路由策略，设计了一个基于时空的分布式路由算法，其计算复杂性为O(1)。针对卫星移动性进行的仿真结果表明新算法能够有效确定最小时延传播路径。     

QoS路由的多路径算法

本文分析了预约网络中采用多路径路由传送数据以保证应用的带宽要求、和/或端到端时延限制条件.文中提出的路由方案综合了单路径和多路径路由的优点:通过多路径路由以降低呼叫阻塞率,同时侧重单路径路由以降低协议开销.在考察网络中的四个一般性问题基础上,提出了启发式算法.     

一种用于混合通信网机会式路由选择算法

传统的路由协议都是针对特定的有线或无线网络,仅仅考虑路由的建立过程、路由建立过程中的收敛速度、路由维护的网络开销及路由动态更新时环路的避免等性能。将其用于有线无线混合传输网络会导致较低系统性能。机会式路由选择算法综合分析了无线链路状态和网络时延的影响,得出了各路径优先级的计算表达式,在路由选择时根据各条路径的优先级来选择路由。仿真结果表明,与传统路由算法相比较,该算法能够提高系统吞吐量和减少系统传输时延。     

一种高能效低时延的LLN路由修复算法

由于低功耗有损网络(LLN)中无线链路的不稳定性和有损性,外部环境的干扰极易导致网络出现故障,从而严重影响网络性能,而LLN网络中现有路由修复算法存在控制开销冗余和修复时延较大等问题。为此,提出了一种高能效低时延的LLN路由修复算法(EELDR-RPL)。该算法通过采用“零额外控制开销通告链路故障及邻居节点信息”机制,使得链路故障节点的子节点能够及时获知链路故障以及链路故障节点的邻居情况;通过采用“自适应调整节点网络深度值”机制,使得链路故障节点能够快速地重新接入网络;通过采用“链路故障节点子节点自适应切换”机制,能够达到优化网络拓扑的目的。仿真结果表明,与现有路由修复算法相比,EELDR-RPL算法能够有效地降低路由修复时延和减少控制开销。     

A Time and Space-based Dynamic IP Routing in Broadband Satellite Networks

1　IntroductionSatellitenetworksconsistofroutingswitchingdevicescarriedbysatellites,Inter SatelliteLinks/Inter Ground SatelliteLinks (ISL/IGL) ,gatewaysontheground ,stationaryandmobileusers.Theyhaveglobalvisibilityandveryflexiblebandwidth on demandcapabilities.Alsotheycan provideaccessservicesforallkindsofstationaryormobiledevicesinvolvedintheground ,seaandskyandcarryvoice,data,videoandbroadbandmultimediaapplicationservices.Becauseofminutepropagationdelays (ap proximately 5ms) ,theLowEar…     

机会网络中一种低缓存占用的Epidemic 路由算法

由于机会网络中节点的缓存空间有限,容易导致数据分组丢失和时延增加。针对部分数据分组已经到达目的节点,但是该类分组仍在网络中其它节点存储、传输问题,提出一种低缓存占用的Epidemic路由算法(RBER)。该算法通过SV运算进行节点缓存清理,从而避免这类冗余数据分组对缓存的占用。理论分析和仿真结果表明,该机制能够降低网络开销、数据分组的发送和缓存占用。     

Ad Hoc网络中一种随机化分布式QoS路由算法

针对无线移动Ad Hoc网络(Mobile Ad Hoc Network,MANET),采用一种基于随机化分布式QoS路由算法RBAD(Random-Based Distributed QoS Routing Algorithm),该算法依据信道条件和业务量优化分组在多条路径上的路由,及寻找路由和存储路由表的代价,通过对结点排序,达到实现网络平均时延和平均消息复杂度最小的目标。仿真结果表明该算法能够以较小的路由消息开销获得较高的路由成功率,此外,算法具有可扩展性,可以应用于较大规模的Ad Hoc网络。     

Secure routing in MANETs using local times

We present a new approach to secure routing in mobile ad-hoc networks based solely on the relative transmission times of overhead packets. Unlike most previous works aimed at securing route computation, we eliminate a key vulnerability (explicitly stated routing metrics) altogether. We introduce the Secure Time-Ordered routing Protocol (STOP), which uses time-based orderings to ensure the establishment of multiple loop-free paths between a source and a destination. STOP is the first routing protocol to use performance-based path selection without source routing, path vectors, or complete topology information, making it far more efficient that similar approaches. We prove that adversaries cannot take any action to manipulate the time-based ordering so as to unfairly gain control of the forwarding topology and, by design, nodes which drop data packets will be avoided. Furthermore, at convergence, traffic load is evenly distributed over the well-performing paths, so adversaries cannot gain complete control over the data flow through temporary good behavior. Simulation results show that the countermeasures in STOP are effective against a variety of attacks from independent and colluding adversaries, and that this improved security does not come at the expense of routing performance.     

基于网络编码的机会网络高效路由算法

针对采用Epidemic机制的机会网络路由算法在数据分组传送阶段存在通信冗余的问题,提出了一种基于网络编码的高效路由算法--NCBER(network-coding-based epidemic routing）。NCBER在传送数据分组的过程中使用主动异或网络编码和多播,并取消了 Request（请求）控制分组,从而减少数据分组的转发次数和控制分组数量,降低网络开销,缩短分组传输时延。理论分析和仿真结果表明,NCBER 算法在网络开销和数据分组端到端时延性能方面优于经典的Epidemic路由算法及其改进算法MRRMR（message redundancy removal of multi-copy routing）,并且使数据传送成功率保持在100%。     

QoS routing based on mobile agent for LEO satellite IP networks

Current quality of service (QoS) routing schemes for low earth orbit (LEO) satellites IP networks either neglect the varying population density or fail to guarantee end-to-end delay. As a remedy, QoS routing protocol based on mobile agent (QoSRP-MA) is proposed. QoSRP-MA is a source-based routing protocol. Once connection requests arrive, QoS mobile agents are dispatched from ingress satellite to explore routes, which migrate using satellite routing tables. Upon arriving in egress satellite, QoS mobile agents migrate back towards ingress satellite to reserve bandwidth. To construct satellite routing tables, load balancing routing algorithm based on mobile agent (LBRA-MA) is presented. In LBRP-MA, at regular intervals mobile agents launched on all satellites migrate autonomously to evaluate path cost and update routing tables. Moreover, path cost between source and destination is evaluated considering satellite geographical position as well as inter-satellite link (ISL) cost. Furthermore, ISL congestion index is considered to update routing table. Through simulations on a Courier-like constellation, it shows that QoSRP-MA can achieve guaranteed end-to-end delay bound with higher throughput, lower connection failing ratio and signaling overhead compared to high performance satellite routing (HPSR) scheme.     

基于流的无线网络编码

针对无线链路的不可靠性和物理层的广播特性,将网络编码与无线网络相结合,提出一种基于流的无线网络编码算法——FNC。该算法在先验参考路径的基础上,充分利用每个节点处的路由表项,探测编码机会,在有编码机会的节点对满足编码条件的数据流进行网络编码,达到提高网络吞吐量的目的。仿真结果表明：FNC有效提高了整个网络的吞吐量,改善了网络性能。     

A Bluetooth Routing Protocol Using Evolving Fuzzy Neural Networks

In this paper, a routing protocol which utilizes the characteristics of Bluetooth technology is proposed for Bluetooth-based mobile ad hoc networks. The routing tables are maintained in the master devices and the routing zone radius for each table is adjusted dynamically by using evolving fuzzy neural networks. Observing there exists some useless routing packets which are helpless to build the routing path and increase the network loads in the existing ad hoc routing protocols, we selectively use multiple unicasts or one broadcast when the destination device is out of the routing zone radius coverage of the routing table. The simulation results show that the dynamic adjustment of the routing table size in each master device results in much less reply time of routing request, fewer request packets and useless packets compared with two representative protocols, Zone Routing Protocol and Dynamic Source Routing.     

Multipath inter-domain routing for named data networking

To facilitate content retrieval among NDN domains,a multipath inter-domain routing for named data networking(MIRNDN)was proposed.Under MIRNDN,an AS(autonomous system)maintained merely the routing state of content reachable from its own network or from its customers’ networks and aggregated routing information to mitigate routing scalability issue; “valley free”routing policy was applied to guide Interest packets that solicit content unreachable from the AS’s own network nor from its customers’ networks to explore matching data packets via multiple paths,and NDN’s requests aggregation,in-network caching and adaptive forwarding optimized such exploration; the reachability information of content from multiple paths was collected to support Interest multipath forwarding.The properties of FIB size and the convergence time and communication cost of routing update under MIRNDN were analyzed in theory.The experimental results in the AS level topology of current Internet validates that MIRNDN mitigates the scalability issue of NDN inter-domain routing,has relative short convergence time and moderate communication cost for routing update,and effectively reduces unnecessary Interest forwarding.     

一种利用跨层优化策略选择中继的协作路由算法

该文提出了一种新的中继选择的协作路由算法,该算法利用网络的路由包获得信道的信息,通过分布式计算从候选中继集合中选择出一个最佳中继转发数据。在分层的无线网络中,中继选择的实现包括了时间同步和跨层优化等。仿真结果表明,相对于DSDV协议,该文所提出的算法有效地提高了数据包的递交率并有效地降低了网络的时延。