NOMA Assisted Coordinated Beam Hopping for VLEO Satellite Communication Systems

arXiv:2611.08174 · cs.IT, math.IT · Submitted 2026-11-05 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Computer Science. The day in computer science: software, systems and theory on arXiv.

Tom: We're looking at the paper: "NOMA Assisted Coordinated Beam Hopping for VLEO Satellite Communication Systems".

Jane: Here's the gist of the paper. This paper investigates a non-orthogonal multiple access assisted coordinated beam hopping (NOMA-CBH) scheme in multidimensional very low Earth orbit (VLEO) satellite communication systems, where multiple satellites employ CBH and coordinated beams jointly serve ground users and a dedicated ground station The NOMA-CBH with LCD algorithm achieves an enhanced system sum rate relative to orthogonal multiple access with coordinated beam hopping (OMA-CBH) Across the considered heterogeneous trafficdemand operating points, the NOMA-CBH scheme achieves higher aggregate delivered traffic than the benchmark schemes and its outage performance is better than that of OMA-CBH System Architecture and Channel Modeling The system model considers NOMA assisted VLEO satellite CBH communication scenarios where multiple satellites coordinate their active beams to enable multidimensional transmission across geographically heterogeneous environments The overall candidate-beam set is denoted by B = S s∈S Bs, where the satellite-specific beam sets are mutually disjoint, ensuring that each beam uniquely belongs to a specific satellite The VLEO channel model explicitly accounts for dynamic impairments specific to VLEO environments, incorporating geometric dynamics, attitude perturbations, residual Doppler effects, atmospheric attenuation, and pointing perturbations This model is formulated as hs,b,m,t = ηs,b,m,tp Gr λ 4πds s m t × r Gt φ eff s b m t LDop s m t Latme j Ψs m t (1) Optimization Strategy and Algorithm Design To address the prohibitive computational complexity of the joint resource scheduling, a low-complexity decoupled (LCD) algorithm is designed to optimize beam scheduling and power allocation The LCD algorithm decomposes the joint optimization problem P0 into two cascaded subproblems: 1) A beam scheduling and beam-user association subproblem driven by large-scale channel gains, and 2) A NOMA power allocation subproblem for the scheduled group The first subproblem is formulated as P1: max zs,b,t βs,b,m,t X s∈S b∈Bs m∈M t∈T βs,b,m,t G L S s b m t (15a) This subproblem is driven by the large-scale scheduling metric GLS s b m t = Gr Gt φ eff s b m t λ 4πds m t LDop s m t Latm, which incorporates the instantaneous propagation distance, atmospheric attenuation, residual Doppler loss, and pointing perturbations Performance Analysis and Diversity Orders The performance analysis is conducted on a per-snapshot basis under a two-layer decoupling that mirrors the designed LCD algorithm The outage probability of Ui is given by Theorem 1, which involves an expression derived from the channel gains and fading statistics The diversity order for Ui is shown to be di = µ, which reflects that the non-identical average channel gains affect the asymptotic coefficient but do not change the diversity order of Ui Similarly, the diversity order for Uj is dj = 2µ, and for Ul it is dl = 2µ Numerical Validation and Conclusion Simulation results confirm that the designed NOMA-CBH scheme achieves substantial improvements in system sum rate and outage performance compared to conventional orthogonal baselines The designed NOMA-CBH scheme consistently achieves the highest sum rate, and the gap with respect to OMA-CBH widens as the transmit power increases The proposed LCD algorithm achieves a favorable tradeoff between system performance and computational efficiency, with a complexity of O T NBNtotM + T ∆2 The results demonstrate that the designed NOMA-CBH scheme provides substantial performance improvements over the considered benchmark schemes and highlights the importance of jointly adapting user matching and power allocation to dynamic channel variations Appendix A: Proof of Theorem 1 The proof for the outage probability of Ui is completed by substituting the derived expression into Theorem 2, which results in equation (20) The receiver-specific outage probability of Ui can be expressed as PUi = Pr γi < γth i J1 (A.1) Appendix B: Proof of Theorem 2 The proof for the outage probability of Uj is completed by substituting the derived expression into Theorem 3, which results in equation (21) The receiver-specific outage probability of Uj can be expressed as PUj = 1 − Pr γ j→i ≥ γth i, γ j ≥ γth j J2 (B.1) Appendix C: Proof of Theorem 3 The proof for the outage probability of Ul is completed by substituting the derived expression into Theorem 4, which results in equation (22) The receiver-specific outage probability of Ul can be given by PUl = 1 − Pr γ l→i ≥ γth i, γ l→j ≥ γth j, γ l ≥ γth l J3 (C.

