A novel QoS routing protocol for LEO and MEO satellite networks

The rapid advance of communication and satellite technology pushes broadband satellite networks to carry on multimedia traffic. However, the function of onboard routing cannot be provided in existing satellite networks with inter‐satellite links, and quality of service (QoS) of satellite networks cannot be reliably guaranteed because of great difficulties in processing of long distance‐dependent traffic. In this paper, a two‐layered low‐Earth orbit and medium‐Earth orbit satellite network (LMSN) is presented. A novel hierarchical and distributed QoS routing protocol (HDRP) is investigated, and an adaptive bandwidth‐constrained minimum‐delay path algorithm is developed to calculate routing tables efficiently using the QoS metric information composed of delays and bandwidth. The performance of LMSN and HDRP is also evaluated through simulations and theoretical analysis. Copyright © 2007 John Wiley & Sons, Ltd.     

MLSR: a novel routing algorithm for multilayered satellite IPnetworks

Several IP-based routing algorithms have been developed for low-Earth orbit (LEO) satellite networks in recent years. The performance of the satellite IP networks can be improved drastically if multiple satellite constellations are used in the architecture. A multilayered satellite IP network is introduced that consists of LEO, medium-Earth orbit (MEO) and geostationary Earth orbit (GEO) satellites. A new multilayered satellite routing (MLSR) algorithm is developed that calculates routing tables efficiently using the collected delay measurements. The performance of the multilayered satellite network and MLSR is evaluated through simulations and analysis     

Next‐generation global satellite system with mega‐constellations

Mega satellite constellations in low earth orbit (LEO) will provide complete global coverage; rapidly enhance overall capacity, even for unserved areas; and improve the quality of service (QoS) possible with lower signal propagation delays. Complemented by medium earth orbit (MEO) and geostationary earth orbit (GEO) satellites and terrestrial network components under a hybrid communications architecture, these constellations will enable universal 5G service across the world while supporting diverse 5G use cases. With an unobstructed line‐of‐sight visibility of approximately 3 min, a typical LEO satellite requires efficient user terminal (UT), satellite, gateway, and intersatellite link handovers. A comprehensive mobility design for mega‐constellations involves cost‐effective space and ground phased‐array antennas for responsive and seamless tracking. An end‐to‐end multilayer protocol architecture spanning space and terrestrial technologies can be used to analyze and ensure QoS and mobility. A scalable routing and traffic engineering design based on software‐defined networking adequately handles continuous variability in network topology, differentiated user demands, and traffic transport in both temporal and spatial dimensions. The space‐based networks involving mega‐constellations will be better integrated with their terrestrial counterparts by fully leveraging the multilayer 5G framework, which is the foundational feature of our hybrid architecture.     

Performance of delay‐sensitive traffic in multi‐layered satellite IP networks with on‐board processing capability

In this article, performance of delay‐sensitive traffic in multi‐layered satellite Internet Protocol (IP) networks with on‐board processing (OBP) capability is investigated. With OBP, a satellite can process the received data, and according to the nature of application, it can decide on the transmission properties. First, we present a concise overview of relevant aspects of satellite networks to delay‐sensitive traffic and routing. Then, in order to improve the system performance for delay‐sensitive traffic, specifically Voice over Internet Protocol (VoIP), a novel adaptive routing mechanism in two‐layered satellite network considering the network's real‐time information is introduced and evaluated. Adaptive Routing Protocol for Quality of Service (ARPQ) utilizes OBP and avoids congestion by distributing traffic load between medium‐Earth orbit and low‐Earth orbit layers. We utilize a prioritized queueing policy to satisfy quality‐of‐service (QoS) requirements of delay‐sensitive applications while evading non‐real‐time traffic suffer low performance level. The simulation results verify that multi‐layered satellite networks with OBP capabilities and QoS mechanisms are essential for feasibility of packet‐based high‐quality delay‐sensitive services which are expected to be the vital components of next‐generation communications networks. Copyright © 2007 John Wiley & Sons, Ltd.     

In‐line interference mitigation techniques for spectral coexistence of GEO and NGEO satellites

