Index


Figures


Tables

Moon and Lee: Spot Beam Power Optimization for an Energy Efficient Multi-LEO Satellite Network

Jihwan Moon♦ and Hoon Lee°

Spot Beam Power Optimization for an Energy Efficient Multi-LEO Satellite Network

Abstract: This paper proposes a spot beam power control method for downlink non-terrestrial networks consisting of multiple low Earth orbit (LEO) satellites. Each designated ground access point (GAP) is continuously served by a steering beam from LEO satellites during their visibility period. We address the global energy efficiency (GEE) maximization task to determine the optimal tradeoff between the sum-rate and total power consumption of LEO satellites. The GEE maximization problem is formulated by taking the inter-beam, inter-carrier, and terrestrial network interference into account. To ease the complexity of the problem, we further simplify the expressions of the GEE and interference and then propose a successive convex approximation (SCA)-based spot beam power optimization method. Numerical results validate its effectiveness over baseline algorithms in different system setups.

Keywords: Satellite communications , non-terrestrial network , low earth orbit , energy efficiency , power optimization

Ⅰ. Introduction

The rapid evolution of wireless communications technologies has led to an increased focus on a nonterrestrial network (NTN) as a means to achieve global connectivity[1]. It is considered to be integral to the vision of ubiquitous coverage, especially in remote and underserved regions, beyond existing traditional terrestrial infrastructures for the upcoming sixth-generation (6G) standard[2]. Consequently, a vast number of researchers have begun to pay attention to addressing the unique challenges of NTNs[3].

Fundamental challenges in the management tasks of NTNs include propagation delays between satellites and ground access points (GAPs) and Doppler shifts stemming from the movement of satellites[4]. This entails the development of advanced optimization techniques tailored for NTNs. The integration of NTNs with terrestrial networks was explored in [5], emphasizing the role of beamforming and artificial intelligence technologies. The authors in [6] highlighted challenges in satellite beamforming and inter-satellite transmissions for radio resource management, mobility management, and dynamic network slicing. Also, [7] evaluated various multi-layered NTNs, offering guidelines on achieving a balance between system flexibility and network performance with coverage and latency constraints into consideration.

Meanwhile, energy efficiency has emerged as a critical performance measure in the design and operation of NTNs[8]. By optimizing power consumption, we can enhance the lifespan of satellite components and reduce operational costs. Various NTN management techniques, such as adaptive power control, energy- efficient routing algorithms, and dynamic resource allocation, have been proposed to address these challenges. In particular, [9] tackled energy efficiency maximization in multibeam satellite systems under total power and quality-of-service constraints. Precoding optimization algorithms were proposed based on zero forcing (ZF) and successive convex approximation (SCA), verified using real measured channel data. Furthermore, [10] investigated a two-step quadratic transformation method to address energy efficiency maximization in multibeam satellite communications. By converting the non-convex problem into an equivalent convex one, an alternating optimization algorithm can be derived that iteratively identifies effective networking solutions. In [11], an energy-efficient resource allocation in space-air-sea NTNs for maritime coverage was presented. A mixed-integer programming task was formulated which maximizes the system energy efficiency by jointly optimizing user equipment association, power control, and unmanned aerial vehicle (UAV) deployment. In addition, [12] maximized the global energy efficiency (GEE) of the whole NTN supporting multiple ground access points (GAPs) while accounting for various interference effects.

With the aid of machine learning, [13] assigned spreading factors (SFs) to end devices to minimize co- SF interference and enhance the energy efficiency. In addition, [14] explored the integration of open radio access network (O-RAN) within NTNs, focusing on optimizing the dynamic functional split between centralized units (CU) and distributed units (DU) to enhance energy efficiency. A deep Q-network method was employed, which dynamically determines the optimal network function split and selects the best NTN platform based on real-time conditions and traffic demands.

Most of the previous works considered a single satellite system. For this reason, these cannot scale effectively with the increasing number of satellites. To this end, our previous work[15] extended the single satellite system[12] to general multiple low Earth orbit (LEO) satellite NTNs and proposed the optimal GAP- beam assignment while assuming equal power allocation for all GAPs and beams. Such an approach has been shown to degrade the GEE performance. In particular, the GEE improvement with an increasing number of LEO satellites was marginal even though the system could exploit greater link diversity. This suggests that relying solely on GAP-beam assignment with fixed transmit power may be insufficient to effectively mitigate both inter-cell and intra-cell interference. Therefore, it is necessary to further investigate the impact of optimal downlink power control to fully leverage the benefits of multi-satellite configurations.

This paper presents an efficient algorithm for maximizing the GEE performance of multi-LEO satellite NTNs where several satellites support multiple GAPs in the downlink. We aim to optimize the spot beam power of LEO satellites considering practical challenges of NTNs such as inter-beam, inter-carrier, and terrestrial interference signals. We first construct the GEE maximization problem, which is proven to be non-convex. To handle this difficulty, the SCA technique is applied that addresses approximated convex tasks of the original non-convex GEE maximization problem. Numerical results validate the effectiveness of the proposed algorithm over baseline schemes.

Ⅱ. System Model

We consider a multi-LEO network illustrated in Fig. 1 where S satellites support K GAPs in the downlink. Each satellite projects at most M spot beams, and each GAP is assumed to be assigned to at most one spot beam. In terrestrial networks, B ground base stations (GBSs) share the same frequency spectrum with LEO satellites, e.g., Ku- or Ka-band of satellite communications and frequency range 2 of the fifth-generation (5G)[16], which interfere GAPs. The channel state information and locations of the GAPs and GBSs can be available at the satellites by the enhanced channel estimation and localization algorithms[ 12].

Fig. 1.

System model for multi-LEO networks
1.png

The signal-to-interference-plus-noise ratio (SINR) of GAP k on spot beam m of satellite s, denoted by [TeX:] $$\gamma_{k, m, s,}$$ can be expressed by

(1)
[TeX:] $$\gamma_{k, m, s}=\frac{G_{\mathrm{AP}, k} L_{k, s} G_{\mathrm{main}, s} P_{k, m, s}}{\mathrm{IBI}_{k, m, s}+\mathrm{ICI}_{k, m, s}+\sigma_{z, k}^2},$$

where [TeX:] $$G_{\text {main }, s} \text { and } G_{\mathrm{AP}, k}$$ denote the main lobe antenna gain of satellite s and antenna gain of GAP k, respectively, Pk,m,s indicates the transmit power allocated to spot beam m of satellite s for GAP k, [TeX:] $$L_{k, s}$$ denotes channel attenuation between GAP k and satellite s, and [TeX:] $$\sigma_{z, k}^2$$ stands for the noise variance at GAP k. In addition, [TeX:] $$\mathrm{IBI}_{k, m, s} \text { and } \mathrm{ICI}_{k, m, s}$$ account for the inter-beam interference (IBI) and inter-carrier interference (ICI) by the Doppler effect for GAP k on beam m of satellite s.

These interference terms are written by

(2)
[TeX:] $$\begin{gathered} \mathrm{IBI}_{k, m, s}=G_{\mathrm{AP}, k} \sum_{\substack{\left(k^{\prime}, m^{\prime}, s^{\prime}\right) \\ \neq(k, m, s)}} L_{k, s^{\prime}} G_{\text {side }, k, m^{\prime}, s^{\prime}} P_{k^{\prime}, m^{\prime}, s^{\prime}} x_{k^{\prime}, m^{\prime}, s^{\prime}}, \\ \end{gathered}$$

(3)
[TeX:] $$\mathrm{ICI}_{k, m, s}=G_{\mathrm{AP}, k} L_{k, s} G_{\mathrm{main}, s} P_{k, m, s}\left(1-\operatorname{sinc}^2\left(f_{k, s} T_{\mathrm{sym}}\right)\right),$$