Title and authors: Tom: So we're looking at a paper titled "NOMA Assisted Coordinated Beam Hopping for VLEO Satellite Communication Systems". Jane, what are we even looking at here?

Jane: Well, Tom, the title itself tells you a lot. It's about Non-orthogonal Multiple Access assisted Coordinated Beam Hopping for Very Low Earth Orbit satellite communication systems. Basically, it's tackling how to use multiple satellites and coordinated beams to serve ground users and a dedicated ground station all at once in those low orbit environments >

Lu: What that means practically is they are looking at a situation where you have several small satellites orbiting the Earth, and instead of each satellite just talking to one group of users, they coordinate their active beams so they can cover more ground and keep things continuous when the geometry changes really fast >

Meng: But what's the actual payoff? Is this just another complex math problem that takes forever to solve in real life? I mean, we deal with massive traffic demands.

Tom: That's what we need to find out. The summary says they use a Non-orthogonal Multiple Access scheme combined with Coordinated Beam Hopping and a specific algorithm called the LCD algorithm to serve ground users and the ground station jointly >

Jane: And the key finding they highlight is that this NOMA-CBH scheme achieves a better system sum rate compared to schemes that don't coordinate beams, like Orthogonal Multiple Access with Coordinated Beam Hopping, and its outage performance is also superior >

Lalam: I see. So the main message here is that by coordinating the beams and using NOMA power allocation smartly, they get more data through the system than just doing things separately >

Tom: Exactly. The paper focuses on showing this improvement across different traffic demands, which means it's not just a theoretical win; it works for real-world scenarios >

Jane: And the methodology they used is pretty detailed. They start by building a channel model specifically for VLEO that accounts for things like atmospheric attenuation and Doppler effects >

Lu: Right, they make sure the channel model captures all those dynamic impairments—the geometric dynamics, attitude perturbations, residual Doppler effects, and pointing perturbations—to give them a solid physical layer basis to work from >

Meng: I'm curious about the algorithm part. They mention designing a low-complexity decoupled or LCD algorithm to handle the joint scheduling and power allocation problem because that full version would be computationally insane >

Title and authors: Tom: That complexity reduction is huge for deployment, Meng. They decompose the big optimization problem P zero into two separate subproblems: first, beam scheduling driven by large-scale channel gains >

Jane: And then a second one which is a NOMA power allocation subproblem for the scheduled group >

Lalam: So they solve the scheduling and association first using these large scale metrics, and then they use those results to figure out how much power each user gets within that specific group >

Tom: That makes sense. They use a metric called GLS which incorporates the instantaneous propagation distance, atmospheric attenuation, residual Doppler loss, and pointing perturbations for that scheduling step >

Lu: And that metric is what drives the first subproblem P one, which is about maximizing something called GLS s b m t with respect to the beam sets and user indices >

Jane: It sounds like they're using those large scale gains as a proxy for the actual channel state information, which should really help contract the search space for real time scheduling >

Meng: I worry about that abstraction. If you rely too much on large scale gains, what happens when the small fluctuations in the channel cause a major mismatch?

Tom: That's where they address it by conditioning the power allocation step, which is P two, using a discrete power allocation search set A and an algorithm called Algorithm two >

Lu: And that algorithm maximizes the slot wise sum rate while keeping quality of service constraints and successive interference cancellation constraints met within that scheduled group >

Jane: So they're not just picking beams; they are matching users to those beams and then optimally assigning power on top of that choice >

Lalam: They also did some pretty interesting analysis on the performance, deriving closed-form expressions for the outage probabilities of both the ground users and the ground station >

Tom: And they didn't stop there. They performed asymptotic analysis to characterize their diversity orders, which is a way of looking at how reliable a link is in terms of fading statistics >