The interest towards the deployment of Low Earth Orbit (LEO)/Medium Earth Orbit (MEO) satellite systems in several frequency bands is increasing due to the requirement of low latency for real‐time systems and high demand of broadband data. When the number of usable Non‐Geostationary (NGEO) satellites, that is, LEO/MEO in space, increases, the frequency coexistence between the NGEO satellite systems with the already existing geostationary (GEO) satellite networks becomes a requisite. In this context, it is crucial to explore interference mitigation techniques between GEO and NGEO systems in order to allow their spectral coexistence. More specifically, in the coexistence scenario of GEO and NGEO satellite networks, in‐line interference may be a serious problem, especially in the equatorial region. In this paper, we provide several frequency sharing studies in the context of the coexistence of an NGEO satellite link with another NGEO/GEO satellite link. Furthermore, we carry out interference analysis between GEO and MEO satellite systems considering the case of the O3b satellite system and propose an adaptive power control technique for both the uplink and downlink scenarios in order to mitigate the in‐line interference. Moreover, we suggest several cognitive solutions for mitigating the in‐line interference and provide future research issues. Copyright © 2014 John Wiley & Sons, Ltd.     

Bandwidth‐guaranteed QoS routing of multiple parallel paths in CDMA/TDMA ad hoc wireless networks

This paper investigates the issues of QoS routing in CDMA/TDMA ad hoc networks. Since the available bandwidth is very limited in ad hoc networks, a QoS request between two nodes will be blocked if there does not exist a path that can meet the QoS requirements, even though there is enough free bandwidth in the whole system. In this paper, we propose a new scheme of using multiple paths between two nodes as the route for a QoS call. The aggregate bandwidth of the multiple paths can meet the bandwidth requirement of the call and the delays of these paths are within the required bound of the call. We also propose three strategies by which to choose a set of paths as the route, namely, shortest path first (SPF), largest bandwidth first (LBF), and largest hop‐bandwidth first (LHBF). Extensive simulations have been conducted to evaluate the performance of the three strategies in comparison with a traditional single path routing algorithm. The simulation results show that the proposed multiple paths routing scheme significantly reduces the system blocking rates in various network environments, especially when the network load is heavy. Copyright © 2005 John Wiley & Sons, Ltd.     

Bandwidth‐satisfied routing in multi‐rate MANETs by cross‐layer approach

Previous quality‐of‐service (QoS) routing protocols in mobile ad hoc networks (MANETs) determined bandwidth‐satisfied routes for QoS applications. Since the multi‐rate enhancements have been implemented in MANETs, QoS routing protocols should be adapted to exploit them fully. However, existing works suffer from one bandwidth‐violation problem, named the hidden route problem (HRP), which may arise when a new flow is permitted and only the bandwidth consumption of the hosts in the neighborhood of the route is computed. Without considering the bandwidth consumption to ongoing flows is the reason the problem is introduced. This work proposes a routing protocol that can avoid HRP for data rate selection and bandwidth‐satisfied route determination with an efficient cross‐layer design based on the integration of PHY and MAC layers into the network layer. To use bandwidth efficiently, we aim to select the combination of data rates and a route with minimal bandwidth consumption to the network, instead of the strategy adopted in the most previous works by selecting the combination with the shortest total transmission time. Using bandwidth efficiently can increase the number of flows supported by a network. Copyright 2010 John Wiley & Sons, Ltd.     

QoS‐aware routing and power control algorithm for multimedia service over multi‐hop mobile ad hoc network

This paper presents a QoS (quality of service) aware routing and power control algorithm consuming low transmission power for multimedia service over mobile ad hoc network. Generally, multimedia services need stringent QoS over the network. However, it is not easy to guarantee the QoS over mobile ad hoc network since its network resources are very limited and time‐varying. Furthermore, only a limited amount of power is available at mobile nodes, which makes the problem more challenging. We propose an effective routing and power control algorithm for multimedia services that satisfies end‐to‐end delay constraint with low transmission power consumption. The proposed algorithm supports the required bandwidth by controlling each link channel quality over route in a tolerable range. In addition, a simple but effective route maintenance mechanism is implemented to avoid link failures that may significantly degrade streaming video quality. Finally, performance comparison with existing algorithms is presented in respect to traditional routing performance metrics, and an achievable video quality comparison is provided to demonstrate the superiority of the proposed algorithm for multimedia services over mobile ad hoc network. Copyright © 2010 John Wiley & Sons, Ltd.     