where [TeX:] $$G_{\text {side }, \mathrm{X}, m, s}$$ accounts for the sidelobe antenna gain towards ground node X by beam m of satellite s, Tsym represents the symbol duration, and fk,s denotes the Doppler shift between GAP k and satellite s. Here, the Doppler shift is calculated as

(4)
[TeX:] $$f_{k, s}=\frac{v_s}{C} f_c \cos \phi_{k, s},$$

where [TeX:] $$v_s$$ equals the velocity of satellite s, [TeX:] $$C=3 \times 10^8 \mathrm{~m} / \mathrm{s}$$ is the speed of light, fc stands for the carrier frequency, C = 3 × 108 m/s is the speed of light, and [TeX:] $$\phi k, s$$ denotes the angle of the receiving direction of GAP k and moving direction of satellite s, respectively. Also, [TeX:] $$x_{k, m, s} \in\{0,1\}$$ in (2) stands for a binary indicator that equals 1 if spot beam m of satellite s is assigned to GAP k and 0 otherwise. The beam assignment is assumed to be fixed such that each beam is dedicated to a single GAP and vice versa. Thus, [TeX:] $$x_{k, m, s} \in\{0,1\}$$ is randomly chosen to satisfy

(5)
[TeX:] $$\sum_{s=1}^S \sum_{m=1}^M x_{k, m, s} \leq 1, \forall k=1, \ldots, K,$$

(6)
[TeX:] $$\sum_{k=1}^K x_{k, m, s} \leq 1, \forall m=1, \ldots, M \text { and } s=1, \ldots, S$$

(7)
[TeX:] $$\sum_{m=1}^M \sum_{k=1}^K x_{k, m, s} \leq M, \forall s=1, \ldots, S .$$

Notice that [TeX:] $$x_{k, m, s}$$ can be zero when the numbers of GAPs and beams are unequal.

Ⅲ. Problem Formulation

This section formalizes the GEE maximization task of the multi-LEO network. From the SINR (1), the achievable rate of GAP k on spot beam m of satellite s based on (1)-(3) is calculated as

(8)
[TeX:] $$R_{k, m, s}=\log _2\left(1+\gamma_{k, m, s}\right) .$$

By taking the binary beam assignment indicator [TeX:] $$x_{k, m, s}$$ into account, the sum-rate can be written by

(9)
[TeX:] $$R=\sum_{s=1}^S \sum_{m=1}^M \sum_{k=1}^K R_{k, m, s} x_{k, m, s} .$$

We adopt the power consumption model from [17]- [20] in which both static and dynamic components are considered. Concretely, static power consumption Pcircuit,s of satellite s is drawn even when the satellite is not actively transmitting data, often due to leakage Fig. 1. System model for multi-LEO networks currents and bias voltages within the circuitry. It is influenced by factors such as device technology, chip design, and operating conditions[21]. On top of that, dynamic power consumption occurs during active operations such as signal processing, modulation, and transmission. It is typically modelled to be proportional to the number of activated beams and a significant contributor to overall energy consumption[22]. This leads to the total power consumption of satellite s as

(10)
[TeX:] $$P_{\text {total, } s}=\underbrace{P_{\text {circuit, } s}}_{\text {static }}+\underbrace{\frac{1}{\rho_s} \sum_{m=1}^M \sum_{k=1}^K P_{k, m, s} x_{k, m, s}}_{\text {dynamic }},$$

where [TeX:] $$\rho_s \in(0,1]$$ indicates the efficiency of power conversion on satellite s.

Based on (8)-(10), the GEE η is defined as the ratio of the sum-rate to the total power consumption of all satellites, which can be expressed by

(11)
[TeX:] $$\eta=\frac{\sum_{s=1}^S \sum_{m=1}^M \sum_{k=1}^K R_{k, m, s} x_{k, m, s}}{\sum_{s=1}^S\left(P_{\text {circuit }, s}+\frac{1}{\rho_s} \sum_{m=1}^M \sum_{k=1}^K P_{k, m, s} x_{k, m, s}\right)} .$$

Our objective is to maximize the GEE by optimizing the spot beam power allocation variables [TeX:] $$\left\{P_{k, m, s}\right\}$$ for given GAP-beam-satellite assignment [TeX:] $$\left\{x_{k, m, s}\right\}$$. The corresponding optimization task can be formulated as

(12a)
[TeX:] $$\text { (P1): } \max _{\left\{P_{k, m, s}\right\}} \eta$$

(12b)
[TeX:] $$\text { subject to: } \sum_{m=1}^M \sum_{k=1}^K P_{k, m, s} x_{k, m, s} \leq \bar{P}_{\mathrm{sat}, s}, \forall s,$$

(12c)
[TeX:] $$\sum_{k=1}^K P_{k, m, s} x_{k, m, s} \leq \bar{P}_{m, s}, \forall m, s,$$

(12d)
[TeX:] $$\mathrm{TNI}_b \leq \mathrm{TNI}_{\max }, \forall b=1, \ldots, B,$$

where [TeX:] $$\mathrm{TNI}_b$$ stands for the terrestrial network interference towards GBS b, defined as

(13)
[TeX:] $$\mathrm{TNI}_b=G_{\mathrm{BS}, b} \sum_{s=1}^S L_{b, s} \sum_{m=1}^M G_{\text {side }, b, m, s} \sum_{k=1}^K P_{k, m, s} x_{k, m, s},$$

Constraint (12b) ensures that the total spot beam power of satellite s does not exceed its power budget [TeX:] $$\bar{P}_{\mathrm{sat}, s},$$ and (12c) limits the power allocated to spot beam m of satellite s by the peak beam power constraint [TeX:] $$\bar{P}_{m, s}.$$ Also, constraint (12d) guarantees the terrestrial network interference for every GBS is under the maximum allowable level [TeX:] $$\mathrm{TNI}_{\max } .$$

It can be shown that the objective function in (P1) is non-convex with respect to the spot beam power variables, mainly due to mutual coupling in a complicated way. In the subsequent section, we first reformulate the problem into a more tractable form and then propose efficient optimization strategies.

Ⅳ. Proposed Solutions

4.1 Problem Reformulation

This section presents solution approaches for addressing the non-convex GEE maximization problem in (P1). To this end, we first simplify it by applying the change of variables. Without loss of generality, we rearrange the indices of all spot beams as an integer set [TeX:] $$\mathscr{M}=[1, S M],$$ where [TeX:] $$[a, b] \triangleq\{a, a+1, \ldots, b-1, b\}$$ indicates a set of integers between a and b. Then, the spot beams of satellite s can be represented by a set [TeX:] $$\mathscr{M}_s \triangleq[(s-1) M+1, s M] \subset \mathscr{M} .$$ As a result, the power allocation variables [TeX:] $$\left\{P_{k, m, s}\right\}$$ and the constants [TeX:] $$\left\{\boldsymbol{x}_{k, m, s}\right\}$$ can be equivalently converted into [TeX:] $$\left\{P_{k, \tilde{m}}\right\} \text { and }\left\{x_{k, \tilde{m}}\right\},$$ which are respectively defined as

(14)
[TeX:] $$\begin{aligned} P_{k, \tilde{m}} & \triangleq P_{k, \tilde{m}-(s-1) M, s}, \forall \tilde{m} \in \mathscr{M}_s, s=1, \ldots, S \\ & =P_{k, \tilde{m}-\left(\left\lceil\frac{\tilde{m}}{M}\right\rceil-1\right) M,\left\lceil\frac{\tilde{m}}{M}\right\rceil}, \forall \tilde{m} \in \mathscr{M}, \end{aligned}$$