Jane: The results show that they derive di equal to mu for the ground users, dj equal to two mu for the ground station, and dl equal to two mu for the dedicated ground station >

Lu: That means even though the average channel gains are different across those links, it doesn't change their diversity order; it stays at two mu >

Meng: That sounds like a strong result, but what about deployment? How does this LCD algorithm perform when you push it to the edge of complexity? What is its actual runtime cost?

Title and authors: Tom: The complexity of the designed NOMA-CBH scheme is O T N B M t plus T delta two >

Jane: Which means it's relatively low in terms of time and number of bits, which is good for a system that needs to make decisions very quickly >

Lalam: And they also evaluate the delay limited throughput by combining those outage results with a target transmission rate R w to get the aggregate delivered traffic R agg del over all Monte Carlo realizations >

Lu: That gives a realistic measure of what you can actually achieve under resource constraints, which is important for deployment feasibility >

Tom: Overall, this paper on NOMA Assisted Coordinated Beam Hopping for VLEO Satellite Communication Systems shows substantial improvements in system sum rate and outage performance compared to conventional orthogonal baselines >

Jane: It highlights the importance of jointly adapting user matching and power allocation to dynamic channel variations, which is crucial for those very low orbit environments >

Lu: And that coordination is what gives the system those additional degrees of freedom that help maintain coverage continuity when you have multiple satellites working together across space and time >

Meng: I see. So this isn't just a neat math trick; it's about making a real multi-satellite network function better under difficult, dynamic conditions >

Tom: It’s about practical efficiency gains from intelligent resource management in a complex communication setup. We should keep an eye on how they handle the scaling when you move beyond the simulation parameters they used.

Jane: Right, and that brings us to the conclusion of this discussion on this paper, which really summarizes these points >

Lu: I think it’s important to remember that their work focuses on providing those closed-form outage probability expressions and diversity orders for both users and the ground station >

Meng: And for me, what matters is that they showed a way to handle the coordination without needing a prohibitively expensive optimization solver in real time.

Lalam: I'm fairly sure that the NOMA-CBH scheme they present provides substantial performance improvements over the considered benchmark schemes, and it really emphasizes how important joint adaptation is for dynamic channel variations >

Tom: Exactly. It’s about moving past static designs to something that can dynamically adapt its resources based on what the channel is telling it moment by moment. That's what makes this paper interesting for anyone building systems in VLEO >

The paper's summary: Tom: So we're looking at the summary of this NOMA Assisted Coordinated Beam Hopping paper and what it means for VLEO communication systems overall.

Jane: Okay, so basically, they're saying that by using Non-orthogonal Multiple Access combined with coordinated beam hopping across multiple small satellites, you can get a much higher system sum rate compared to just doing standard orthogonal access with coordinated beam hopping.

Lu: They specifically look at this across different traffic demands and show that this NOMA scheme delivers more aggregate traffic than the benchmark schemes, and its performance when things fail is also better than the OMA-CBH baseline.

Meng: So what's the big picture for deployment? Is it just a theoretical number boost or does it actually translate to better service for people on the ground?

Tom: It translates to more data moving through the system, which is crucial when you have those high traffic demands we talked about earlier. But they also tackled something practical: the complexity of doing this.

Jane: They didn't just throw a complicated math problem at us; they designed this low-complexity decoupled algorithm, called LCD, to handle the scheduling and power allocation parts separately.

Lu: That decomposition is key because it breaks down that mixed-integer nonlinear programming problem into two steps: first figuring out which beam serves which user, driven by large channel gains.

Tom: And then second, they use those results to figure out how much power to give the users in that group, satisfying quality of service constraints. It’s a smart way to manage the computational load.

Jane: They modeled the channel very specifically for VLEO, including all those tricky stuff like atmospheric attenuation and Doppler effects that happen when things are moving fast relative to us on Earth.

Meng: I wonder if that level of detail is necessary or just overkill for what we can actually deploy right now, but they proved it helps define a better physical layer basis.

Tom: They did more than just the sum rate. They derived closed-form expressions for the outage probabilities of both the ground users and the dedicated ground station.

