Minimizing Energy Consumption of Satellite Edge Computing-Capable LEO Satellites

In recent years, low earth orbit (LEO) satellite constellation systems have been developed rapidly. However, the scarcity of satellite spectrum resources has become one of the major obstacles to this trend. LEO satellite constellation communication systems sharing the spectrum of incumbent geostationary earth orbit (GEO) satellite system is a feasible way to alleviate spectrum scarcity. Therefore, it has practical significance to study the optimization of satellite resources allocation (RA) in a spectrum sharing scenario. This paper focuses on the RA problem that LEO satellites share a GEO high throughput satellite’s spectrum in a beam-hopping (BH) manner. The GEO satellite system is served as the primary system and the LEO satellite constellation system is served as the secondary system whose frequency bands and transmitting power are strictly limited. Compared with conventional multibeam satellites, BH satellites have the advantage of flexibility in the time dimension. Therefore, we make full use of the flexibility of LEO BH satellites to realize the matching of traffic demand and traffic supply. The RA problem is decomposed into three sub-problems, namely, frequency band selection (FBS) problem, illuminated cell selection (ICS) problem, and transmitting power allocation (TPA) problem. We solve each sub-problem in order and finally form a complete RA scheme. The performance evaluation of the proposed RA scheme is carried out in real-time and simulation results show that the LEO BH satellite paired with the RA scheme we proposed has good adaptability to the uneven distribution of traffic demand in the spectrum sharing scenario.

Recently, increasing investments in satellite-related technologies make the low earth orbit (LEO) satellite constellation a strong complement to terrestrial networks. To mitigate the limitations of the traditional satellite constellation “bent-pipe” architecture, satellite edge computing (SEC) has been proposed by placing computing resources at the LEO satellite constellation. Most existing works focus on space-air-ground integrated network architecture and SEC computing framework. Beyond these works, we are the first to investigate how to efficiently deploy services on the SEC nodes to realize robustness aware service coverage with constrained resources. Facing the challenges of spatial-temporal system dynamics and service coverage-robustness conflict, we propose a novel online service placement algorithm with a theoretical performance guarantee by leveraging Lyapunov optimization and Gibbs sampling. Extensive simulation results show that our algorithm can improve the service coverage by <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$4.3\times $ </tex-math></inline-formula> compared with the baseline.

We study the whole process of using Low Earth Orbit (LEO) satellite constellation to localize Automatic Identification System (AIS) emitter, especially the methodologies of intelligently improving and modifying LEO satellite constellation positioning algorithm based on AIS data. In this vein, we design a simulation system for cooperative localization of vessels based on the AIS signals they emit, with a LEO satellite constellation. We implement key modules such as vessel motion simulation, AIS signal simulation, satellite-to-ground link simulation, localization algorithm module and system visualization. The simulation results of single satellite and multi-satellites localization systems verify the effectiveness of the proposed system.

Low Earth Orbit (LEO) satellite constellations are crucial for global connectivity by providing extensive coverage and reduced delays. However, scheduling data transmission in these dynamic networks is challenging due to rapidly changing satellite positions. This research introduces BoostRL (boosted reinforcement learning), a novel framework integrating large language models (LLMs) with reinforcement learning (RL) for efficient scheduling in LEO satellite constellations. BoostRL leverages LLM-generated initial policies to accelerate convergence, thereby guiding the early stages of policy learning while adapting swiftly to dynamic network conditions. It employs a hybrid policy approach which transitions smoothly from LLM recommendations to autonomous RL policies. A tailored initialization of Q-value parameters and an enhanced loss function further optimize learning efficiency, by aligning the initial learning phase with LLM-generated insights. Simulations using two-line element (TLE) orbital data demonstrate that BoostRL achieves rapid convergence and improved efficiency, thereby validating its potential as a scalable, adaptive solution for managing satellite communication networks.

For energy efficient scheduling of task graphs on multiprocessors, dynamic voltage and frequency scaling (DVFS) and duplication are two widely used techniques. DVFS is generally used to utilize the execution slack by lowering the voltage and frequency of a task to decrease the dynamic energy consumption. Whereas duplication decreases the schedule length and communication energy consumption by replicating certain dependent tasks to avoid communication delays. However, while making decisions on DVFS and duplication for a task, the static energy consumption is mostly overlooked. With chip technologies reducing to a few nano meters, static energy consumption due to leakage current has become important. This article proposes a novel polynomial time heuristic that uses both DVFS and duplication to optimize static energy consumption along with dynamic and communication energy when scheduling task graphs on heterogeneous multiprocessors. The proposed list scheduling algorithm also balances schedule length with energy consumption using proposed normalized difference parameters while making scheduling decisions for a particular task. The results demonstrate the ability of the proposed algorithm to decrease the overall energy consumption with an improved or comparable schedule length as compared with other algorithms in various scenarios.