(15)
[TeX:] $$\begin{aligned} x_{k, \tilde{m}} & \triangleq x_{k, \tilde{m}-(s-1) M, s}, \forall \tilde{m} \in \mathscr{M}_s, s=1, \ldots, S \\ & =x_{k, \tilde{m}-\left(\left\lceil\frac{\tilde{m}}{M}\right\rceil-1\right) M,\left\lceil\frac{\tilde{m}}{M}\right\rceil}, \forall \tilde{m} \in \mathscr{M} . \end{aligned}$$

It is worth noting that the new index [TeX:] $$\tilde{m}$$ ranges from 1 to SM, and it virtually combines the multiple satellites into a single satellite projecting at most S groups of M beams. Similarly, we can newly define the following quantities:

(16)
[TeX:] $$\begin{aligned} \bar{P}_{\tilde{m}} & \triangleq \bar{P}_{\tilde{m}-(s-1) M, s}, \forall \tilde{m} \in \mathscr{M}_s \text { and } s=1, \ldots, S \\ & =\bar{P}_{\tilde{m}-\left(\left\lceil\frac{\tilde{m}}{M}\right\rceil-1\right) M,\left\lceil\frac{\tilde{m}}{M}\right\rceil}, \forall \tilde{m} \in \mathscr{M}, \end{aligned}$$

(17)
[TeX:] $$\begin{aligned} \tilde{L}_{k, \tilde{m}} & \triangleq L_{k, s}, \forall \tilde{m} \in \mathscr{M}_s \text { and } s=1, \ldots, S \\ & =L_{k,\left\lceil\frac{\tilde{m}}{M}\right\rceil}, \forall \tilde{m} \in \mathscr{M}, \end{aligned}$$

(18)
[TeX:] $$\begin{aligned} \tilde{L}_{b, \tilde{m}} & \triangleq L_{b, s}, \forall \tilde{m} \in \mathscr{M}_s \text { and } s=1, \ldots, S \\ & =L_{b,\left\lceil\frac{\tilde{m}}{M}\right\rceil}, \forall \tilde{m} \in \mathscr{M}, \end{aligned}$$

(19)
[TeX:] $$\begin{aligned} \tilde{G}_{\text {main }, \tilde{m}} & \triangleq G_{\text {main }, s}, \forall \tilde{m} \in \mathscr{M}_s \text { and } s=1, \ldots, S \\ & =G_{\text {main },\left\lceil\frac{\tilde{m}}{M}\right\rceil}, \forall \tilde{m} \in \mathscr{M}, \end{aligned}$$

(20)
[TeX:] $$\begin{aligned} \tilde{G}_{\text {side }, k, \tilde{m}} & \triangleq \tilde{G}_{\text {side }, k, \tilde{m}-(s-1) M, s}, \forall \tilde{m} \in \mathscr{M}_s, s=1, \ldots, S \\ & =\tilde{G}_{\text {side }, k, \tilde{m}-\left(\left\lceil\frac{\tilde{m}}{M}\right\rceil-1\right) M,\left\lceil\frac{\tilde{m}}{M}\right\rceil}, \forall \tilde{m} \in \mathscr{M}, \end{aligned}$$

(21)
[TeX:] $$\begin{aligned} \tilde{G}_{\text {side }, b, \tilde{m}} & \triangleq \tilde{G}_{\text {side }, b, \tilde{m}-(s-1) M, s}, \forall \tilde{m} \in \mathscr{M}_s, s=1, \ldots, S \\ & =\tilde{G}_{\text {side }, b, \tilde{m}-\left(\left\lceil\frac{\tilde{m}}{M}\right\rceil-1\right) M,\left\lceil\frac{\tilde{m}}{M}\right\rceil}, \forall \tilde{m} \in \mathscr{M}, \end{aligned}$$

(22)
[TeX:] $$\begin{aligned} \tilde{f}_{k, \tilde{m}} & \triangleq f_{k, s}, \forall \tilde{m} \in \mathscr{M}_s \text { and } s=1, \ldots, S \\ & =f_{k,\left\lceil\frac{\tilde{m}}{M}\right\rceil}, \forall \tilde{m} \in \mathscr{M}, \end{aligned}$$

(23)
[TeX:] $$\begin{aligned} \tilde{\rho}_{\tilde{m}} & \triangleq \rho_s, \forall \tilde{m} \in \mathscr{M}_s \text { and } s=1, \ldots, S \\ & =\rho_{\lceil\tilde{M}\rceil}, \forall \tilde{m} \in \mathscr{M} . \end{aligned}$$

We next re-express the (P1) in terms of (14)-(23) as

(24a)
[TeX:] $$\text { (P2): } \max _{\left\{P_{k, \tilde{m}}\right\}} \eta$$

(24b)
[TeX:] $$\text { subject to: } \sum_{\tilde{m} \in \mathscr{M}_s} \sum_{k=1}^K P_{k, \tilde{m}} \leq \bar{P}_{\mathrm{sat}, s}, \forall s \text {, }$$

(24c)
[TeX:] $$\sum_{k=1}^K P_{k, \tilde{m}} \leq \bar{P}_{\tilde{m}}, \forall \tilde{m}$$

(24d)
[TeX:] $$\mathrm{TNI}_b \leq \mathrm{TNI}_{\max }, \forall b=1, \ldots, B,$$

with modified η and [TeX:] $$\mathrm{TNI}_b$$ as

(25)
[TeX:] $$\eta=\frac{\sum_{\tilde{m}=1}^{S M} \sum_{k=1}^K R_{k, \tilde{m}} x_{k, \tilde{m}}}{\sum_{s=1}^S\left(P_{\text {circuit }, s}+\sum_{\tilde{m} \in \mathscr{M}_s} \frac{1}{\tilde{\rho}_{\tilde{m}}} \sum_{k=1}^K P_{k, \tilde{m}} x_{k, \tilde{m}}\right)},$$

(26)
[TeX:] $$\mathrm{TNI}_b=G_{\mathrm{BS}, b} \sum_{\tilde{m}=1}^{S M} \tilde{L}_{b, \tilde{m}} \tilde{G}_{\text {side }, b, \tilde{m}} \sum_{k=1}^K P_{k, \tilde{m}} x_{k, \tilde{m}},$$

where

(27)
[TeX:] $$\mathrm{IBI}_{k, \tilde{m}}=G_{\mathrm{AP}, k} \sum_{\tilde{m}^{\prime} \neq \tilde{m}} \sum_{k^{\prime} \neq k} \tilde{L}_{k, \tilde{m}^{\prime}} \tilde{G}_{\text {side }, k, \tilde{m}^{\prime}} P_{k^{\prime}, \tilde{m}^{\prime}} x_{k^{\prime}, \tilde{m}^{\prime}},$$

(28)
[TeX:] $$\mathrm{ICI}_{k, \tilde{m}}=G_{\mathrm{AP}, k} \tilde{L}_{k, \tilde{m}} \tilde{G}_{\mathrm{main}, \tilde{m}} P_{k, \tilde{m}}\left(1-\operatorname{sinc}^2\left(\tilde{f}_{k, \tilde{m}} T_{\mathrm{sym}}\right)\right),$$

(29)
[TeX:] $$\gamma_{k, \tilde{m}}=\frac{G_{\mathrm{AP}, k} \tilde{L}_{k, \tilde{m}} \tilde{G}_{\mathrm{main}, \tilde{m}} P_{k, \tilde{m}}}{\mathrm{IBI}_{k, \tilde{m}}+\mathrm{ICI}_{k, \tilde{m}}+\sigma_{z, k}^2},$$

(30)
[TeX:] $$R_{k, \tilde{m}}=\log _2\left(1+\gamma_{k, \tilde{m}}\right) .$$

Furthermore, since GAP k is paired with a unique and exclusive spot beam ??????, we can define the effective spot beam power as

(31)
[TeX:] $$P_{\tilde{m}} \triangleq \sum_{k=1}^K P_{k, \tilde{m}}=\sum_{k=1}^K P_{k, \tilde{m}} x_{k, \tilde{m}}$$