Jane: And they even looked at their diversity orders, which tells us about how reliable those links are in terms of fading statistics, showing a diversity order of two mu for the users and two mu for that dedicated station.

Lu: That means even though the individual channels aren't identical across all those links, it doesn't change their reliability scaling with the number of satellites.

Meng: Okay, so they show an improvement in performance over existing methods while keeping the computational cost manageable through that decoupling strategy.

Tom: Exactly. It moves us closer to systems that can dynamically adapt beam matching and power allocation based on what the channel is doing right now, which is vital for those fast-moving VLEO environments.

Jane: So, the implication here is that coordinated beam hopping with NOMA isn't just an academic idea; it’s a practical way to build more robust and efficient communication networks in space.

Lu: And the next thing we need to look at is how this specific LCD algorithm performs when you push it past those simulation parameters they used, because that’s where we see if it holds up under real stress.

The paper's improvements: Tom: Okay, so we're moving on to what this paper actually suggests for improving future work in this area of communication systems.

Jane: Right, so they’re hinting that the real power here isn't just the basic scheme, but how you handle those dynamic channel variations by jointly adapting user matching and power allocation.

Lu: They suggest a more sophisticated approach to scheduling where you drive it using large scale gains instead of relying on instantaneous small scale channel state information, which effectively contracts the search space for real time scheduling.

Tom: That’s an interesting mechanic. It means the AI system can make decisions faster because it’s not trying to solve every tiny fluctuation in the channel record at once.

Jane: And they also point out that optimizing power allocation for a scheduled NOMA group should be done using a discrete power allocation search set and an algorithm conditioned on those beam scheduling results.

Meng: So, the implication is that you don't need a perfect solver instantly; you just need a solid, fast procedure for finding the best power settings given the beam assignments.

Lu: They are also aiming for closed-form expressions for outage probabilities and performing asymptotic analysis to characterize those diversity orders precisely, which gives us a concrete way to predict link reliability.

Tom: That’s huge because it moves us beyond just seeing *if* a system works, to knowing exactly *how reliably* it will work under different fading statistics.

Jane: And they also look at evaluating delay limited throughput by combining those outage results with the target transmission rate, which gives a realistic number for the aggregate delivered traffic under resource constraints.

Meng: That’s what I care about on the ground—getting a real measure of what actually gets through when you have those latency limits in place.

Lu: They also validate robust performance against pointing errors by showing that joint adaptation of user matching and power allocation helps maintain a relatively stable sum rate even when the pointing jitter increases.

Tom: So, it’s not just about achieving a high peak rate; it’s about building systems that stay stable and perform well even when the environment gets messy, like those pointing errors or atmospheric changes.

Jane: And they leave us with a clear direction: focus on these joint adaptation strategies because that's what makes the system truly robust in dynamic VLEO settings.

Lu: The next thing we need to dig into is how this specific LCD algorithm performs when you push it past those simulation parameters they used, because that’s where we see if it holds up under real stress.

Conclusion: Tom: So we’re wrapping up this discussion on "NOMA Assisted Coordinated Beam Hopping for VLEO Satellite Communication Systems." The core idea is that by using Non-orthogonal Multiple Access with coordinated beam hopping, you can get a much higher system sum rate than standard orthogonal access.

Jane: And they show this works across different traffic demands and the method uses a low-complexity decoupled algorithm to keep the computation manageable.

Lu: They proved that this scheme delivers more aggregate traffic and has better outage performance than existing benchmarks, which is a solid result for their VLEO channel model.

Meng: From an engineering standpoint, what I’m taking away is that the LCD algorithm gives us a way to handle the complexity without needing an impossibly slow solver in real time.

Lalam: I’m confident in this result because they derived those closed-form expressions for the outage probabilities and diversity orders, so we know exactly how reliable these links are.

Tom: And that's what makes it interesting—it’s not just a number; it’s a way to design a system that knows how to adapt user matching and power allocation on the fly.

Jane: It really highlights the importance of making those joint decisions because the environment in VLEO is changing so fast.

Lu: That adaptation is what allows them to maintain performance even when pointing errors or atmospheric conditions fluctuate significantly.