ATM-based routing in LEO/MEO satellite networks with intersatellitelinks

An asynchronous transfer mode (ATM)-based concept for the routing of information in a low Earth orbit/medium Earth orbit (LEO/MEO) satellite system including intersatellite links (ISLs) is proposed. Specific emphasis is laid on the design of an ATM-based routing scheme for the ISL part of the system. The approach is to prepare a virtual topology by means of virtual path connections (VPCs) connecting all pairs of end nodes in the ISL subnetwork for a complete period in advance, similar to implementing a set of (time dependent) routing tables. The search for available end-to-end routes within the ISL network is based on a modified Dijkstra (1959) shortest path algorithm (M-DSPA) capable of coping with the time-variant topology. With respect to the deterministic time variance of the considered ISL topologies, an analysis of optimization aspects for the selection of a path at call setup time is presented. The performance of the path search in combination with a specific optimization procedure is-by means of extensive simulations-evaluated for example LEO and MEO ISL topologies, respectively     

基于低轨卫星的北斗反射事件仿真分析

导航卫星反射事件的空间分布和数量是星载反射信号应用的综合评估指标之一, 北斗系统作为我国独立研发的导航系统, 与其他系统相比, 其反射事件的空间分布和数量具有独特性.针对上述问题, 通过研究北斗系统空间星座的特征, 模拟生成了完整的北斗系统空间星座, 给出了反射事件空间分布和数量的分析步骤, 利用导航卫星反射信号的基本几何关系推导了镜面反射点存在性判决条件.从机理上分析了北斗反射事件的影响因素, 在此基础上仿真分析了低轨卫星轨道高度、倾角、升交点赤经以及近地点角距对北斗系统同步地球轨道、倾斜地球轨道和中地球轨道卫星反射事件空间分布和数量的影响.结果表明:低轨卫星高度、升交点赤经只影响北斗反射事件数量, 而不影响分布, 轨道倾角对数量和分布都有显著影响, 轨道近地点角距无显著影响.最后, 总结给出了对地观测需合理设计低轨卫星轨道参数的指导性结论.       

A resource‐tuned QoS multicast routing protocol

This paper presents a novel framework for quality‐of‐service (QoS) multicast routing with resource allocation that represents QoS parameters, jitter delay, and reliability, as functions of adjustable network resources, bandwidth, and buffer, rather than static metrics. The particular functional form of QoS parameters depends on rate‐based service disciplines used in the routers. This allows intelligent tuning of QoS parameters as functions of allocated resources during the multicast tree search process, rather than decoupling the tree search from resource allocation. The proposed framework minimizes the network resource utilization while keeping jitter delay, reliability, and bandwidth bounded. This definition makes the proposed QoS multicast routing with resource allocation problem more general than the classical minimum Steiner tree problem. As an application of our general framework, we formulate the QoS multicast routing with resource allocation problem for a network consisting of generalized processor sharing nodes as a mixed‐integer quadratic program and find the optimal multicast tree with allocated resources to satisfy the QoS constraints. We then present a polynomial‐time greedy heuristic for the QoS multicast routing with resource allocation problem and compare its performance with the optimal solution of the mixed‐integer quadratic program. The simulation results reveal that the proposed heuristic finds near‐optimal QoS multicast trees along with important insights into the interdependency of QoS parameters and resources.     

Two algorithms for multi‐constrained optimal multicast routing

Multimedia applications, such as video‐conferencing and video‐on‐demand, often require quality of service (QoS) guarantees from the network, typically in the form of minimum bandwidth, maximum delay, jitter and packet loss constraints, among others. The problem of multicast routing subject to various forms of QoS constraints has been studied extensively. However, most previous efforts have focused on special situations where a single or a pair of constraints is considered. In general, routing under multiple constraints, even in the unicast case is an NP‐complete problem. We present in this paper two practical and efficient algorithms, called multi‐constrained QoS dependent multicast routing (M_QDMR) and (multicasting routing with multi‐constrained optimal path selection (M_MCOP)), for QoS‐based multicast routing under multiple constraints with cost optimization. We provide proof in the paper that our algorithms are correct. Furthermore, through extensive simulations, we illustrate the effectiveness and efficiency of our proposals and demonstrate their significant performance improvement in creating multicast trees with lower cost and higher success probability. Copyright © 2003 John Wiley & Sons, Ltd.     

