29 research outputs found

    Explicit Load Balancing Technique for NGEO Satellite IP Networks With On-Board Processing Capabilities

    Get PDF
    科研費報告書収録論文(課題番号:17500030/研究代表者:加藤寧/インターネットと高親和性を有する次世代低軌道衛星ネットワークに関する基盤研究

    Recent trends in IP/NGEO satellite communication systems: transport, routing, and mobility management concerns

    Get PDF
    科研費報告書収録論文(課題番号:17500030/研究代表者:加藤寧/インターネットと高親和性を有する次世代低軌道衛星ネットワークに関する基盤研究

    Internet of Satellites (IoSat): analysis of network models and routing protocol requirements

    Get PDF
    The space segment has been evolved from monolithic to distributed satellite systems. One of these distributed systems is called the federated satellite system (FSS) which aims at establishing a win-win collaboration between satellites to improve their mission performance by using the unused on-board resources. The FSS concept requires sporadic and direct communications between satellites, using inter satellite links. However, this point-to-point communication is temporal and thus it can break existent federations. Therefore, the conception of a multi-hop scenario needs to be addressed. This is the goal of the Internet of satellites (IoSat) paradigm which, as opposed to a common backbone, proposes the creation of a network using a peer-to-peer architecture. In particular, the same satellites take part of the network by establishing intermediate collaborations to deploy a FSS. This paradigm supposes a major challenge in terms of network definition and routing protocol. Therefore, this paper not only details the IoSat paradigm, but it also analyses the different satellite network models. Furthermore, it evaluates the routing protocol candidates that could be used to implement the IoSat paradigm.Peer ReviewedPostprint (author's final draft

    Dtn and non-dtn routing protocols for inter-cubesat communications: A comprehensive survey

    Get PDF
    CubeSats, which are limited by size and mass, have limited functionality. These miniaturised satellites suffer from a low power budget, short radio range, low transmission speeds, and limited data storage capacity. Regardless of these limitations, CubeSats have been deployed to carry out many research missions, such as gravity mapping and the tracking of forest fires. One method of increasing their functionality and reducing their limitations is to form CubeSat networks, or swarms, where many CubeSats work together to carry out a mission. Nevertheless, the network might have intermittent connectivity and, accordingly, data communication becomes challenging in such a disjointed network where there is no contemporaneous path between source and destination due to satellites’ mobility pattern and given the limitations of range. In this survey, various inter-satellite routing protocols that are Delay Tolerant (DTN) and Non Delay Tolerant (Non-DTN) are considered. DTN routing protocols are considered for the scenarios where the network is disjointed with no contemporaneous path between a source and a destination. We qualitatively compare all of the above routing protocols to highlight the positive and negative points under different network constraints. We conclude that the performance of routing protocols used in aerospace communications is highly dependent on the evolving topology of the network over time. Additionally, the Non-DTN routing protocols will work efficiently if the network is dense enough to establish reliable links between CubeSats. Emphasis is also given to network capacity in terms of how buffer, energy, bandwidth, and contact duration influence the performance of DTN routing protocols, where, for example, flooding-based DTN protocols can provide superior performance in terms of maximizing delivery ratio and minimizing a delivery delay. However, such protocols are not suitable for CubeSat networks, as they harvest the limited resources of these tiny satellites and they are contrasted with forwarding-based DTN routing protocols, which are resource-friendly and produce minimum overheads on the cost of degraded delivery probability. From the literature, we found that quota-based DTN routing protocols can provide the necessary balance between delivery delay and overhead costs in many CubeSat missions

    Integrating LEO Satellite Constellations into Internet Backbone

    Get PDF
    Low Earth Orbit (LEO) satellite constellations have been used for ubiquitous and flexible Internet access services. However, a number of problems related to the integration of terrestrial with satellite hosts should be resolved for the effective exploitation of LEO constellations. LEO constellations are different from terrestrial Internet because of its special properties, which result in a lot of problems. A key issue is how to route Internet packets to the LEO constellation. In the thesis (1) the background of LEO constellations was introduced; (2) the obstacles of routing between the satellites and Internet were outlined; (3) The particular problem, which must be solved, is the routing burst stream traffic in LEO satellite constellations. Two novel routing algorithmsCControl Route Transmission (CRT) and CRT with bandwidth allocation (BCRT)Cwere utilized to address the bursts routing problem. CRT is an adaptive protocol which is able to minimize the congestion in the constellations. BCRT is a CRT extension which is allowed to class the traffic (e.g. video) with different QoS requirements and guarantees. Both of CRT and BCRT work in time epochs. Routes are computed on the basis of a directed weighted graph representing the global traffic traveling in the constellations. Both CRT and BCRT were evaluated via simulation and compared with other proposals in the literatures. The results showed that CRT is a simple algorithm, but the strategy produced by CRT could avoid the congestion and enhance the global resource usage in different traffic conditions. Moreover, the explicit reservation and reroute of BCRT greatly improve the performance of CRT. In particular, the dropping rate of BCRT is very low and the average delivery time is comparable with other proposals in the literatures.Low Earth Orbit (LEO) satellite constellations have been used for ubiquitous and flexible Internet access services. However, a number of problems related to the integration of terrestrial with satellite hosts should be resolved for the effective exploitation of LEO constellations. LEO constellations are different from terrestrial Internet because of its special properties, which result in a lot of problems. A key issue is how to route Internet packets to the LEO constellation. In the thesis (1) the background of LEO constellations was introduced; (2) the obstacles of routing between the satellites and Internet were outlined; (3) The particular problem, which must be solved, is the routing burst stream traffic in LEO satellite constellations. Two novel routing algorithmsCControl Route Transmission (CRT) and CRT with bandwidth allocation (BCRT)Cwere utilized to address the bursts routing problem. CRT is an adaptive protocol which is able to minimize the congestion in the constellations. BCRT is a CRT extension which is allowed to class the traffic (e.g. video) with different QoS requirements and guarantees. Both of CRT and BCRT work in time epochs. Routes are computed on the basis of a directed weighted graph representing the global traffic traveling in the constellations. Both CRT and BCRT were evaluated via simulation and compared with other proposals in the literatures. The results showed that CRT is a simple algorithm, but the strategy produced by CRT could avoid the congestion and enhance the global resource usage in different traffic conditions. Moreover, the explicit reservation and reroute of BCRT greatly improve the performance of CRT. In particular, the dropping rate of BCRT is very low and the average delivery time is comparable with other proposals in the literatures

    Congestion Control for Adaptive Satellite Communication Systems with Intelligent Systems

    Get PDF
    With the advent of life critical and real-time services such as remote operations over satellite, e-health etc, providing the guaranteed minimum level of services at every ground terminal of the satellite communication system has gained utmost priority. Ground terminals and the hub are not equipped with the required intelligence to predict and react to inclement and dynamic weather conditions on its own. The focus of this thesis is to develop intelligent algorithms that would aid in adaptive management of the quality of service at the ground terminal and the gateway level. This is done to adapt both the ground terminal and gateway to changing weather conditions and to attempt to maintain a steady throughput level and Quality of Service (QoS) requirements on queue delay, jitter, and probability of loss of packets. The existing satellite system employs the First-In-First-Out routing algorithm to control congestion in their networks. This mechanism is not equipped with adequate ability to contend with changing link capacities, a common result due to bad weather and faults and to provide different levels of prioritized service to the customers that satisfies QoS requirements. This research proposes to use the reported strength of fuzzy logic in controlling highly non-linear and complex system such as the satellite communication network. The proposed fuzzy based model when integrated into the satellite gateway provides the needed robustness to the ground terminals to comprehend with varying levels of traffic and dynamic impacts of weather

    High-Throughput Air-to-Ground Connectivity for Aircraft

    Get PDF
    Permanent connectivity to the Internet has become the defacto standard in the second decade of the 21st century. However, on-board aircraft connectivity is still limited. While the number of airlines offering in-flight connectivity increases, the current performance is insufficient to satisfy several hundreds of passengers simultaneously. There are several options to connect aircraft to the ground, i.e. direct air-to-ground, satellites and relaying via air-to-air links. However, each single solution is insufficient. The direct air-to-ground coverage is limited to the continent and coastal regions, while the satellite links are limited in the minimum size of the spot beams and air-to-air links need to be combined with a link to the ground. Moreover, even if a direct air-to-ground or satellite link is available, the peak throughput offered on each link is rarely achieved, as the capacity needs to be shared with other aircraft flying in the same coverage area. The main challenge in achieving a high throughput per aircraft lies in the throughput allocation. All aircraft should receive a fair share of the available throughput. More specifically, as an aircraft contains a network itself, a weighted share according to the aircraft size should be provided. To address this problem, an integrated air-to-ground network, which is able to provide a high throughput to aircraft, is proposed here. Therefore, this work introduces a weighted-fair throughput allocation scheme to provide such a desired allocation. While various aspects of aircraft connectivity are studied in literature, this work is the first to address an integrated air-to-ground network to provide high-throughput connectivity to aircraft. This work models the problem of throughput allocation as a mixed integer linear program. Two throughput allocation schemes are proposed, a centralized optimal solution and a distributed heuristic solution. For the optimal solution, two different objectives are introduced, a max-min-based and a threshold-based objective. The optimal solution is utilized as a benchmark for the achievable throughput for small scenarios, while the heuristic solution offers a distributed approach and can process scenarios with a higher number of aircraft. Additionally, an option for weighted-fair throughput allocation is included. Hence, large aircraft obtain a larger share of the throughput than smaller ones. This leads to fair throughput allocation with respect to the size of the aircraft. To analyze the performance of throughput allocation in the air-to-ground network, this work introduces an air-to-ground network model. It models the network realistically, but independent from specific network implementations, such as 5G or WiFi. It is also adaptable to different scenarios. The aircraft network is studied based on captured flight traces. Extensive and representative parameter studies are conducted, including, among others, different link setups, geographic scenarios, aircraft capabilities, link distances and link capacities. The results show that the throughput can be distributed optimally during high-aircraft-density times using the optimal solution and close to optimal using the heuristic solution. The mean throughput during these times in the optimal reference scenario with low Earth orbit satellites is 20 Mbps via direct air-to-ground links and 4 Mbps via satellite links, which corresponds to 10.7% and 1.9% of the maximum link throughput, respectively. Nevertheless, during low-aircraft-density times, which are less challenging, the throughput can reach more than 200 Mbps. Therefore, the challenge is on providing a high throughput during high-aircraft-density times. In the larger central European scenario, using the heuristic scheme, a minimum of 22.9 Mbps, i.e. 3.2% of the maximum capacity, can be provided to all aircraft during high-aircraft-density times. Moreover, the critical parameters to obtain a high throughput are presented. For instance, this work shows that multi-hop air-to-air links are dispensable for aircraft within direct air-to-ground coverage. While the computation time of the optimal solution limits the number of aircraft in the scenario, larger scenarios can be studied using the heuristic scheme. The results using the weighted-fair throughput allocation show that the introduction of weights enables a user-fair throughput allocation instead of an aircraft-fair throughput allocation. As a conclusion, using the air-to-ground model and the two introduced throughput allocation schemes, the achievable weighted-fair throughput per aircraft and the respective link choices can be quantified
    corecore