Research of multi-path routing based on network coding in space information networks

A multi-path routing algorithm based on network coding is proposed for combating long propagation delay and high bit error rate of space information networks. On the basis of traditional multi-path routing, the algorithm uses a random linear network coding strategy to code data pack- ets. Code number is determined by the next hop link status and the number of current received packets sent by the upstream node together. The algorithm improves retransmission and cache mechanisms through using redundancy caused by network coding. Meanwhile, the algorithm also adopts the flow distribution strategy based on time delay to balance network load. Simulation results show that the proposed routing algorithm can effectively improve packet delivery rate, reduce packet delay, and enhance network performance.     

适于低轨卫星IP网络的单核共享树组播算法(英文)

为了解决低轨卫星IP网络中现有典型源组播算法的信道资源浪费问题,本文提出了一套单核共享树组播算法,即核心群合并共享树(CCST)和加权核心群合并共享树(w-CCST)算法。CCST 算法包括动态近似中心(DAC)选核方法和核心群合并组播路径构建方法。DAC方法专为周期、规律运动的低轨卫星网络提出,不需要复杂的星上计算。在核心群合并方法中,以核节点作为初始核心群,通过核心群和剩余组成员的最短路径方法逐步扩展直至整棵组播树构建完成,从而使得组播树的树代价最小,大大提高了网络的带宽利用率和组播传输效率。w-CCST 算法中所提出的加权因子可以调整树代价和端到端传播时延之间的折衷程度,因此,可以通过调整加权因子来适度增大树代价、降低端到端传播时延以支持某些端到端时延要求苛刻的实时组播业务。最后,与低轨卫星 IP 网络中典型算法进行了性能比较,仿真结果说明,CCST 算法的平均树代价比其它算法显著降低,w-CCST 算法的平均端到端传播时延小于 CCST 算法。     

Core-based Shared Tree Multicast Routing Algorithms for LEO Satellite IP Networks

A new core-based shared tree algorithm, viz core-cluster combination-based shared tree （CCST） algorithm and the weighted version （i.e. w-CCST algorithm） are proposed in order to resolve the channel resources waste problem in typical source-based multicast routing algorithms in low earth orbit （LEO） satellite IP networks. The CCST algorithm includes the dynamic approximate center （DAC） core selection method and the core-cluster combination multicast route construction scheme. Without complicated onboard computation, the DAC method is uniquely developed for highly dynamic networks of periodical and regular movement. The core-cluster combination method takes core node as the initial core-cluster, and expands it stepwise to construct an entire multicast tree at the lowest tree cost by a shortest path scheme between the newly-generated core-cluster and surplus group members, which results in great bandwidth utilization. Moreover, the w-CCST algorithm is able to strike a balance between performance of tree cost and that of end-to-end propagation delay by adjusting the weighted factor to meet strict end-to-end delay requirements of some real-time multicast services at the expense of a slight increase in tree cost. Finally, performance comparison is conducted between the proposed algorithms and typical algorithms in LEO satellite IP networks. Simulation results show that the CCST algorithm significantly decreases the average tree cost against to the others, and also the average end-to-end propagation delay ofw-CCST algorithm is lower than that of the CCST algorithm.     

混合SDN的多目标路由优化算法

为充分利用SDN(Software Defined Network,软件定义网络)节点的优势来优化网络性能,混合SDN的流量工程成为当前的研究热点,而路由优化是实现流量工程目标的重要策略之一.但是,当前混合SDN的流量工程中未考虑网络整体的负载均衡以及SDN节点的处理能力.针对上述问题,提出了一种多目标路由优化算法——MCS(Minimum Cost Sum,最小化代价和),综合考虑整个网络的传输延迟与链路利用率,同时保证SDN节点的处理能力满足实际约束,最终实现全网综合性能的最优化.实验结果表明,当网络整体负载较轻,MCS与现有的SOTE(SDN/OSPF Traffic Engineering,软件定义网络/开放最短路径优先流量工程)算法性能相近;而当网络负载加重时,MCS相比于SOTE,可将网络负载降低约9％,因此,MCS算法具有更高的优化能力.     