Also, let [TeX:] $$\mathscr{A} \triangleq\left\{(k, \tilde{m}) \mid x_{k, \tilde{m}}=1, \forall k, \tilde{m}\right\}$$ and [TeX:] $$\mathscr{A}_{\text {beam }} \triangleq \left\{\tilde{m} \mid x_{k, \tilde{m}}=1, \forall k, \tilde{m}\right\}$$ be the sets of active GAP-spot beam pairs and active spot beams, respectively. Consequently, (25)-(29) can be further simplified into

(32)
[TeX:] $$\eta=\frac{\sum_{(k, \tilde{m}) \in \mathscr{A}} R_{k, \tilde{m}}}{\sum_{s=1}^S P_{\text {circuit }, s}+\sum_{\tilde{m} \in \mathscr{A}_{\text {beam }}} \frac{1}{\tilde{\rho}_{\tilde{m}}} P_{\tilde{m}}},$$

(33)
[TeX:] $$\mathrm{TNI}_b=G_{\mathrm{BS}, b} \sum_{\tilde{m} \in \mathscr{A}_{\text {beam }}} \tilde{L}_{b, \tilde{m}} \tilde{G}_{\text {side }, b, \tilde{m}} P_{\tilde{m}},$$

(34)
[TeX:] $$\mathrm{IBI}_{k, \tilde{m}}=G_{\mathrm{AP}, k} \sum_{\tilde{m}^{\prime} \in \mathscr{A} \text { heam }, \tilde{m}^{\prime} \neq \tilde{m}} \tilde{L}_{k, \tilde{m}^{\prime}} \tilde{G}_{\text {side }, k, \tilde{m}^{\prime}} P_{\tilde{m}^{\prime}},$$

(35)
[TeX:] $$\mathrm{ICI}_{k, \tilde{m}}=G_{\mathrm{AP}, k} \tilde{L}_{k, \tilde{m}} \tilde{G}_{\mathrm{main}, \tilde{m}} P_{\tilde{m}}\left(1-\operatorname{sinc}^2\left(\tilde{f}_{k, \tilde{m}} T_{\mathrm{sym}}\right)\right),$$

(36)
[TeX:] $$\gamma_{k, \tilde{m}}=\frac{G_{\mathrm{AP}, k} \tilde{L}_{k, \tilde{m}} \tilde{G}_{\mathrm{main}, \tilde{m}} P_{\tilde{m}}}{\mathrm{IBI}_{k, \tilde{m}}+\mathrm{ICI}_{k, \tilde{m}}+\sigma_{z, k}^2} .$$

Based on these results, (P2) can be equivalently transformed as

(37a)
[TeX:] $$\text { (P3): } \max _{\left\{P_{\tilde{m}} \mid \tilde{m} \in \mathscr{A}_{\text {beam }}\right\}} \eta,$$

(37b)
[TeX:] $$\text { subject to: } \sum_{\tilde{m} \in \mathscr{A}_{\text {beam }} \cap \mathscr{M}_s} P_{\tilde{m}} \leq \bar{P}_{\text {sat }, s}, \forall s \text {, }$$

(37c)
[TeX:] $$P_{\tilde{m}} \leq \bar{P}_{\tilde{m}}, \forall \tilde{m} \in \mathscr{A}_{\text {beam }},$$

(37d)
[TeX:] $$\mathrm{TNI}_b \leq \mathrm{TNI}_{\max }, \forall b=1, \ldots, B .$$

Compared to (P1) which consists of KMS optimization variables [TeX:] $$\left\{P_{k, m, s}\right\}$$, (P3) now contains [TeX:] $$\left|\mathscr{A}_{\text {beam }}\right|=\min (K S, M S)\lt K M S$$ variables, thereby reducing the problem complexity. Still, however, (P3) invokes the non-convex fractional form in the objective function (37a). Therefore, it is highly difficult to identify the globally optimal solution to (P3) using off-the-shelf convex optimization software.

4.2 Proposed Algorithm

We propose an efficient optimization algorithm that tackles the non-convexity of (P3). We first reformulate it by introducing an auxiliary variable λ as

(38a)
[TeX:] $$\text { (P4): } \max _{\left\{P_{\tilde{m}} \mid \tilde{m} \in \mathscr{A}_{\text {beam }}\right\}, \lambda} \lambda,$$

(38b)
[TeX:] $$\begin{aligned} &\text { subject to: }\\ &\sum_{(k, \tilde{m}) \in \mathscr{A}} R_{k, \tilde{m}}-\lambda\left(\sum_{s=1}^S P_{\text {circuit }, s}+\sum_{\tilde{m} \in \mathscr{A}_{\text {beam }}} \frac{1}{\tilde{\rho}_{\tilde{m}}} P_{\tilde{m}}\right) \geq 0, \end{aligned}$$

(38c)
[TeX:] $$\sum_{\tilde{m} \in \mathscr{A}_{\text {beam }} \cap \mathscr{M}_s} P_{\tilde{m}} \leq \bar{P}_{\mathrm{sat}, s}, \forall s,$$

(38d)
[TeX:] $$P_{\tilde{m}} \leq \bar{P}_{\tilde{m}}, \forall \tilde{m} \in \mathscr{A}_{\text {beam }},$$

(38e)
[TeX:] $$\mathrm{TNI}_b \leq \mathrm{TNI}_{\max }, \forall b=1, \ldots, B .$$

It is readily seen that any [TeX:] $$\lambda \in[0, \hat{\lambda}]$$ is feasible for any feasible [TeX:] $$\hat{\lambda}$$ for (P4). This enables the use a two-layer optimization approach, in which an optimal [TeX:] $$\lambda^{\star}$$ for (P4) is found by the bisection method in the outer layer, while a feasible set of [TeX:] $$\left\{P_{\tilde{m}} \mid \tilde{m} \in \mathscr{A}_{\text {beam }}\right\}$$ is identified with each fixed λ in the inner layer.

It is not difficult to see that the feasible set [TeX:] $$\left\{P_{\tilde{m}} \mid \tilde{m} \in \mathscr{A}_{\text {beam }}\right\}$$ can be attained by determining the maximum of the left-hand side of constraint (38b). Therefore, in the inner layer, we solve the following optimization problem for a given λ :

(39a)
[TeX:] $$\begin{aligned} &\text { (P4-inner): }\\ &\max _{\left\{P_{\tilde{m}} \mid \tilde{m} \in \mathscr{A}_{\text {beam }}\right\}} \sum_{(k, \tilde{m}) \in \mathscr{A}} R_{k, \tilde{m}}-\lambda\left(\sum_{s=1}^S P_{\text {circuit }, s}+\sum_{\tilde{m} \in \mathscr{A}_{\text {beam }}} \frac{1}{\tilde{\rho}_{\tilde{m}}} P_{\tilde{m}}\right), \end{aligned}$$

(39b)
[TeX:] $$\text { subject to: } \sum_{\tilde{m} \in \mathscr{A}_{\text {beam }} \cap \mathscr{M}_s} P_{\tilde{m}} \leq \bar{P}_{\text {sat }, s}, \forall s,$$

(39c)
[TeX:] $$P_{\tilde{m}} \leq \bar{P}_{\tilde{m}}, \forall \tilde{m} \in \mathscr{A}_{\text {beam }},$$

(39d)
[TeX:] $$\mathrm{TNI}_b \leq \mathrm{TNI}_{\max }, \forall b=1, \ldots, B .$$

The existence of feasible [TeX:] $$\left\{P_{\tilde{m}} \mid \tilde{m} \in \mathscr{A}_{\text {beam }}\right\}$$ for a certain λ is easily determined if the optimal value of (P4-inner) is greater than or equal to 0. Otherwise, it indicates that λ should be decreased in the outer bisection layer.