弱信号下“北斗”接收机NH码的快速捕获

在全球卫星导航系统(GNSS)中,延长相关累积时间可以有效提高弱信号捕获灵敏度,但是"北斗"中圆地球轨道/倾斜地球同步轨道(MEO/IGSO)卫星信号的捕获性能很大程度上受到二次编码(NH)码的影响:调制NH码的信号在每一个码元周期(1 ms)内都有可能发生跳变,对相关累积时间造成一定影响,从而会导致系统捕获灵敏度的下降.为此,提出了一种针对NH码的码元遍历搜索算法,通过遍历累积时间内NH码的所有组合,消除NH码码元引起的误差.实验结果显示,所提算法可以在一定程度上提高卫星信号的捕获成功率,尤其可以至少提高2 dB弱信号的捕获灵敏度.同时,算法可以为信号跟踪提供更加准确的载波频率.     

Intelligent Information‐Centric Networking routing scheme under imprecise information

Information‐Centric Networking (ICN) has been accepted to overcome some weaknesses of the current Internet architecture, showing that “what is being exchanged” is more important than “who are exchanging information.” Given the inadequate considerations on Quality of Service (QoS) and energy saving in ICN routing, we propose in this paper a routing algorithm to enhance the two aspects. At first, on one hand, Cauchy distribution is used as a fuzzy model to evaluate users' QoS requirements, such as bandwidth, delay, and error rate; on the other hand, we formulate energy saving problem to evaluate the green quality of routing algorithm. Then, we design a link selection approach by considering QoS and energy saving, which belongs to a multi‐objective decision problem resolved by intelligent drops algorithm. Finally, we implement the proposed algorithm and compare it with the famous adaptive forwarding mechanism in terms of some significant metrics, and the experimental results reveal that the proposed algorithm is more efficient.     

一种中高轨混合的多层卫星骨干网络架构设计

卫星骨干网络将向宽带与中继融合方向发展,为陆、海、空、天基用户提供全球骨干传输、宽带接入、全域通联等服务。该文针对全域用户通联的新需求,创新采用“卫星骨干网络/全域用户接入”模型,提出一种具有层内、层间星间链路的中高轨混合的多层卫星骨干网络架构(3GEO+3IGSO/24MEO)。对该架构的全域覆盖性计算分析,得出该多层卫星骨干网络能够实现地球表面到地球同步轨道高度(约36000 km)全域100%覆盖,并为全域用户提供多重接入能力。进一步对路径数、最少跳数、最小时延等关键网络性能指标分析比较,说明了该架构中轨卫星与高轨卫星之间存在层间星间链路的必要性。分析结果表明：该架构能够满足全域宽带接入和全球骨干传输的需求。     

GEO与NGEO卫星频谱共存干扰抑制技术（一）

由于对低延时实时系统和宽带数据的需求日益增加,人们越来越关注如何在几个可用的频带中部署更多的近地轨道（LEO）和中地轨道（MEO）卫星。当可用的非静止轨道（NGEO,即LEO/MEO）卫星数目增多时,其与在轨的地球静止轨道（GEO）卫星频谱共存已经成为了一种必须。在这种情况下,为了使它们的频谱可以共用,探索一项技术来抑制GEO和NGEO系统间的干扰是非常关键的。更具体地说,在GEO和NGEO卫星网络共存的情况下,共线干扰可能是一个严重的问题,特别是在赤道上空。本文提供了几个关于如何在NGEO卫星链路和GEO卫星链路共存情况下频率共用的研究。除此之外,本文提出了几种认知方法来解决共线干扰,也提出了未来研究方向。     

Theatre in the Sky: a ubiquitous broadband multimedia‐on‐demand service over a novel constellation composed of quasi‐geostationary satellites