Reinforcement learning based dynamic distributed routing scheme for mega LEO satellite networks

Recently, mega Low Earth Orbit (LEO) Satellite Network (LSN) systems have gained more and more attention due to low latency, broadband communications and global coverage for ground users. One of the primary challenges for LSN systems with inter-satellite links is the routing strategy calculation and maintenance, due to LSN constellation scale and dynamic network topology feature. In order to seek an efficient routing strategy, a Q-learning-based dynamic distributed Routing scheme for LSNs (QRLSN) is proposed in this paper. To achieve low end-to-end delay and low network traffic overhead load in LSNs, QRLSN adopts a multi-objective optimization method to find the optimal next hop for forwarding data packets. Experimental results demonstrate that the proposed scheme can effectively discover the initial routing strategy and provide long-term Quality of Service (QoS) optimization during the routing maintenance process. In addition, comparison results demonstrate that QRLSN is superior to the virtual-topology-based shortest path routing algorithm.     

空间环境对超低轨道卫星轨迹规划的影响

针对超低轨道卫星受空间环境影响显著,对特定目标的轨迹规划难度大的问题,分析了经验大气模型中空间环境参数预报的预报误差以及空间环境参数预报对轨迹规划的影响.在目前空间环境参数预报的误差特性的基础上,建立了轨道控制量和空间环境参数双变量的轨迹评估规划的算法,通过轨迹规划评估后选取最优轨迹规划方案.该算法能够很好地适应空间环境参数的变化,降低空间环境参数预报误差带来的轨道控制风险.目前,该算法已在某超低轨道卫星的轨迹规划中得到成功应用,对需要考虑空间环境因素影响的较低轨道卫星的轨迹规划与控制具有一定的借鉴意义.     

网络中心战中服务质量选路的研究

介绍了网络中心战的概念和网络中心战架构中分布式无主节点网络体系结构,提出了网络中心战的业务需求模型。在综合分析网络资源状况和服务质量度量参数的基础上,结合网络中心战对实时性要求较高的特性,提出了以探测器到火力控制单元的网络时延作为服务质量选路标准。以3节点旅（团）级网络中心战演示实验平台为例,提出了一种计算网络中心战架构中端到端时延和获取路径信息的算法,开发了Server／Client架构计算程序,选取探测器到火力控制单元之间的最小网络时延的链路作为最优路径。解决了网络中心战中路由选择的关键问题,满足了网络中心战对时延的要求,并且可用于多业务点提供业务时最优路由的确定。     

基于最小跳数的无线传感器网络跨层设计

传统的严格分层参考模型无法实现对无线传感器网络资源的有效管理和运用,跨层设计是提高网络整体性能的一种有效方法。针对无线传感器网络能量、计算资源、存储资源和带宽资源有限的特点,提出一种基于最小跳数的路由层和MAC层的跨层协议设计方案。MAC层和路由层通过共享sensor节点到sink节点的最小跳数信息,在MAC层建立时间梯度,解决多个节点共享无线信道的问题;并在路由层建立路由表,解决路由选择问题。仿真结果表明,该方案在降低网络能耗的同时,在降低传输延迟,提高数据投递率方面也取得了良好的性能。     

一种面向航空集群的集中控制式网络部署方法

软件定义网络（SDN）的发展为机载网络构建提供了全新的设计思想。针对航空集群环境下控制平面的可扩展性问题,研究了混合层次式架构下的多控制器部署问题。首先,为实现对底层传输节点的弹性管控,通过扩展控制层级定义了本地控制器资源池。然后,为减少时间复杂度,实现本地控制器的快速部署,将传统的多控制器直接部署转化为子域划分和域内部署两个步骤,提出了基于节点密度排序的子域划分算法和基于改进多目标模拟退火的域内控制器部署算法。实验结果表明：与已有算法相比,所提算法在保证控制器的负载均衡基础上,可以有效减少网络控制链路的平均时延和平均失连率,同时时间复杂度更低,能够适用于大规模及动态网络环境下的控制器部署场景。     

基于QoS的卫星网络端-端通信可靠性分析

