[go: up one dir, main page]

WO2025171325A1 - Procédés et appareils pour la réalisation d'attributions dynamiques de terminaux utilisateur à des faisceaux ponctuels respectifs d'un système de communication par satellite - Google Patents

Procédés et appareils pour la réalisation d'attributions dynamiques de terminaux utilisateur à des faisceaux ponctuels respectifs d'un système de communication par satellite

Info

Publication number
WO2025171325A1
WO2025171325A1 PCT/US2025/015104 US2025015104W WO2025171325A1 WO 2025171325 A1 WO2025171325 A1 WO 2025171325A1 US 2025015104 W US2025015104 W US 2025015104W WO 2025171325 A1 WO2025171325 A1 WO 2025171325A1
Authority
WO
WIPO (PCT)
Prior art keywords
spot beams
user terminals
beams
user terminal
spot
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
PCT/US2025/015104
Other languages
English (en)
Inventor
Aniruddha Das
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Viasat Inc
Original Assignee
Viasat Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Viasat Inc filed Critical Viasat Inc
Publication of WO2025171325A1 publication Critical patent/WO2025171325A1/fr
Pending legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/14—Relay systems
    • H04B7/15—Active relay systems
    • H04B7/185—Space-based or airborne stations; Stations for satellite systems
    • H04B7/1851—Systems using a satellite or space-based relay
    • H04B7/18513—Transmission in a satellite or space-based system
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/14—Relay systems
    • H04B7/15—Active relay systems
    • H04B7/185—Space-based or airborne stations; Stations for satellite systems
    • H04B7/1853—Satellite systems for providing telephony service to a mobile station, i.e. mobile satellite service
    • H04B7/18539—Arrangements for managing radio, resources, i.e. for establishing or releasing a connection