Meng: I still have to ask how this holds up if we move beyond their simulation parameters, but for now, it looks like a very promising blueprint for more robust satellite networks.

Tom: It definitely suggests that moving past static designs to something that can dynamically adapt its resources based on the channel’s real-time feedback is the right direction.

Jane: So this paper on NOMA Assisted Coordinated Beam Hopping for VLEO Satellite Communication Systems shows a strong path toward making space communication more efficient and dependable.

Lu: The next thing we need to look at is how this specific LCD algorithm performs when you push it past those simulation parameters they used, because that’s where we see if it holds up under real stress.

Meng: Yeah, I'm looking forward to seeing the complexity analysis for that LCD method.

Beijing Information Science & Technology University · Beijing Institute of Technology Group Corporation

cs.IT, math.IT

Submitted: 2026-11-05

Updated: 2026-11-05

Comments: 16 pages. Published in IEEE Transactions on Aerospace and Electronic Systems (Early Access, 2026)

DOI: 10.1109/TAES.2026.3750099

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Importance score: 77/100

The gist: This paper investigates a non-orthogonal multiple access assisted coordinated beam hopping (NOMA-CBH) scheme in multidimensional very low Earth orbit (VLEO) satellite communication systems…

Key concepts

NOMA-CBH
This is a technique where multiple satellites coordinate their active beams. Instead of using completely separate channels (orthogonal access), they allow users to share resources through Non-Orthogonal Multiple Access (NOMA). This coordination helps manage complex traffic demands across different geographic areas.
LCD Algorithm
A Low-Complexity Decoupled algorithm is used to simplify the optimization process. It breaks down the difficult, combined scheduling problem into two simpler, sequential subproblems: first deciding which beams to use for which users, and second determining the power levels for those chosen users.
VLEO Channel Model
This model specifically accounts for the unique challenges of communication from very low Earth orbit. It incorporates dynamic effects like geometric changes, satellite attitude movements, residual Doppler shifts (due to speed), atmospheric signal loss, and pointing errors to accurately predict signal quality.

Terminology

Summary

This paper investigates a non-orthogonal multiple access assisted coordinated beam hopping (NOMA-CBH) scheme in multidimensional very low Earth orbit (VLEO) satellite communication systems, where multiple satellites employ CBH and coordinated beams jointly serve ground users and a dedicated ground station

The NOMA-CBH with LCD algorithm achieves an enhanced system sum rate relative to orthogonal multiple access with coordinated beam hopping (OMA-CBH) Across the considered heterogeneous trafficdemand operating points, the NOMA-CBH scheme achieves higher aggregate delivered traffic than the benchmark schemes and its outage performance is better than that of OMA-CBH

System Architecture and Channel Modeling

The system model considers NOMA assisted VLEO satellite CBH communication scenarios where multiple satellites coordinate their active beams to enable multidimensional transmission across geographically heterogeneous environments The overall candidate-beam set is denoted by B = S s∈S Bs, where the satellite-specific beam sets are mutually disjoint, ensuring that each beam uniquely belongs to a specific satellite The VLEO channel model explicitly accounts for dynamic impairments specific to VLEO environments, incorporating geometric dynamics, attitude perturbations, residual Doppler effects, atmospheric attenuation, and pointing perturbations This model is formulated as hs,b,m,t = ηs,b,m,tp Gr λ 4πds s m t × r Gt φ eff s b m t LDop s m t Latme j Ψs m t (1)

Optimization Strategy and Algorithm Design

To address the prohibitive computational complexity of the joint resource scheduling, a low-complexity decoupled (LCD) algorithm is designed to optimize beam scheduling and power allocation The LCD algorithm decomposes the joint optimization problem P0 into two cascaded subproblems: 1) A beam scheduling and beam-user association subproblem driven by large-scale channel gains, and 2) A NOMA power allocation subproblem for the scheduled group The first subproblem is formulated as P1: max zs,b,t βs,b,m,t X s∈S b∈Bs m∈M t∈T βs,b,m,t G L S s b m t (15a) This subproblem is driven by the large-scale scheduling metric GLS s b m t = Gr Gt φ eff s b m t λ 4πds m t LDop s m t Latm, which incorporates the instantaneous propagation distance, atmospheric attenuation, residual Doppler loss, and pointing perturbations