Unfortunately, the log-minus-log form of [TeX:] $$R_{k, \tilde{m}}$$ with respect to [TeX:] $$\left\{P_{\tilde{m}} \mid \tilde{m} \in \mathscr{A}_{\text {beam }}\right\}$$ in (39a) exhibits nonconvexity, making (P4-inner) difficult to handle in the current form. Hence, we resort to the SCA technique which iteratively addresses convex-approximated tasks of the original formulation (P4-inner)[23]. Let us define the solution vector p and a function [TeX:] $$g_{l, \tilde{m}}(\mathbf{p})$$ as

(40)
[TeX:] $$\mathbf{p} \triangleq\left[P_{\tilde{m}_{\min }} \cdots P_{\tilde{m}_{\max }}\right]^T,$$

(41)
[TeX:] $$g_{k, \tilde{m}}(\mathbf{p}) \triangleq \log _2\left(\mathrm{IBI}_{k, \tilde{m}}+\mathrm{ICI}_{k, \tilde{m}}+\sigma_{z, k}^2\right),$$

with [TeX:] $$\tilde{m}_{\min } \triangleq \min _{\tilde{m} \in \mathscr{A}_{\text {beam }}} \tilde{m} \text { and } \tilde{m}_{\max } \triangleq \max _{\tilde{m} \in \mathscr{A}_{\text {beam }}} \tilde{m} .$$ According to the first-order Taylor expansion, an approximated convex expression of Rk,mリ at a given solution p0 can be written by

(42)
[TeX:] $$\begin{aligned} R_{k, \tilde{m}}= & \log _2\left(G_{\mathrm{AP}, k} \tilde{L}_{k, \tilde{m}} \tilde{G}_{\operatorname{main}, \tilde{m}} P_{\tilde{m}}+\mathrm{IBI}_{k, \tilde{m}}+\mathrm{ICI}_{k, \tilde{m}}+\sigma_{z, k}^2\right) \\ & -g_{k, \tilde{m}}(\mathbf{p}) \\ \simeq & \log _2\left(G_{\mathrm{AP}, k} \tilde{L}_{k, \tilde{m}} \tilde{G}_{\operatorname{main}, \tilde{m}} P_{\tilde{m}}+\mathrm{IBI}_{k, \tilde{m}}+\mathrm{ICI}_{k, \tilde{m}}+\sigma_{z, k}^2\right) \\ & -\left(g_{k, \tilde{m}}\left(\mathbf{p}_0\right)+\operatorname{vec}\left(\left.\frac{\partial g_{k, \tilde{m}}(\mathbf{p})}{\partial \mathbf{p}}\right|_{\mathbf{p}=\mathbf{p}_0}\right)^T\left(\mathbf{p}-\mathbf{p}_0\right)\right), \\ \triangleq & \tilde{R}_{k, \tilde{m}} . \end{aligned}$$

As a consequence, the convex approximated inner layerproblem (P4-inner) is formulated as

