A distributed QoS routing based on ant algorithm for LEO satellite network

Low Earth Orbit (LEO) satellites provide short round-trip delays and are becoming in- creasingly important. One of the challenges in LEO satellite networks is the development of specialized and efficient routing algorithms. To satisfy the QoS requirements of multimedia applications, satellite routing protocols should consider handovers and minimize their effect on the active connections. A distributed QoS routing scheme based on heuristic ant algorithm is proposed for satisfying delay bound and avoiding link congestion. Simulation results show that the call blocking probabilities of this al- gorithm are less than that of Shortest Path First (SPF) with different delay bound.     

一种新的GEO/LEO双层星座路由算法

针对多层卫星星座网络的复杂通信环境和特殊应用背景,提出一种新的基于优先级的星上分布式路由算法( PDRA)。 PDRA算法采用新的分层管理策略,根据信息重要程度设置优先级,在拓扑快照起始时刻进行路由计算与更新,信息传输过程中采用拥塞回避策略。理论分析和仿真验证表明,PDRA算法与现有典型卫星星座网络路由算法相比性能优越,能够很好地利用GEO/LEO双层星座特点,有较低的数据丢包率和较高的吞吐量,可有效避免链路拥塞,并能保证重要信息实时可靠传输。     

面向LEO卫星网络的高效路由算法

由于卫星星上处理以及存储能力有限,随着卫星网络的规模越来越庞大,迫切需要一种简单高效的路由算法.为此,提出了一种基于网络拥塞程度感知的路由策略(Network Congestion-Aware Routing Algorithm,NCARA).NCARA路由策略在网络处于非拥塞状态时采用Dijkstra算法寻路,网络拥...     

一种基于分时的LEO卫星网络无环路由算法

在分析传统卫星网络路由算法的基础上，提出一种基于分时的LEO卫星网络无环路由算法(DTRA)。针对卫星在各时间片之间进行路由表切换时可能出现的路由环问题，算法采用平滑路由表切换策略消除由于切换前后网络状态信息不一致而产生环路的可能性，保证分组在任何时刻都能够沿无环最短时延路径被转发。同时，DTRA也能够通过使用无环备份路径处理可能出现的链路拥塞、节点失败等突发情况。通过复杂性分析可知，算法只需较小的星上存储开销和星上处理开销，而无需星问通信开销。仿真实验结果也表明算法能够提供数据最优传送，具有较好的端到端时延性能。     

Joint multi-QoS and energy saving routing for LEO satellite network

Low earth orbit(LEO) satellite network provides global coverage and supports a wide range of services. However, due to the rapid changes and energy-limitation of satellites, how to meet the demand of the quality of service(QoS) from ground traffic and prolong the lifetime of LEO satellite network is the research emphasis of the investigator. Hence, a routing algorithm which takes into account the multi-QoS requirements and satellite energy consumption(QER) of LEO satellite network is proposed. Firstly, the satellite intimacy degree(SID) and the path health degree(PHD) are introduced to obtain the path evaluation function according to the energy consumption and queue state of the satellite. Then, the distributed routing QER is established through the path evaluation function and the idea of genetic algorithm(GA), which enables each satellite to adjust traffic and realizes the network load balancing. Simulation results show that QER performs well in terms of end-to-end delay, delay jitter, and system throughput.     

基于主动网络的多约束路由探测算法

本文提出了一种基于主动网络的多约束路由探测算法MAR(Multi-constrained Active Routing).与传统路由算法相比,MAR不仅能灵活地提供多种约束条件的服务质量保证,而且充分发挥了主动网络的可编程和自定制能力,允许用户根据业务要求和网络状况自定制约束条件和相关参数.通过仿真MAR算法在各种网络条件下的性能表明,MAR算法能够提高多约束条件寻路的成功率.     

Packet routing algorithm for LEO satellite constellation network

A novel distributed packet routing algorithm for Low Earth Orbit (LEO) satellite networks based on spiderweb topology is presented. The algorithm gives the shortest path with very low computational complexity and without on-board routing tables, which is suitable and practical for on-board processing. Simulation results show its practicability and feasibility.     

Multi-objective routing algorithms for low-earth orbit satellite network

The low-earth orbit (LEO) satellite network, composed of a large number of satellite nodes, is a hot research topic at present. Due to the characteristics of the large-scale LEO satellite network, such as many satellite nodes, short orbit period, large dynamic change of topology, and unstable link-state, its communication quality of service (QoS) requirements are difficult to meet. Aiming at this problem, various factors that may affect data transmission are first analyzed. The network link selection problem is modeled as a multi-constraint optimization decision problem, a routing mathematical model based on linear programming (LP) is designed, and its solution is solved. Aiming at the problem of limited onboard computing resources, a multi-object optimization Dijkstra algorithm (MOODA) is designed. The MOODA finds the optimal path according to the comprehensive performance of the link. It solves the problems of poor comprehensive QoS performance and the low degree of load balancing of the paths found by the Dijkstra algorithm. The simulation results show that the paths found by the two algorithms have good QoS, robustness, and load balancing performance.     

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.     

LEO/MEO卫星网络中运用自组网思想的动态路由算法

分析了基于星际链路的LEO/MEO路由算法的特点及卫星网与自组网的相同之处，借鉴了自组网路由协议中适用于卫星网的部分，提出了LEO/MEO卫星网络中运用自组网思想的动态路由算法，并对算法进行了模型仿真和性能分析，这种算法增强了卫星网络的自适应性，使网络具有自治性强，功能更全面、系统开销小、适用范围广等特点。     