针对卫星网络动态环境下的高速信息传输、业务类型差异大等特点，提出一种综合考虑各业务QoS（Quality of Service）指标的可靠性分析方法。在卫星通信网络实际运行周期内，通信系统往往处于逐渐劣化过程中，导致卫星的节点和链路除正常工作和完全失效外，还存在部分失效的工作状态。本文在链路多状态基础上基于最小路集算法（Minimum Path Set Algorithms，MPSA）在不同业务的QoS指标（时延、带宽和丢包率）约束下，得出满足该业务QoS约束的所有可靠路径集，对路径集中路径进行不交化处理得到网络端-端可靠性。研究结果表明，不同业务由于QoS需求的差异导致网络端-端可靠性不同，所提算法与传统算法相比更加符合实际。由于实际卫星网络环境中会采用端-端并行多路径传输（Multi-Path Transmission，MTP），本文在上述研究的基础上，进一步对多路径的端-端可靠性进行了研究，结果表明多路径数据传输可靠性高。     

无线自组织网的可扩展性仿真

影响无线自组网可扩展性的因素很多,在随机移动模型和按需路由算法的前提下,提出了一个仿真模型,并利用NS2仿真工具对不同结点数组成的平面结构网络端到端时延和报文交付率进行了仿真,得出了AODV路由协议的可扩展性优于DSR协议的结论,并根据仿真结果推断出网络的规模不可能过大.     

控制器故障下的软件定义机载网络数据平面迁移策略

软件定义网络（SDN）为突破机载网络功能僵化所造成的瓶颈提供了新的契机。针对软件定义机载网络控制域内控制节点故障问题,提出一种基于时延和负载均衡的传输节点迁移策略,将故障控制节点所管控数据平面中的传输节点迁移至其他正常控制节点,恢复网络的正常管控。以迁移时延和负载均衡率为目标,建立迁移优化模型,提出基于时延和负载均衡的传输节点迁移算法,指导数据平面中的迁移动作,最终对两个性能目标进行综合权衡。实验结果表明,与距离就近迁移（DCM）策略和分布式逐跳（DHA）策略相比,所提策略在迁移时延和负载均衡率2个方面进行了合适的折中,避免出现迁移时延过大或控制节点负载失衡的情况,有效解决机载网络故障恢复问题。     

全球卫星导航星座网络协议体系与运行模式

针对全球卫星导航星座网络建设初期或论证阶段所涉及的网络体系结构、协议体系及相关组网等技术问题,开展了基于导航星座星间链路构建空间信息网络的技术研究,分别提出了由子网、接入网、骨干网等节点及其相互之间星间、星地无线链路构成的分层网络系统结构,设计了兼容遥控、遥测、测量与网络交互支持等业务的基于IP over CCSDS(基于空间数据系统咨询委员会标准的空间链路承载互联网协议业务)的协议体系,给出了全系统基本通信业务运行模式等。与传统高轨卫星通信系统相比,该星座网络具有高覆盖、低时延、随遇接入等优点,可实现星座导航性能与中低轨及地面用户通信性能的全方位提升,相关结果对我国全球卫星导航星座网络技术研究具有一定的参考意义。     

Traffic class dependent routing in ISL networks

This work addresses traffic class dependent (TCD) routing, using different link-cost functions, in the intersatellite link (ISL) network of a nongeostationary packet-switched satellite communication system. Three different traffic classes are introduced, each with its particular optimisation criteria. Performance analysis of TCD routing, in terms of average packet delay and average data throughput of a particular traffic class, is evaluated for homogeneous and nonhomogeneous traffic scenarios using a specifically developed simulation model of the ISL network.     

基于移动Ad-hoc网络的QoS路由算法的研究

基于AODV(Ad—hoc 0n Dem and Vector)协议草案,再对助—hoc网络的QoS问题进行了深入的探讨和研究后,提出了一种“伴随式”QoS路由算法,该新算法能够适用于带有QoS业务要求的网络。并将该新算法与G reedy算法进行了比较分析,仿真结果说明新算法降低了控制消息的增加比例,并且具有较高的源节点与目的节点的连通率和较低的路径传输的延时抖动。     