(43a)
[TeX:] $$\begin{aligned} &\text { (P4-inner-SCA): }\\ &\max _{\left\{P_{\tilde{m}} \mid \tilde{m} \in \mathscr{A}_{\text {beam }}\right.} \sum_{(k, \tilde{m}) \in \mathscr{A}} \tilde{R}_{k, \tilde{m}}-\lambda\left(\sum_{s=1}^S P_{\text {circuit }, s}+\sum_{\tilde{m} \in \mathscr{A}_\text{beam}} \frac{1}{\tilde{\rho}_{\tilde{m}}} P_{\tilde{m}}\right) \end{aligned}$$

(43b)
[TeX:] $$\text { subject to: } \sum_{\tilde{m} \in \mathscr{A}_{\text {beam }} \cap \mathscr{M}_s} P_{\tilde{m}} \leq \bar{P}_{\text {sat }, s}, \forall s \text {, }$$

(43c)
[TeX:] $$P_{\tilde{m}} \leq \bar{P}_{\tilde{m}}, \forall \tilde{m} \in \mathscr{A}_{\text {beam }},$$

(43d)
[TeX:] $$\mathrm{TNI}_b \leq \mathrm{TNI}_{\max }, \forall b=1, \ldots, B .$$

Problem (P4-inner-SCA) now becomes convex, which can be easily tackled using existing convex solvers, e.g., CVXPY[24].

We summarize the proposed spot beam power allocation algorithm in Algorithm 1. As discussed, the overall procedure consists of the outer layer for obtaining λ using the bisection method and the inner layer addressing (P4-inner) using the SCA algorithm. We first initialize the power allocation solution [TeX:] $$\mathbf{p}_0$$ and the bound of [TeX:] $$\lambda \in\left[\lambda_{\mathrm{LB}}, \lambda_{\mathrm{UB}}\right] .$$ Also, we set the tolerance δ and the number of maximum iterations of the inner layer [TeX:] $$I_{\max } .$$ At each iteration of the outer layer, a new λ is set to the median of the predetermined bound as [TeX:] $$\lambda \leftarrow \frac{\lambda_{\mathrm{LB}}+\lambda_{\mathrm{UB}}}{2} .$$ Then, the SCA algorithm is adopted which solves (P4-inner-SCA) repeatedly. Denoting [TeX:] $$\tilde{\eta}$$ as the optimal value of (P4-inner-SCA) at the convergence, the bisection method is employed to update the lower and upper bounds of λ . Such a procedure is repeated until λ converges within the predefined tolerance δ.

Algorithm 1
Spot Beam Power Optimization
pseudo1.png

Ⅴ. Numerical Results

We evaluate the proposed spot beam power optimization algorithm through numerical simulations. We incorporate the rain fading model for satellite-toground links as specified in [25], [26]. Thus, the small- scale fading component between ground node X and satellite s is modeled as

(44)
[TeX:] $$\tilde{h}_{\mathrm{X}, s}=\sqrt{\xi} \exp (-j \phi),$$

where ξ denotes the small-scale channel gain whose dB scale value [TeX:] $$\xi_{\mathrm{dB}}=20 \log _{10}(\xi)$$ follows the log-normal distribution with mean μ and variance [TeX:] $$\sigma^2,$$ i.e., [TeX:] $$\ln \left(\xi_{\mathrm{dB}}\right) \sim \mathscr{N}(\mu, \sigma), \text { and } \phi \sim \mathscr{U}(0,2 \pi)$$ stands for the random phase changes. Notice that the parameters μ and σ depend on environmental factors such as receiver location, operation frequency, polarization, and the elevation angle towards the satellite. The overall channel attenuation, denoted by [TeX:] $$L_{X, s,}$$ is then calculated as [12]

(45)
[TeX:] $$L_{X, s}=\left(\frac{c}{4 \pi f_c d_{\mathrm{Xs}}}\right)^2\left|\tilde{h}_k\right|^2,$$

where [TeX:] $$d_{Xs}$$ indicates the distance between ground node X and satellite s.

We adopt the satellite antenna gain model described in ITU-R S.672-4 as

(46)
[TeX:] $$\begin{aligned} & G_{\text {sat }}\left(\theta_{\mathrm{X}, m, s}\right) \\ & = \begin{cases}\bar{G}_{\text {sat }, m, s}, & \text { if } \theta_{\mathrm{X}, m, s} \leq \bar{\theta}_{m, s} \\ \bar{G}_{\text {sat }, m, s}-3\left(\frac{\theta_{\mathrm{X}, m, s}}{\bar{\theta}_{m, s}}\right)^\alpha, & \text { if } \bar{\theta}_{m, s}\lt \theta_{\mathrm{X}, m, s} \leq a \bar{\theta}_{m, s} \\ \bar{G}_{\text {sat }, m, s}+\Psi, & \text { if } a \bar{\theta}_{m, s}\lt \theta_{\mathrm{X}, m, s} \leq b \bar{\theta}_{m, s}, \\ \bar{G}_{\text {sat }, m, s}+\Psi+20 & \\ -25 \log _{10}\left(\frac{\theta_{\mathrm{X}, m, s}}{\bar{\theta}_{m, s}}\right), & \text { if } b \bar{\theta}_{m, s}\lt \theta_{\mathrm{X}, m, s} \leq \check{\theta}_{m, s}, \\ 0, & \text { if } \check{\theta}_{m, s}\lt \theta_{\mathrm{X}, m, s},\end{cases} \end{aligned}$$

in dBi where [TeX:] $$\theta_{\mathrm{X}, m, s}$$ indicates the angle between ground node X and the direction of beam m from satellite s, [TeX:] $$\bar{G}_{\mathrm{sat}, m, s}$$ denotes the maximum main lobe gain of beam m at satellite s,[TeX:] $$\bar{\theta}_{m, s}$$ signifies the angle at which the gain falls 3 dB below the maximum, [TeX:] $$\check{\theta}_{m, s}$$ marks the angle at which the third equation in (46) becomes 0 dBi, and Ψ determines the required near-in-side-lobe level relative to peak gain[27]. In this work, we set [TeX:] $$\alpha=2 a=2.58, b=6.32, \Psi=-20, G_{\text {main }, s}=\bar{G}_{\text {sat }, m, s} \forall m,$$ s[25], [TeX:] $$G_{\text {side }, \mathrm{X}, m, s}=G_{\text {sat }}\left(\theta_{\mathrm{X}, m, s}\right), \quad \forall \mathrm{X}, m, s \text {, and } \bar{\theta}_{\mathrm{X}, m} =0.5^{\circ}, \forall \mathrm{X},$$ m[28].

It is assumed that [TeX:] $$K_s$$ ground terminals are randomly located within a horizontal range of [TeX:] $$d_{\mathrm{X}, s}$$ from satellite s. The satellites are positioned in a circular formation with radius [TeX:] $$r_s$$ from the origin, each separated by angle [TeX:] $$\theta_s=2 \pi / S .$$ System parameters are set as outlined in Table 1, unless otherwise stated. Fig. 2 illustrates an example of node placement when [TeX:] $$K_s=10,$$ B = 10, and S = 3.

Table 1.

System setup
Parameter Setting Parameter Setting
B 28 MHz [TeX:] $$f_c$$ 20 GHz
[TeX:] $$T_{\text {sym }}$$ [TeX:] $$1 \mu \mathrm{~s}$$ h 780 km
[TeX:] $$v_s$$ 7.46 km/s S 3
[TeX:] $$K_s$$ 10 B 10
M [TeX:] $$K_s$$ [TeX:] $$d_{Xs}$$ 2500 km
[TeX:] $$\bar{G}_{\text {sat }, m, s}$$ 52.1 dB [TeX:] $$\mathrm{G}_{\text {side }, \mathrm{X}, \mathrm{~m}, \mathrm{~s}}$$ [TeX:] $$\mathrm{G}_{\text {sat }}\left(\theta^{\mathrm{X}, \mathrm{~m}, \mathrm{~s}}\right) \mathrm{dBi}$$
[TeX:] $$G_{\mathrm{BS}, b}$$ 5 dB [TeX:] $$\mathrm{G}_{\mathrm{AP}, \mathrm{k}}$$ U(10, 15) dB
[TeX:] $$\bar{P}_{m, s}$$ 20 dBW [TeX:] $$\bar{P}_{\text {sat, } s}$$ 20 dBW
[TeX:] $$\mathrm{TNI}_{\max }$$ -111 dB [TeX:] $$P_{\text {circuit }, s}$$ 10 dBW
[TeX:] $$\rho_s$$ 0.8 [TeX:] $$\sigma_{z, k}^2$$ −174 dBW/Hz
μ -2.6 dB σ 1.6 dB
[TeX:] $$r_s$$ 2500 km [TeX:] $$\sigma$$ [TeX:] $$2 \pi / \mathrm{S}$$

Fig. 2.

An example of node placement with [TeX:] $$K_s=10$$(○) B = 10(□), and S = 3(▵) where the numeric marker indicates the associated satellite index
2.png

For comparison, we consider the following baseline methods that address the inner layer problem (P4- inner).

· Sequential least squares programming (SLSQP)[29]: This method solves a sequence of quadratic subproblems to handle nonlinear optimization problems with both equality and inequality constraints.

· Trust-region algorithm for constrained optimization (Trust-constr )[30]: We leverage a trust- region interior point approach, introducing slack variables and solving a sequence of equality- constrained barrier problems with decreasing barrier parameters.

· Equal power allocation (EPA)[15]: From (24b)- (24d), we consider the following equally distributed power allocation as

(47)
[TeX:] $$\begin{aligned} & P_{\tilde{m}}=\min \left\{\frac{\min _s \bar{P}_{\mathrm{sat}, s}}{M}, \min _{\tilde{m}} \bar{P}_{\tilde{m}},\right. \\ & \left.\frac{\operatorname{TNI}_{\max }}{\left(\max _b G_{\mathrm{BS}, b}\right)\left(\max _{\tilde{m}} \tilde{L}_{b, \tilde{m}} \tilde{G}_{\mathrm{side}, b, \tilde{m}}\right) S M}\right\}, \forall \tilde{m}, \end{aligned}$$

which can be verified to be always feasible.

Fig. 3 shows the average GEE as a function of the number of satellites S for different number of GAPs per satellite Ks with random spot beam-GAP assignment. The proposed SCA-based algorithm clearly out- performs the baseline algorithms for all S and Ks . We also observe that the GEE generally improves with higher S in most schemes except for the equal power allocation (EPA) strategy. This implies that the adjustment of spot beam power becomes even more important when there are more number of satellites. The figure also shows that the GEE increases with Ks for every scheme. This performance gain stems from the increased diversity in the channel links.

Fig. 4 compares the average GEE in terms of the number of GAPs per satellite Ks with different number of satellites S. We first note that the proposed SCA method provides the highest η across all values of S and Ks , which emphasizes the effectiveness over other algorithms. While the GEE of the schemes that optimize the spot beam power increases for different S, it is the opposite for the EPA strategy. This is in line with our interpretation in Fig. 3.

Fig. 3.

GEE versus the number of satellites
3.png

Fig. 4.

GEE versus the number of GAPs per satellite
4.png

Fig. 5 compares the average GEE performance by varying the maximum main lobe gain [TeX:] $$\bar{G}_{\mathrm{sat}, m, s} .$$ The GEE of all schemes gradually increases as [TeX:] $$\bar{G}_{\mathrm{sat}, m, s}$$ grows since the desired signal power gets larger. The proposed SCA method outperforms other benchmark schemes regardless of [TeX:] $$\bar{G}_{\mathrm{sat}, m, s}.$$ The gain is particularly significant in the high main lobe gain regime, where the interference management becomes more important. Thus, it can be concluded that the proposed approach is efficient in handling interference through optimized power allocation strategies.

Fig. 5.

GEE versus the maximum main lobe gain of beams at satellites
5.png

Fig. 6 examines the average GEE with respect to the power budget [TeX:] $$\bar{P}_{\mathrm{sat}, s}=\bar{P}_{m, s} .$$ We can first see that the proposed SCA exhibits the highest GEE performance compared to benchmark schemes. The optimization- based schemes including the SCA, SLSQP, and Trust- constr converge to specific GEE values as the transmit power gets larger. This is because the increase in the IBI and ICI limits the sum-rate per unit power consumption. Therefore, in terms of the GEE performance, it is beneficial not to exhaust all the available power budget. Since the EPA always utilizes the total power constraint, its GEE performance decreases after a certain power. This demonstrates the necessity of the power control algorithms for maximizing the GEE in the multi-LEO satellite networks.

Fig. 6.

GEE versus the peak beam power of satellites
6.png

Fig. 7 presents the average GEE with respect to the static circuit power [TeX:] $$P_{\text {circuit, } s}.$$ It is clear that the GEE monotonically decreases with [TeX:] $$P_{\text {circuit, } s}.$$ The proposed SCA is superior to other baseline schemes, proving its effectiveness for arbitrary static circuit power consumption.

Fig. 7.

GEE versus the static circuit power at satellites
7.png

Fig. 8 investigates the average GEE as a function of the velocity of satellites vs . We observe that a faster movement of satellites degrades the GEE performance due to the increase in the ICI. Moreover, the proposed SCA algorithm outperforms all the other compared schemes. Thus, it is concluded that the proposed approach is effective for any given satellite mobility.

Fig. 8.

GEE versus the velocity of satellites
8.png

Ⅵ. Conclusion

In this paper, we studied a spot beam power control of multiple LEO satellites for downlink transmission. To be specific, we optimized the sum-rate and total power consumption to maximize the GEE of the satellites, each of which supports associated GAPs. We first formulated a GEE maximization problem taking all the inter-beam, inter-carrier, and terrestrial network interference into account. To ease the complexity of the problem, we further simplified the expressions of the GEE and interference and then proposed a SCAbased spot beam power optimization method. Numerical results validated its effectiveness over baseline algorithms in different system setups.

To further enhance the GEE performance, a joint optimization of GAP-beam-LEO satellite scheduling and spot beam power control can be an interesting extension. We can also delve into dynamic scenarios with temporal variations in GAP locations and service demands, which lead to imperfect and outdated channel state information at the satellites. Considering the load of inter-satellite link (ISL) message exchange and developing a decentralized control of multiple LEO satellites can also be a potential future work.

Biography

Jihwan Moon

Feb. 2014:B.Eng., Department of Electrical Engineering, Korea University, the Re- public of Korea

Feb. 2019: Ph.D., Department of Electrical Engineering, Korea University, the Re- public of Korea

Feb. 2012: B.S., Department of Electrical Engin- eering, Korea University, the Republic of Korea

Feb. 2017: Ph.D., Department of Electrical Engin- eering, the Republic of Korea

Jan. 2018~Mar. 2018:Visiting research student, King’s College London, the United Kingdom

Mar. 2019~Jul. 2019:Postdoctoral research asso- ciate, Research Institute for Information and Communication Technology (RICT), Korea University, the Republic of Korea

Jul. 2019 ~Aug. 2020:Researcher, The Affiliated Institute of Electronics and Telecommunications Research Institute (ETRI), the Republic of Korea

Sept. 2020~Feb. 2022: Assistant professor, Depart- ment of Information and Communication Engineering, Chosun University, the Republic of Korea

Mar. 2022~Current:Assistant professor, Department of Mobile Convergence Engineering, Hanbat National University, the Republic of Korea

[Research Interest] Optimization techniques, en- ergy harvesting, physical-layer security, wireless surveillance, covert communications, and ma- chine learning for wireless communications.

[ORCID:0000-0002-9812-7768]]