In designing information communication devices such as real-time embedded systems, it is quite important to maximize the system performance under some hard energy constraints. As a useful technology to reduce the energy consumption in computer-based systems, the dynamic voltage and frequency scaling (DVFS) is becoming very popular. In this paper, we consider an optimal DVFS allocation problem by maximizing the system reliability subject to the hard real-time and energy constraints. More specifically, we formulate a reliability maximization problem when the task processing is probabilistic and is described by a discrete-time Markov chain. Two approximate formulas are proposed to calculate the system reliability efficiently. We perform the sensitivity analysis of model parameters in numerical examples, and also give a case study to design a Wi-Fi subsystem in terms of the DVFS allocation.

Dynamic Voltage and Frequency Scaling (DVFS) is widely used in today's mobile devices. Commonly adopted OS level DVFS policies usually operate with high sampling and adjustment frequency in order to compensate for the lack of information from applications. In this paper, we consider the application of video decoding and propose a method that enables DVFS at a coarse time granularity by taking advantage of application level semantics. Using machine learning, we build a prediction model for the choice of CPU frequency based on the estimated workload and the progress of execution. We show that with our method, the system is able to perform DVFS with a frequency of only around 1 Hz, abiding by the practical constraints imposed by existing operating systems, but still saves an average of 40.1% in energy consumption compared with the execution at nominal speed. Further, we argue that the law of diminishing returns applies if we increase the frequency at which DVFS operates, and thus it may be costly and impractical to perform application level DVFS at a very fine time granularity.

Dynamic Voltage and Frequency Scaling (DVFS) approach is proposed to control the power consumption in devices of different types like from a small mobile device to a huge server. This paper aims to study the effect of parallel execution of two benchmark applications, one the Stanford Single Source benchmarks (lightweight parallel code) and, Stanford Parallel Applications for Shared Memory (SPLASH-2) programs (heavy real-time data streaming parallel applications that run on multi -core clusters) on DVFS for dark silicon ameliorating. Both these benchmarks executed on a gem5 Full System simulator, booting a linaro based linux kernel. To get a holistic big picture of the power and thermal properties of systems that run on DVFS, in addition to the control feature present in gem 5, a power-estimation framework used for the evaluation of the efficiency of various DVFS policies, the MCPAT and Hotspot is also employed. Based on the execution of Stanford workloads DVFS model is analyzed in terms of memory footprint and on other critical processor performance metrics, like running time per core, bus latency, number of read, writes, access time, cache hit or miss. The gem5 is extended with full DVFS support by the addition of a framework in which easy power-model integration can be done.

Energy efficiency and energy proportional computing have become major constraints in the design of modern exascale platforms. Dynamic voltage and frequency scaling (DVFS) is one of the most commonly used and effective techniques to dynamically reduce power consumption based on workload characteristics. Many energy-saving strategies, however, employ DVFS without considering its applicability level in a given multicore processor. The present work demonstrates that disregarding the DVFS granularity as a design constraint while developing energy-saving strategies may reduce the efficacy of the strategy for certain application classes. Specifically, DVFS applicability levels (called granularities) are determined here for three different Intel processor microarchitectures. Then, the degradation in energy savings is evaluated if the DVFS granularity is disregarded. Experiments were conducted on the widely used quantum chemistry packages, General Atomic and Molecular Electronic Structure System (GAMESS) and NWChem, and show that, for granularity unaware energy-saving techniques, the overall energy consumption may increase by as much as 19%.

Dynamic Voltage and Frequency Scaling (DVFS) is a method to save energy consumption of electronic devices and to protect them against overheating by automatic sensing and adaptation of their energy consumption. This can be accomplished either on the program instruction level for electronic devices or on the task or job level for server clusters. This paper models DVFS on the job level and through which Service Levels Objectives can be guaranteed with respect to prescribed mean or quantiles of service delays according to given Service Level Agreements (SLA) between user and service provider. The two parameters V (voltage) and f (frequency) cannot be changed independently of each other; typically only several combinations of V and f values are implemented in hardware for several power states. In this paper a novel analysis of operating DVFS is suggested for Server Clusters of Cloud Data Centers (CDC) under prescribed bounds of service level objectives which are defined by SLAs. The method is based on the theory of queuing models of the type GI/G/n for a server cluster to establish a relationship between SLA parameters and the power consumption and is performed for the example of the Intel Pentium M Processor with Enhanced SpeedStep Power Management. As result of this method precise bounds are provided for the load ranges of service request rates $\lambda$ for each power mode which guarantee minimum power consumption dependent on given SLA values and job arrival and service statistics. As the instantaneous load in a CDC can be highly volatile the current load level is usually monitored by periodic sensing which may result in a rather high frequency of DVFS range changes and corresponding overhead. For that reason an automated smoothing method is suggested which reduces the frequency of DVFS range changes significantly. This method is based on a Finite State Machine (FSM) with hysteresis levels.

In this paper, new multi-objective optimization algorithm is proposed. It optimizes the execution time, the energy consumption and the cost of booked nodes in the grid architecture at the same time. The proposed algorithm selects the best frequencies depends on a new optimization function that optimized these three objectives, while giving equivalent trade-off for each one. Dynamic voltage and frequency scaling (DVFS) is used to reduce the energy consumption of the message passing parallel iterative method executed over grid. DVFS is also reduced the computing power of each processor executing the parallel applications. Therefore, the performance of these applications is decreased and so on the payed cost for the booking nodes is increased. However, the proposed multi-objective algorithm gives the minimum energy consumption and minimum cost with maximum performance at the same time. The proposed algorithm is evaluated on the SimGrid/SMPI simulator while running the parallel iterative Jacobi method. The experiments show that it reduces on average the energy consumption by up to 19.7 %, while limiting the performance and cost degradations to 3.2 % and 5.2 % respectively.

