اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدInter-plane satellite matching in dense LEO constellations
136
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Dense constellations of Low Earth Orbit (LEO) small satellites are envisioned to make extensive use of the inter-satellite link (ISL). Within the same orbital plane, the inter-satellite distances are preserved and the links are rather stable. In contrast, the relative motion between planes makes the inter-plane ISL challenging. In a dense set-up, each spacecraft has several satellites in its coverage volume, but the time duration of each of these links is small and the maximum number of active connections is limited by the hardware. We analyze the matching problem of connecting satellites using the inter-plane ISL for unicast transmissions. We present and evaluate the performance of two solutions to the matching problem with any number of orbital planes and up to two transceivers: a heuristic solution with the aim of minimizing the total cost; and a Markovian solution to maintain the on-going connections as long as possible. The Markovian algorithm reduces the time needed to solve the matching up to 1000x and 10x with respect to the optimal solution and to the heuristic solution, respectively, without compromising the total cost. Our model includes power adaptation and optimizes the network energy consumption as the exemplary cost in the evaluations, but any other QoS-oriented KPI can be used instead.
قيم البحث
اقرأ أيضاً
Low Earth orbit (LEO) satellite constellations rely on inter-satellite links (ISLs) to provide global connectivity. However, one significant challenge is to establish and maintain inter-plane ISLs, which support communication between different orbita
l planes. This is due to the fast movement of the infrastructure and to the limited computation and communication capabilities on the satellites. In this paper, we make use of antenna arrays with either Butler matrix beam switching networks or digital beam steering to establish the inter-plane ISLs in a LEO satellite constellation. Furthermore, we present a greedy matching algorithm to establish inter-plane ISLs with the objective of maximizing the sum of rates. This is achieved by sequentially selecting the pairs, switching or pointing the beams and, finally, setting the data rates. Our results show that, by selecting an update period of 30 seconds for the matching, reliable communication can be achieved throughout the constellation, where the impact of interference in the rates is less than 0.7 % when compared to orthogonal links, even for relatively small antenna arrays. Furthermore, doubling the number of antenna elements increases the rates by around one order of magnitude.
With recent advances on the dense low-earth orbit (LEO) constellation, LEO satellite network has become one promising solution to providing global coverage for Internet-of-Things (IoT) services. Confronted with the sporadic transmission from randomly
activated IoT devices, we consider the random access (RA) mechanism, and propose a grant-free RA (GF-RA) scheme to reduce the access delay to the mobile LEO satellites. A Bernoulli-Rician message passing with expectation maximization (BR-MP-EM) algorithm is proposed for this terrestrial-satellite GF-RA system to address the user activity detection (UAD) and channel estimation (CE) problem. This BR-MP-EM algorithm is divided into two stages. In the inner iterations, the Bernoulli messages and Rician messages are updated for the joint UAD and CE problem. Based on the output of the inner iterations, the expectation maximization (EM) method is employed in the outer iterations to update the hyper-parameters related to the channel impairments. Finally, simulation results show the UAD and CE accuracy of the proposed BR-MP-EM algorithm, as well as the robustness against the channel impairments.
In Low Earth Orbit (LEO) mega constellations, there are relevant use cases, such as inference based on satellite imaging, in which a large number of satellites collaboratively train a machine learning model without sharing their local data sets. To a
ddress this problem, we propose a new set of algorithms based of Federated learning (FL). Our approach differs substantially from the standard FL algorithms, as it takes into account the predictable connectivity patterns that are immanent to the LEO constellations. Extensive numerical evaluations highlight the fast convergence speed and excellent asymptotic test accuracy of the proposed method. In particular, the achieved test accuracy is within 96% to 99.6% of the centralized solution and the proposed algorithm has less hyperparameters to tune than state-of-the-art asynchronous FL methods.
The rapid development of communication technologies in the past decades has provided immense vertical opportunities for individuals and enterprises. However, conventional terrestrial cellular networks have unfortunately neglected the huge geographica
l digital divide, since high bandwidth wireless coverage is concentrated to urban areas. To meet the goal of ``connecting the unconnected, integrating low Earth orbit (LEO) satellites with the terrestrial cellular networks has been widely considered as a promising solution. In this article, we first introduce the development roadmap of LEO satellite constellations (SatCons), including early attempts in LEO satellites with the emerging LEO constellations. Further, we discuss the unique opportunities of employing LEO SatCons for the delivery of integrating 5G networks. Specifically, we present their key performance indicators, which offer important guidelines for the design of associated enabling techniques, and then discuss the potential impact of integrating LEO SatCons with typical 5G use cases, where we engrave our vision of various vertical domains reshaped by LEO SatCons. Technical challenges are finally provided to specify future research directions.
Carrier Aggregation (CA) is an integral part of current terrestrial networks. Its ability to enhance the peak data rate, to efficiently utilize the limited available spectrum resources and to satisfy the demand for data-hungry applications has drawn
large attention from different wireless network communities. Given the benefits of CA in the terrestrial wireless environment, it is of great interest to analyze and evaluate the potential impact of CA in the satellite domain. In this paper, we study CA in multibeam high throughput satellite systems. We consider both inter-transponder and intra-transponder CA at the satellite payload level of the communication stack, and we address the problem of carrier-user assignment assuming that multiple users can be multiplexed in each carrier. The transmission parameters of different carriers are generated considering the transmission characteristics of carriers in different transponders. In particular, we propose a flexible carrier allocation approach for a CA-enabled multibeam satellite system targeting a proportionally fair user demand satisfaction. Simulation results and analysis shed some light on this rather unexplored scenario and demonstrate the feasibility of the CA in satellite communication systems.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