Biography

Hoon Lee

Mar. 2018~Feb. 2019 : Postdoc. Fellow, Singapore Unive- rsity of Technology and Design (SUTD), Singapore

Mar. 2019~Aug. 2022 : Assistant Professor, Pukyong National University, Busan, Korea

Sept. 2022~Aug. 2023 : Associate Professor, Puk- yong National University, Busan, Korea

Sept. 2023~Current : Associate Professor, Ulsan National Institute of Science and Technology (UNIST), Ulsan, Korea

[Research Interest] Optimization, machine learning, and signal processing for wireless networks.

[ORCID:0000-0003-0753-8324]

References

  • 1 J. Moon, "Hybrid DF/AF relay-based lowprobability-of-detection satellite communications," in 2025 Winter Conf. KICS, pp. 1-2, Feb. 2025.custom:[[[-]]]
  • 2 S.-C. Lin, C.-H. Lin, L. C. Chu, and S.-Y. Lien, "Enabling resilient access equality for 6G LEO satellite swarm networks," IEEE Internet Things J., vol. 6, no. 3, pp. 38-43, Sep. 2023.custom:[[[-]]]
  • 3 D. G. Riviello, B. Ahmad, A. Guidotti, and A. Vanelli-Coralli, "Joint graph-based user scheduling and beamforming in LEO-MIMO satellite communication systems," in 2022 11th Advanced Satellite Multimedia Syst. Conf. and the 17th Signal Process. for Space Commun. Wkshp. (ASMS/SPSC), pp. 1-8, Graz, Austria, Sep. 2022.custom:[[[-]]]
  • 4 S. Mahboob and L. Liu, "Revolutionizing future connectivity: A contemporary survey on AI-empowered satellite-based non-terrestrial networks in 6G," IEEE Commun. Surv. Tuts., vol. 26, no. 2, pp. 1279-1321, Secondquarter 2024.custom:[[[-]]]
  • 5 M. A. Jamshed, A. Kaushik, M. Dajer, et al., "Non-terrestrial networks for 6G: Integrated, intelligent and ubiquitous connectivity," (Online) Available: https://arxiv.org/abs/2407.0 2184custom:[[[https://arxiv.org/abs/2407.02184]]]
  • 6 F. Wang, S. Zhang, H. Yang, and T. Q. S. Quek, "Non-terrestrial networking for 6G: Evolution, opportunities, and future directions," (Online) Available: https://arxiv.org/abs/2412.0 0820custom:[[[https://arxiv.org/abs/2412.00820]]]
  • 7 D. Wang, M. Giordani, M.-S. Alouini, and M. Zorzi, "The potential of multilayered hierarchical nonterrestrial networks for 6G: A comparative analysis among networking architectures," IEEE Veh. Technol. Mag., vol. 16, no. 3, pp. 99-107, Sep. 2021.custom:[[[-]]]
  • 8 W. U. Khan, E. Lagunas, A. Mahmood, S. Chatzinotas, and B. Ottersten, "Energyefficient RIS-enabled NOMA communication for 6G LEO satellite networks," in 2023 IEEE 97 th VTC2023- Spring, pp. 1-6, Florence, Italy, Jun. 2023.custom:[[[-]]]
  • 9 C. Qi and X. Wang, "Precoding design for energy efficiency of multibeam satellite communications," IEEE Commun. Lett., vol. 22, no. 9, pp. 1826-1829, Sep. 2018.custom:[[[-]]]
  • 10 C. Qi, Y. Yang, R. Ding, S. Jin, and D. Liu, "Multibeam satellite communications with energy efficiency optimization," IEEE Commun. Lett., vol. 26, no. 4, pp. 887-891, Apr. 2022.custom:[[[-]]]
  • 11 S. S. Hassan, D. H. Kim, Y. K. Tun, N. H. Tran, W. Saad, and C. S. Hong, "Seamless and energy-efficient maritime coverage in coordinated 6G space-air-sea non-terrestrial networks," IEEE Internet Things J., vol. 10, no. 6, pp. 4749-4769, Mar. 2023.custom:[[[-]]]
  • 12 Q. Liao and M. Kaneko, "Global energy efficiency optimization of a Ka-Band multi-beam LEO satellite communication system," IEEE Access, vol. 9, pp. 55232-55243, Apr. 2021.custom:[[[-]]]
  • 13 K. Lin, M. A. Ullah, H. Alves, K. Mikhaylov, and T. Hao, "Energy efficiency optimization for subterranean LoRaWAN using a reinforcement learning approach: A direct-tosatellite scenario," IEEE Wireless Commun. Lett., vol. 13, no. 2, pp. 308-312, Feb. 2024.custom:[[[-]]]
  • 14 S. M. M. Shahabi, X. Deng, A. Qidan, T. Elgorashi, and J. Elmirghani, "Energy-efficient functional split in non-terrestrial open radio access networks," in GLOBECOM 2024, pp. 3799-3804, Cape Town, South Africa, Dec. 2024.custom:[[[-]]]
  • 15 J. Moon and H. Lee, "Energy efficiency maximization for multi-LEO satellite networks," in 2024 Fifteenth ICUFN, pp. 1-5, Budapest, Hungary, Jul. 2024.custom:[[[-]]]
  • 16 T. 3. G. P. P. (3GPP), TS 38.101-2: NR; User Equipment (UE) radio transmission and reception; Part 2: Range 2 Standalone, Last accessed 11 Apr. 2025, 2025. (Online). Available: https://portal.3gpp.org/desktopmodules/Sp ecifications/SpecificationDetails.aspx?specificat ionId=3284custom:[[[https://portal.3gpp.org/desktopmodules/Specifications/SpecificationDetails.aspx?specificationId=3284]]]
  • 17 S. Wu, Y. Wang, G. Sun, L. You, W. Wang, and R. Ding, "Energy and computational efficient precoding for LEO satellite communications," in GLOBECOM 2023, pp. 1872-1877, Kuala Lumpur, Malaysia, Dec. 2023.custom:[[[-]]]
  • 18 Q. Wang, X. Liang, H. Zhang, and L. Ge, "AoI-aware energy efficiency resource allocation for integrated satellite-terrestrial IoT networks," IEEE Trans. Green Commun. Netw., vol. 9, no. 1, pp. 125-139, Mar. 2025.custom:[[[-]]]
  • 19 A. Zhou, Y. Wang, and Q. Zhang, "Energyefficient resource management for federated learning in LEO satellite IoT," in 2024 IEEE WCNC, pp. 1-6, Dubai, United Arab Emirates, Apr. 2024.custom:[[[-]]]
  • 20 J. Li, R. Chai, C. Liu, C. Liang, Q. Chen, and F. R. Yu, "Energy-aware joint route selection and resource allocation in heterogeneous satellite networks," IEEE Trans. Veh. Technol., vol. 73, no. 8, pp. 12067-12081, Aug. 2024.custom:[[[-]]]
  • 21 J. Wang, W. Tang, S. Jin, X. Li, and M. Matthaiou, "Static power consumption modeling and measurement of reconfigurable intelligent surfaces," in 2023 31st EUSIPCO, pp. 890-894, Helsinki, Finland, Sep. 2023.custom:[[[-]]]
  • 22 M. Sinaie, A. Zappone, E. A. Jorswieck, and P. Azmi, "A novel power consumption model for effective energy efficiency in wireless networks," IEEE Wireless Commun. Lett., vol. 5, no. 2, pp. 152-155, Apr. 2016.custom:[[[-]]]
  • 23 A. Liu, V. K. N. Lau, and B. Kananian, "Stochastic successive convex approximation for non-convex constrained stochastic optimization," IEEE Trans. Signal Process., vol. 67, no. 16, pp. 4189-4203, Aug. 2019.custom:[[[-]]]
  • 24 S. Diamond and S. Boyd, "CVXPY: A python-embedded modeling language for convex optimization," J. Machine Learn. Res., vol. 17, no. 83, pp. 1-5, 2016.custom:[[[-]]]
  • 25 K. An, T. Liang, G. Zheng, X. Yan, Y. Li, and S. Chatzinotas, "Performance limits of cognitive-uplink FSS and terrestrial FS for Ka-band," IEEE Trans. Aerosp. Electr. Syst., vol. 55, no. 5, pp. 2604-2611, Oct. 2019.custom:[[[-]]]
  • 26 I. T. U.-R. (ITU-R), P.618 : Propagation data and prediction methods required for the design of Earth-space telecommunication systems, Last accessed 21 Mar. 2024, 2023. (Online). Available: https://www.itu.int/rec/RREC-P.618/encustom:[[[https://www.itu.int/rec/RREC-P.618/en]]]
  • 27 I. T. U.-R. (ITU-R), S.672-4 : Satellite antenna radiation pattern for use as a design objective in the fixed-satellite service employing geostation- ary satellites, Last accessed 22 May 2025, 1997. (Online). Available: https://www.itu.int/rec/R-REC-S.67 2-4-199709-I/encustom:[[[https://www.itu.int/rec/R-REC-S.672-4-199709-I/en]]]
  • 28 Avanti, Ka vs Ku band HTS: A performance assessment and comparison of Ka vs Ku Band HTS, Last accessed 23 May 2025, 2021. [Online]. Available: https://www.avanti.space/wpcontent/uploads/2021/04/Avanti-White-PaperKavs-Ku-HTS.pdfcustom:[[[https://www.avanti.space/wpcontent/uploads/2021/04/Avanti-White-PaperKavs-Ku-HTS.pdf]]]
  • 29 Y. Ma, X. Gao, C. Liu, and J. Li, "Improved SQP and SLSQP algorithms for feasible path-based process optimisation," Computers Chemical Eng., vol. 188, no. 108751, Sep. 2024.custom:[[[-]]]
  • 30 S. J. Sadjadi and K. Ponnambalam, "Advances in trust region algorithms for constrained optimization," Applied Numerical Mathematics, vol. 29, no. 3, pp. 423-443, Mar. 1999.custom:[[[-]]]