Dynamic voltage and frequency scaling (DVFS) is a means to adjust the computing capacity and power consumption of computing systems to the application demands. DVFS is generally useful to provide a compromise between computing demands and power consumption, especially in the areas of resource-constrained computing systems. Many modern processors support some form of DVFS. In this article, we focus on the development of an execution framework that provides lightweight DVFS support for reactive stream processing systems (RSPS). RSPs are a common form of embedded control systems, operating in direct response to inputs from their environment. At the execution framework, we focus on support for many-core scheduling for parallel execution of concurrent programs. We provide a DVFS strategy for RSPs that is simple and lightweight, to be used for dynamic adaptation of the power consumption at runtime. The simplicity of the DVFS strategy became possible by the sole focus on the application domain of RSPs. The presented DVFS strategy does not require specific assumptions about the message arrival rate or the underlying scheduling method. While DVFS is a very active field, in contrast to most existing research, our approach works also for platforms like many-core processors, where the power settings typically cannot be controlled individually for each computational unit. We also support dynamic scheduling with variable workload. While many research results are provided with simulators, in our approach, we present a parallel execution framework with experiments conducted on real hardware, using the single-chip cloud computer many-core processor. The results of our experimental evaluation confirm that our simple DVFS strategy provides potential for significant energy saving on RSPs.

Any robust communication system can be defined as one that can provide ubiquitous connectivity with lower latency periods. Since 1990, Low Earth Orbit (LEO) satellite constellations have proven to be plausible and efficient alternatives to high altitude GEO satellites in delivering seamless voice and data communication services. This is due to some of their important advantages over geo- stationary such as low power requirement, efficient utilization of frequency spectrum and, low propagation delays pertaining to the satellite’s closer proximity to the ground station. On the downside, the difference in the mobility speed of a LEO satellite and a user on earth is so high that the user can be considered constant, unless he/she is on a fast-moving vehicle. This calls for strategical user handover mechanisms between LEOs to avoid call drops, as usually the service time for a user tend to be higher than the coverage time of a typical non-stationary LEO. Consequently, it is admissible to claim that the quality of service provided by such a network is limited by the performance of LEO handoff algorithms (generally based on parameters like Probability of call blocking/call termination, Throughput, Delay in transmission). In this paper, we will discuss the LEO handoff algorithms developed over the years and particularly delve into the most commendable satellite handover techniques exploiting the property of satellite diversity, that fall with Acceptable Forced termination of existing calls and dropping of new calls.

The integration of Non-Terrestrial Networks (NTNs) with Low Earth Orbit (LEO) satellite constellations into 5G and Beyond is essential to achieve truly global connectivity. A distinctive characteristic of LEO mega-constellations is that they constitute a global infrastructure with predictable dynamics, which enables the pre-planned allocation of radio resources. However, the different bands that can be used for ground-to-satellite communication are affected differently by atmospheric conditions such as precipitation, which introduces uncertainty on the attenuation of the communication links at high frequencies. Based on this, we present a compelling case for applying integrated sensing and communications (ISAC) in heterogeneous and multi-layer LEO satellite constellations over wide areas. Specifically, we propose a sensing-assisted communications framework and frame structure that not only enables the accurate estimation of the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">atmospheric</i> attenuation in the communication links through sensing but also leverages this information to determine the optimal serving satellites and allocate resources efficiently for downlink communication with users on the ground. The results show that, by dedicating an adequate amount of resources for sensing and solving the association and resource allocation problems jointly, it is feasible to increase the average throughput by 59% and the fairness by 700% when compared to solving these problems separately.

Graphics-intensive computer games are no longer restricted to high-performance desktops, but are also available on a variety of portable devices ranging from notebooks to PDAs and mobile phones. Battery life has been a major concern in the design of both the hardware and the software for such devices. Towards this, dynamic voltage and frequency scaling (DVFS) has emerged as a powerful technique. However, the showcase application for DVFS algorithms so far has largely been video decoding, primarily because it is computationally expensive and its workload exhibits a high degree of variability. This paper investigates the possibility of applying DVFS to interactive computer games, which to the best of our knowledge has not been studied before. We show that the variability in the workload associated with a popular first person shooter game like Quake II is significantly higher than video decoding. Although this variability makes game applications an attractive candidate for DVFS, it is unclear if DVFS algorithms can be applied to games due to their interactive (and hence highly unpredictable) nature. In this paper, we show using detailed experiments that (surprisingly) interactive computer games are highly amenable to DVFS. Towards this we present a novel workload characterization of computer games, based on the game engine for Quake II. We believe that our findings might potentially lead to a number of innovative DVFS algorithms targeted towards game applications, exactly as video decoding has motivated a variety of schemes for DVFS.