To meet an ever‐growing demand for wideband multimedia services and electronic connectivity across the world, development of ubiquitous broadband multimedia systems is gaining a tremendous interest at both commercial and academic levels. Satellite networks will play an indispensable role in the deployment of such systems. A significant number of satellite communication constellations have been thus proposed using Geostationary (GEO), Medium Earth Orbit (MEO), or Low Earth Orbit (LEO) satellites. These constellations, however, either require a potential number of satellites or are unable to provide data transmission with high elevation angles. This paper proposes a new satellite constellation composed of Quasi‐GeoStationary Orbit (Quasi‐GSO) satellites. The main advantage of the constellation is in its ability to provide global coverage with a significantly small number of satellites while, at the same time, maintaining high elevation angles. Based on a combination of this Quasi‐GSO satellites constellation and terrestrial networks, the paper proposes also an architecture for building a global, large‐scale, and efficient Video‐on‐Demand (VoD) system. The entire architecture is referred to as a ‘Theatre in the Sky’. Copyright © 2006 John Wiley & Sons, Ltd.     

SIMULATION AND ANALYSIS OF PERFORMANCE ON THE COMPASSTM ENHANCED BY GEO AND IGSO

Positioning accuracy of the Global Navigation Satellite System (GNSS) can be analyzed by Positioning Dilution Of Precision (PDOP).In order to enhance the navigating performance of Asia and the Pacific areas,this paper analyzes the next generation BeidouTM navigation satellite system (CompassTM) enhanced by Geostationary Earth Orbit (GEO) and Inclining GeoSynchronized Orbit (IGSO).As global navigation satellite system,CompassTM must be robust enough to avoid system layoff,when some nodes are not available.So,the CompassTM enhanced by GEO and IGSO constellation is proposed and analyzed its PDOP proformance,this paper shows some exciting results of performance of CompassTM enhanced by GEO and IGSO.From the simulation results,we can found that:when more than fifteen satellites are invalid,the enhanced system could be operating normally.     

Simulation and analysis of performance on the Compass™ enhanced by GEO and IGSO

Positioning accuracy of the Global Navigation Satellite System (GNSS) can be analyzed by Positioning Dilution Of Precision (PDOP). In order to enhance the navigating performance of Asia and the Pacific areas, this paper analyzes the next generation Beidou™ navigation satellite system (Compass™) enhanced by Geostationary Earth Orbit (GEO) and Inclining GeoSynchronized Orbit (IGSO). As global navigation satellite system, Compass™ must be robust enough to avoid system layoff, when some nodes are not available. So, the Compass™ enhanced by GEO and IGSO constellation is proposed and analyzed its PDOP proformance, this paper shows some exciting results of performance of Compass™ enhanced by GEO and IGSO. From the simulation results, we can found that: when more than fifteen satellites are invalid, the enhanced system could be operating normally.     

A hop‐by‐hop delay‐constrained routing algorithm with explicit loop avoidance and backup routing information

QoS Routing is crucial for QoS provisioning in high‐speed networks. In general, QoS routing can be classified into two paradigms: source routing and hop‐by‐hop routing. In source routing, the entire path to the destination node of a communication request is locally computed at the source node based on the global state that it maintains, which does not scale well to large networks. In hop‐by‐hop routing, a path‐selecting process is shared among intermediate nodes between the source node and the destination node, which can largely improve the protocol scalability. In this paper, we present the design of hop‐by‐hop routing with backup route information such that each intermediate node can recursively update the best known feasible path, if possible, by collectively utilizing the routing information gathered thus far and the information that it locally stores. Such a route is kept as a backup route and its path cost is used as a reference to guide the subsequent routing process to search for a lower‐cost constrained path and avoid performance degradation. In this way, the information gathered is maximally utilized for improved performance. We prove the correctness of our presented algorithm and deduce its worst message complexity to be O(∣V∣²), where ∣V∣ is the number of network nodes. Simulation results indicate that, however, the designed algorithm requires much fewer messages on average. Therefore it scales well with respect to the network size. Moreover, simulation results demonstrate that the cost performance of our algorithm is near‐optimal. Copyright © 2004 John Wiley & Sons, Ltd.