Statistics


Related Articles

5G-Advanced 비지상 네트워크의 이동성 향상 기술 개요
S. Park, J. Kim, J. Lee, H. Park, J. Chang, S. Choi
다중 궤도 위성 기반 하향 네트워크의 실증적 커버리지 분석
I. Park, S. Kwak, M. Min
Joint Design of Receive Beamforming and RIS Configuration for Over-the-Air Computation
S. Choi, M. Kim, D. Park
전력 분할 기반 보안 릴레이의 보안 에너지 효율성 최대화
K. Shin
보안 에너지 효율성 최적화를 위한 시간 전환 기반 보안 릴레이
K. Shin
3차원 셀룰러 네트워크기법에서 분산 심층강화학습 기반 에너지 효율 최대화
S. Lee, T. Ban, H. Lee
단말 이동성 예측 기술 기반 심층 강화학습 비지상 네트워크 핸드오버 최적화 연구
J. Kim, H. Jang, I. Cho, M. Shin, S. Jung
다중 빔 저궤도 위성에서 다중 에이전트 심층 강화 학습을 활용한 핸드오버 최소화 기법
C. Lee, T. Kim, I. Bang, S. H. Chae
스펙트럼 공유 환경의 비지상파 네트워크에서 항재밍, 다중 접속 간섭 경감 및 이미지 전송의 효율을 위한 멀티넷 성능 분석
H. Jeon and H. Baek
K-means를 활용한 Simulated Annealing 기반 컨트롤러 배치 알고리즘
H. Kim, D. Ryoo, H. Choi, S. Lee, J. Kim, J. Park, H. Park, K. Kim, S. Ahn, S. Pack

Cite this article

IEEE Style
J. Moon and H. Lee, "Spot Beam Power Optimization for an Energy Efficient Multi-LEO Satellite Network," The Journal of Korean Institute of Communications and Information Sciences, vol. 50, no. 11, pp. 1687-1699, 2025. DOI: 10.7840/kics.2025.50.11.1687.


ACM Style
Jihwan Moon and Hoon Lee. 2025. Spot Beam Power Optimization for an Energy Efficient Multi-LEO Satellite Network. The Journal of Korean Institute of Communications and Information Sciences, 50, 11, (2025), 1687-1699. DOI: 10.7840/kics.2025.50.11.1687.


KICS Style
Jihwan Moon and Hoon Lee, "Spot Beam Power Optimization for an Energy Efficient Multi-LEO Satellite Network," The Journal of Korean Institute of Communications and Information Sciences, vol. 50, no. 11, pp. 1687-1699, 11. 2025. (https://doi.org/10.7840/kics.2025.50.11.1687)