Performance Analysis and Diversity Orders

The performance analysis is conducted on a per-snapshot basis under a two-layer decoupling that mirrors the designed LCD algorithm The outage probability of Ui is given by Theorem 1, which involves an expression derived from the channel gains and fading statistics The diversity order for Ui is shown to be di = µ, which reflects that the non-identical average channel gains affect the asymptotic coefficient but do not change the diversity order of Ui Similarly, the diversity order for Uj is dj = 2µ, and for Ul it is dl = 2µ

Numerical Validation and Conclusion

Simulation results confirm that the designed NOMA-CBH scheme achieves substantial improvements in system sum rate and outage performance compared to conventional orthogonal baselines The designed NOMA-CBH scheme consistently achieves the highest sum rate, and the gap with respect to OMA-CBH widens as the transmit power increases The proposed LCD algorithm achieves a favorable tradeoff between system performance and computational efficiency, with a complexity of O T NBNtotM + T ∆2 The results demonstrate that the designed NOMA-CBH scheme provides substantial performance improvements over the considered benchmark schemes and highlights the importance of jointly adapting user matching and power allocation to dynamic channel variations

Appendix A: Proof of Theorem 1

The proof for the outage probability of Ui is completed by substituting the derived expression into Theorem 2, which results in equation (20) The receiver-specific outage probability of Ui can be expressed as PUi = Pr γi < γth i J1 (A.1)

Appendix B: Proof of Theorem 2

The proof for the outage probability of Uj is completed by substituting the derived expression into Theorem 3, which results in equation (21) The receiver-specific outage probability of Uj can be expressed as PUj = 1 − Pr γ j→i ≥ γth i, γ j ≥ γth j J2 (B.1)

Appendix C: Proof of Theorem 3

The proof for the outage probability of Ul is completed by substituting the derived expression into Theorem 4, which results in equation (22) The receiver-specific outage probability of Ul can be given by PUl = 1 − Pr γ l→i ≥ γth i, γ l→j ≥ γth j, γ l ≥ γth l J3 (C.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Low complexity decoupled algorithm for beam scheduling and power allocation can be implemented to reduce computational burden by decomposing Problem P0 into two cascaded subproblems. This allows for sequential determination of beam scheduling and power allocation, addressing the prohibitive complexity of a mixed-integer nonlinear programming problem.

  2. A VLEO oriented channel model incorporating atmospheric attenuation, Doppler effects, and pointing perturbations can be established to provide a unified physical layer basis for the design and evaluation of NOMA-CBH. This model accounts for rapid geometry variations through terms like dds m t and incorporates residual frequency offset as a fixed fraction of the instantaneous Doppler magnitude.

  3. The improved AI system can perform dynamic beam scheduling and user association by driving scheduling through large-scale gains instead of instantaneous small-scale channel state information, contracting the search space for real-time scheduling. This is achieved by formulating Problem P1 to maximize GLS s,b,m,t subject to large-scale gain constraints.

  4. The system can optimize power allocation for the scheduled NOMA group using a discrete power allocation search set A and Algorithm 2 conditioned on the results of the beam scheduling and association decisions. This stage maximizes the slot wise sum rate while satisfying quality of service and successive interference cancellation constraints.

  5. The AI system can derive closed-form expressions for outage probabilities of ground users, GS, and perform asymptotic analysis to characterize their diversity orders. This allows for precise characterization of link reliability in dynamic VLEO environments under fixed feasible power-allocation settings.

  6. The system can evaluate delay limited throughput by combining the outage results with the target transmission rate Rw to determine the aggregate delivered traffic Ragg del = 1/NMCT sum P t in T Ragg,(n) del,t over all Monte Carlo realizations. This provides a realistic measure of achievable service under resource constraints.

  7. The AI system can maintain robust performance against pointing errors by jointly adapting beam-user matching and power allocation to dynamic channel variations. This is validated by simulation results showing that the NOMA-CBH scheme maintains a relatively stable sum rate even when the standard deviation of the pointing jitter increases.

Related papers