A feedback-retransmission based asynchronous frequency hopping MAC protocol for military aeronautical ad hoc networks

Attacking time-sensitive targets has rigid demands for the timeliness and reliability of information transmission, while typical Media Access Control (MAC) designed for this application works well only in very light-load scenarios; as a consequence, the performances of system throughput and channel utilization are degraded. For this problem, a feedback-retransmission based asynchronous FRequency hopping Media Access (FRMA) control protocol is proposed. Burst communication, asynchronous Frequency Hopping (FH), channel coding, and feedback retransmission are utilized in FRMA. With the mechanism of asynchronous FH, immediate packet transmission and multi-packet reception can be realized, and thus the timeliness is improved. Furthermore, reliability can be achieved via channel coding and feedback retransmission. With theories of queuing theory, Markov model, packets collision model, and discrete Laplace transformation, the formulas of packet success probability, system throughput, average packet end-to-end delay, and delay distribution are obtained. The approximation accuracy of theoretical derivation is verified by experimental results. Within a light-load network, the proposed FRMA has the ability of millisecond delay and 99% reliability as well as outperforms the non-feedback-retransmission based asynchronous frequency hopping media access control protocol.     

Oscillation suppression for traffic class dependent routing in ISL network

Adaptive per-hop routing in the intersatellite link (ISL) network of a packet-switched, nongeostationary satellite system is addressed. In particular, a traffic class dependent (TCD) routing is proposed with different optimization criteria for different traffic classes. Furthermore, for delay sensitive traffic, performance is enhanced by an exponential smoothing link-cost function, which reduces traffic load oscillations in the network. The performance of the proposed procedures is evaluated in two different traffic scenarios using an appropriate simulation model     

民用飞机航电数据网络带宽资源分配优化设计

民用飞机航电数据网络在设计过程中,通过对带宽资源的合理分配,来满足网络成员系统的数据传输需求.而在设计过程中,存在因网络带宽需求分布的非均匀性等因素造成的局部带宽资源不足的问题,因此需要在初步带宽资源分配结果上进行局部优化设计.提出一种通过网络带宽资源使用率最高的链路和端系统进行识别,以及进行针对性物理链路连接关系调整...     

Cooperative Routing for Maximizing Network Performance of Wireless Networks

To greatly increase spectral efficiency and improve network performance in wireless networks,a novel cooperative routing algorithm,namely maximum throughput cooperative routing(MTCR) algorithm,is proposed.According to cooperative link model,throughput analysis is presented to evaluate performance improvement in the process of exploiting cooperative commu-nication from physical layer to higher layer.Taking the throughput improvement as performance metric,a cooperative relay se-lection scheme is developed.Finally,based on the route constructed by adaptive forwarding cluster routing(AFCR) algorithm,each node on the route selects the optimum cooperative node from all the potential cooperative nodes to construct the coopera-tive link with maximum throughput so that cooperative route with maximum network throughput from source to destination can be set up.Simulation results show that compared with the noncooperative routing algorithm and minimum power selection de-code-and-forward(MPSDF) routing algorithm,the proposed algorithm can obviously improve network throughput in the pres-ence of low transmission power,large number of nodes and high spectral efficiency.     

ELGR: An Energy-efficiency and Load-balanced Geographic Routing Algorithm for Lossy Mobile Ad Hoc Networks

Geographic routing is a highly active area of research in mobile ad hoc networks (MANETs) owing to its efficiency and scalability. However, the use of simple greedy forwarding decreases the packet reception rate (PRR) dramatically in unreliable wireless environments; this also depresses the network lifetime. Therefore, it is important to improve delivery performance and prolong MANET lifetime simultaneously. In this article, a novel geographic routing algorithm, named energy-efficiency and load-loalanced geographic routing (ELGR), is presented for lossy MANETs. ELGR combines energy efficiency and load balance to make routing decisions. First, a link estimation scheme for the PRR is presented that increases the network energy efficiency level. Second, a learning method is proposed to adaptively sense local network loads, allowing enhanced whole network load balance. The results of a simulation show that ELGR performs better than several other geographic routing algorithms; in particular it extends network lifetime by about 20%, with a higher delivery ratio.