Definitions

  • the present invention generally relates to performing dynamic assignments of user terminals to respective spot beams of a satellite communications system.
  • Satellite communication systems often employ spot beams to increase spectral efficiency and reuse frequencies across multiple geographic regions. Assigning user terminals to these spot beams is a critical task that influences system performance, resource allocation, and user experience. Various approaches to beam assignment exist.
  • Static beam assignment in this context pre-assigns user terminals to specific spot beams based on the static beam coverage areas and, at least for stationary user terminals, the beam assignments do not change.
  • an overall satellite service area is subdivided into a plurality of beam coverage areas having fixed geographic boundaries, with each beam coverage area corresponding to a respective spot beam.
  • Terminal to beam assignments then rely on a static association between terminal locations and fixed beam coverage areas.
  • Advantages associated with static beam assignments include network simplicity and beamforming simplicity.
  • An example satellite communications system (SCS) disclosed herein bases beam assignments for user terminals not according to a static mapping of terminal locations to predefined beam coverage areas corresponding to spot beams, and instead dynamically identifies some or all possible beam assignments and then determines a combination of beam assignments predicted as yielding the most favorable utilization of a communications resource of the SCS.
  • SCS satellite communications system
  • An example embodiment comprises a method of operation by a SCS, where the method comprises performing a dynamic assignment procedure, according to which the terminal-to-beam assignments are determined dynamically.
  • the procedure includes determining, for each user terminal among a plurality of user terminals, which spot beams among a plurality of spot beams of the SCS are candidate beams for serving the user terminal. The determination is based at least on determining which ones among the plurality of spot beams satisfy radio link requirements for serving the user terminal.
  • the method includes identifying a set of beam assignment decisions that optimizes utilization of a communications resource that is consumed in dependence on which combination of candidate beams is used for serving the plurality of user terminals.
  • the identified set of beam assignment decisions assign each user terminal to one and only one of the candidate beams determined for the user terminal, and the method further includes implementing the identified set of beam assignment decisions, for serving the plurality of user terminals via the plurality of spot beams.
  • a related embodiment comprises a computer apparatus that is configured for use in a SCS.
  • the computer apparatus includes a communications interface and processing circuitry.
  • the processing circuitry is operative to carry out a dynamic assignment procedure, based on the processing circuitry being configured to: determine, for each user terminal among a plurality of user terminals, which spot beams among a plurality of spot beams of the SCS are candidate beams for serving the user terminal, based at least on determining which ones among the plurality of spot beams satisfy radio link requirements for serving the user terminal; identify a set of beam assignment decisions that optimizes utilization of a communications resource that is consumed in dependence on which combination of candidate beams is used for serving the plurality of user terminals, the identified set of beam assignment decisions assigning each user terminal to one and only one of the candidate beams determined for the user terminal; and implement, via control signaling output via the communications interface, the identified set of beam assignment decisions, for serving the plurality of user terminals via the plurality of spot beams.
  • Another embodiment comprises a SCS that includes one or more satellites, for providing a plurality of spot beams, each spot beam having a fixed nominal beam coverage area.
  • the SCS further includes a ground network configured to support the one or more satellites, for serving a plurality of user terminals via the plurality of spot beams.
  • any particular user terminal is served by only one spot beam at a time, and the ground network further includes a computer apparatus as described immediately above, for carrying out the dynamic assignment procedure on a recurring or triggered basis, with respect to the plurality of user terminals and the plurality of spot beams.
  • One or more embodiments of the method 600 include reducing a processing load associated with identifying the candidate beams corresponding to each user terminal 12 in the population of user terminals 12 by, for each user terminal 12, assuming that spot beams 22 having corresponding nominal beam coverage areas 14 not covering or not adj cent to a location of the user terminal 12, cannot be candidate beams for serving the user terminal 12.
  • a geographic region defined as a satellite service area 10 is logically subdivided into a plurality of nominal user beam coverage areas 14.
  • Each spot beam 22 among the plurality of spot beams 22 is oriented for illumination of a corresponding one among the plurality of nominal user beam coverage areas 14.
  • the particular ones among the plurality of spot beams 22 that are numerically evaluated for consideration as candidate beams for any particular one among the population of user terminals 12 is a function of a location of the user terminal 12 within the satellite service area 10.
  • the one or more constraints include a restriction that each user terminal 12 is served by only one spot beam at a time, along with any one or more of: applicable regulatory limits on user terminal transmit power; a defined mathematical cost for switching a given user terminal 12 from one beam to another; priority assignments for one or more user terminals 12 among the population of user terminals; SLAs governing service to one or more of the user terminals 12 among the population of user terminals 12; per beam throughput limits; and per beam symbol rate limits.
  • the data used in one or more embodiments of the dynamic assignment procedure are collected for every /-th time interval, for each n-th terminal. These time intervals may be of the same duration on which the beam assignment decisions are updated, or they may be a fraction of the update interval. In that latter case, data may be collected multiple times over a current beam update interval, with that data filtered or otherwise aggregated for use in deciding the beam assignments for the next beam update interval.
  • the total number of terminals is N and can be large, such as hundreds of thousands, or even more than a million, and the data collected includes: the current location Z(n, t) in lat-lon of each terminal, the current beam matrix B t (i.e., the decision set currently in use), the current SNR snr t (n, 1) in dB (i.e., the current SNR for each terminal), and the current usage d t (n, l)in bits/second for each terminal.
  • Inputs to the optimization algorithm include, for each terminal: (a) the predicted values at time t+1 for the location of the terminal, (b) the set of predicted SNRs for the respective beams, (c) the usage of the terminal, (d) any contractual SLA/data rates applicable for the terminal; (e) the cost, c, of a beam switch, which may be expressed in the form of the capacity overhead needed in the SCS for a beam switch; (f) any regulatory limits on transmissions, such as may be applied to the terminal in the reverse link direction; (g) actual/true beam assignments of the terminal at time t, i.e. B t ; (h) terminal priority level; and (i) mapping of SNR to bits/symbol in the SCS, after taking into account the system margin in dB.
  • the optimization algorithm determines the optimal set or collection of beam assignments for the terminals at time t + 1. That is, it determines B t+1 . For those terminals where a beam change is needed, the computer apparatus 60 shall initiate the beam change/handover promptly.
  • Constraints applicable to the optimization include: (a) an inequality constraint for symbol rate, where the total symbol rate demanded from a beam cannot be greater than what has been assigned to the beam by the SCS 18; (b) regulatory constraints per terminal, including any regulatory limits on transmit power; (c) SLA constraints that must be met on a per terminal basis; (d) the rule that elements of B t+1 must be 0 or 1 (binary constraint); (e) the rule that each column of B t+1 must sum to 1 (i.e., each terminal must have one and only one beam assigned); (f) and an infeasibility problem constraint, wherein, if the Binary Integer Problem (BIP) as defined above is infeasible, the problem may be relaxed by taking into account terminal priority, such that higher priority terminals would be prioritized and lower priority terminals deemphasized or even dropped, until the problem becomes feasible.
  • BIP Binary Integer Problem
  • Figure 7 illustrates the above described optimization algorithm in the form of a method 700.
  • Figure 7 thus can be understood as a further example implementation of the method 500.
  • the method 700 includes collecting (Block 702) the data described above as inputs to the optimization algorithm, where the collection may be done on a running basis.
  • the method 700 further includes determining whether it is time to determine a new set of beam assignment decisions for the involved plurality of user terminals. If not (NO from Block 704), operations continue with data collection. If so (YES from Block 704), operations continue with carrying out (Block 706) the optimization algorithm described above, and then applying (Block 708) the optimal beam assignments, as determined by the optimization algorithm.
  • applying the optimal set of beam assignment decisions does not mean that every single decision in the set must ultimately be realized in the SCS 18, e.g., there may be failures or overrides or other circumstances that prevent a complete realization. Even so, operation of the SCS 18 is improved if at least some of the decisions in the optimal set are realized within the SCS 18.
  • the degree or overall extent of optimization may be varied without departing from the underlying technique.
  • the set of user terminals considered in the optimization problem may be filtered, as may be the set of spot beams.
  • the candidate beam sets may be made more or less inclusive. For example, for any given terminal, there may be three spot beams that satisfy link requirements, but only the two best are considered in the optimization problem, and this same logic may be applied to limit the candidate beam set size for all terminals considered in the optimization.
  • the objective function in one or more embodiments may consider less than the full universe of possible beam assignment decisions.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Astronomy & Astrophysics (AREA)
  • Aviation & Aerospace Engineering (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Radio Relay Systems (AREA)

Abstract

Un exemple de système de communication par satellite (SCS) décrit dans la description ne fonde pas des attributions de faisceau pour des terminaux utilisateur sur une mise en correspondance statique d'emplacements de terminal avec des zones de couverture de faisceau prédéfinies correspondant à des faisceaux ponctuels, mais au lieu de cela, identifie dynamiquement certaines ou toutes les attributions de faisceau possibles et détermine ensuite une combinaison d'attributions de faisceau dont il est prédit qu'elle produira l'utilisation la plus favorable d'une ressource de communication du SCS. Parmi les divers avantages de cette procédure d'attribution dynamique figure le fait que les attributions de faisceau tiennent compte de conditions variables, tout en profitant de la simplicité relative des zones de couverture de faisceau prédéfinies.
PCT/US2025/015104 2024-02-09 2025-02-07 Procédés et appareils pour la réalisation d'attributions dynamiques de terminaux utilisateur à des faisceaux ponctuels respectifs d'un système de communication par satellite Pending WO2025171325A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US202463551647P 2024-02-09 2024-02-09
US63/551,647 2024-02-09

Publications (1)

Publication Number Publication Date
WO2025171325A1 true WO2025171325A1 (fr) 2025-08-14

Family

ID=94869733

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2025/015104 Pending WO2025171325A1 (fr) 2024-02-09 2025-02-07 Procédés et appareils pour la réalisation d'attributions dynamiques de terminaux utilisateur à des faisceaux ponctuels respectifs d'un système de communication par satellite

Country Status (1)

Country Link
WO (1) WO2025171325A1 (fr)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170111845A1 (en) * 2015-10-14 2017-04-20 Worldvu Satellites Limited Method for maintaining signal-to-noise ratio at a user terminal in a satellite system
US20190207672A1 (en) * 2017-12-29 2019-07-04 Hughes Network Systems, Llc Machine learning models for adjusting communication parameters
US20200007227A1 (en) * 2017-03-02 2020-01-02 Viasat, Inc. Dynamic satellite beam assignment

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170111845A1 (en) * 2015-10-14 2017-04-20 Worldvu Satellites Limited Method for maintaining signal-to-noise ratio at a user terminal in a satellite system
US20200007227A1 (en) * 2017-03-02 2020-01-02 Viasat, Inc. Dynamic satellite beam assignment
US20190207672A1 (en) * 2017-12-29 2019-07-04 Hughes Network Systems, Llc Machine learning models for adjusting communication parameters

Similar Documents

Publication Publication Date Title
AU2023203210B2 (en) Handover Based on Predicted Network Conditions
US20230344511A1 (en) Resource deployment optimizer for non-geostationary and/or geostationary communications satellites
EP3513596B1 (fr) Gestion et routage de ressources radio pour des circuits de données fixes dans un système de communication de données par satellite ngso
CN113452432B (zh) 多波束低轨卫星通信下行资源动态分配方法
CN109257091B (zh) 全局负载均衡星地协同网络组网装置和方法
Kak et al. Towards automatic network slicing for the internet of space things
Lin et al. Virtual network embedding with adaptive modulation in flexi-grid networks
WO2025171325A1 (fr) Procédés et appareils pour la réalisation d'attributions dynamiques de terminaux utilisateur à des faisceaux ponctuels respectifs d'un système de communication par satellite
Mesodiakaki et al. Online energy-efficient resource allocation in integrated terrestrial and satellite 6G networks
US11711140B2 (en) Pointing error mitigation
Ahsan et al. Flexible resource allocation and path reconfiguration strategies for eMBB and mMTC services in a LEO satellite topology
Esmat et al. Leons: Multi-domain network slicing configuration and orchestration for satellite-terrestrial edge computing networks
CA2622919C (fr) Dispositif d'emission et/ou reception de signaux a reutilisation de frequence par affectation d'une cellule par terminal, pour un satellite de communication
Dou et al. Matchmaker: Maintaining QoS-aware and Predictable Load Balancing Performance for LEO Mega-Constellations
Zhang et al. Resource Balance Optimization of Network Slicing Based on MDW-SFCM in Space-Air-Ground Integrated Networks
ZUKERMAN Virtual Network Embedding with Adaptive Modulation in Flexi-grid Networks Lin, Rongping; Luo, Shan; Zhou, Jingwei; Wang, Sheng; CAI, Anliang; Zhong, Wen-De
Xu et al. Resource Allocation for Satellite Network Access: A Combinatorial Bandit Learning Approach

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 25709553

Country of ref document: EP

Kind code of ref document: A1