Trust routing algorithm based on multiple decision factor theory in OSPF protocol

This paper presents a novel trust model based on multiple decision factor theory （MDFT） and a trust routing algorithm based on MDFT to exactly evaluate routing node trust and establish a trustworthy routing path. MDFT integrates four dimensional trust decision factors including behavior, state, recommend and node liveness to realize an exactly finer-grained trust evaluation. On the basis of MDFT, a trust routing algorithm is presented and validated in open shortest path first （OSPF） protocol. Simulation resuRs show that the algorithm can reflect the routing node trust accurately and has better dynamic response ability. Under the circumstance of existing deceptive nodes, the algorithm has better anti-deception performance and higher attack node detection rate than conventional algorithm.     

Load balancing multipath routing protocol for mass remote sensing data downlink in LEO satellite network

LEO satellite networks can provide seamless real-time data communication for all kinds of users,which developed rapidly in recent years.At the mean time,the massive payload data down-link system of space data sources,such as remote sensing satellites,still make use of traditional storage and forward mode.The real-time performance of space mission data will be improved effectively,if such satellites are connected to LEO satellite networks equipped with inter satellite links.However,it is necessary to design a specialized satellite network load balancing routing algorithm.Satellite parallel edge-disjoint multipath routing protocol (SPEMR) was designed for remote sensing satellite real-time down-link applications.OPNET simulation results indicate that the performance degradation index(DI) of the multipath scheme implemented by SPEMR is 0.32,which is only 32% of the TLR and 21% of the traditional DSP scheme.It is demonstrated that SPEMR has the better capability of transmitting massive data in real time.     

基于免疫--蚂蚁算法的多约束QoS路由选择

针对多约束QoS路由选择问题,将其转化为一个多约束赋权图最短路径问题,选择费用、带宽、时延、丢失率为QoS参数。借鉴人体免疫系统的适应能力和蚂蚁算法的全局寻优能力提出了一种新的融合算法即免疫——蚂蚁算法。免疫算法把目标函数和制约条件作为抗原,目标函数的优化解对应为抗体,使得求解过程的收敛方向得以控制;利用蚂蚁算法产生和更新抗体,抗体交叉、变异操作以及对与抗原亲和力高的抗体进行记忆,均能促进快速求解。实验结果表明:免疫——蚂蚁算法表现出了超越免疫算法和蚂蚁算法的优点,大幅度提高了路由选择的效率。     

LEO卫星移动通信系统空间网络技术分析

在分析LEO卫星星座移动通信系统空间段网络功能和特点的基础上,进行了星座网络路由和交换技术体制的分析和论证,提出了以支持话音业务为主的LEO卫星移动通信系统星座网络路由和交换技术方案。星座网络采用定长信元格式交换体制,采用动态拓扑离散化的拓扑快照静态路由策略。这种静态路由离线计算方式和定长信元交换相结合,提高了网络交换的效率和转发速率。     

基于蚂蚁算法的分布式QoS路由选择算法

本文基于蚂蚁的自组织能力描述了一种新的分布动态路由选择方法,针对当前通信网中存在的服务质量问题提出了QoS保证的分布式路由选择算法（DQRA）。DRQA能以并行的方式解决网络中呼叫的时延和带宽分配问题,避免了NP－完全问题,算法简单,易于实现,能有效地解决大型网络的负载平衡问题,本文选择了OPNET仿真环境对网络进行实时仿真,通过和最小代价算法的比较,进一步表明了算法的有效性。     

LEO卫星网络动态混合卫星切换策略

LEO卫星网络切换协议中的路由选择策略应当综合考虑路由本身优化性,路由计算复杂性,路由更新的信令代价。提出适合LEO网络卫星切换要求的动态混合路由选择策略(DHRS:DynamicHybridRouteSelection),即发生卫星切换时,由卫星节点根据移动终端用户切换前所处位置和切换前路由表等信息,为移动终端选择合适的路由。     

LEO星座中基于不完全信息的路由联盟博弈策略

针对LEO卫星网络在多跳转发数据包时流量分布不均问题,提出了一种基于不完全信息的最优收益路由联盟博弈算法.各节点协同联盟邻居节点,共同确定数据报文当前最优转发路径,从而分配和平衡节点间流量负载.仿真结果表明,与最短路径卫星路由DSP或智能路由TLR相比,本文算法的平均数据传输延迟降低了18.5%,节点流量负载均衡度提高了65.6%.     

浅析LEO卫星网络中的QoS路由问题

LEO卫星网络能够提供全球覆盖,为任何地点的用户提供适时应用服务。然而由于LEO的高速运动,LEO卫星网络的网络拓扑一直处于动态变化的过程中。文中首先分析了在这种动态变化的网络环境中QoS路由面临的新问题,接着提出了解决这些问题的几点考虑。     

基于遗传_蚁群算法的多QoS约束组播路由优化算法

提出了一种将遗传算法与蚁群算法融合的新算法,用以满足多QoS约束的组播路由优化。算法首先利用遗传算法生成若干组优化解,将其转换成蚁群算法的信息素初值,然后利用蚁群算法来求取满足QoS约束的最优解。仿真结果表明此算法是有效的,其性能优于文献[6]中算法。     

基于蚁群算法的自适应QoS路由优化

Internet网络规模的迅速增长和网络技术的不断完善，使得如何在满足QoS（quality of service）要求下进行路由选择成为路由算法研究的重要方向。提出了一种多约束条件下的自适应蚁群算法，该算法基于目标函数的信息素分配策略来自适应地调整蚂蚁的搜索行为，使多约束QoS路由优化问题得到了很好的解决。