Minimizing Energy Consumption of Satellite Edge Computing-Capable LEO Satellites

Low Earth Orbit (LEO) satellite constellations have gained considerable attention from both academia and industry due to their potential to provide reliable global coverage. However, the continuous movement of satellites causes periodic transitions between the sunlit and shadowed regions of orbit, leading to fluctuations in available energy. Satellites on the sunlit side can harvest solar energy to recharge their batteries, while those in the shadowprimarily rely on stored battery power. This paper presents a joint task and energy allocation framework that optimizes satellite energy consumption by considering three key factors: onboard processing of small tasks, relaying tasks to sunlit satellites for processing, and offloading larger tasks to ground stations when available. An Integer Linear Programming (ILP) approach is employed to determine the optimal energy distribution across these tasks, while a computationally efficient greedy algorithm is introduced as an alternative. Additionally, Dynamic Voltage and Frequency Scaling (DVFS) is incorporated to optimize the energy consumption during task processing by adjusting the processing frequency according to the available energy. The results indicate that ILP achieves optimal energy efficiency, while the greedy approach provides a near-optimal solution with only a 4.4% deviation.

Authors

Institutions

Publication Details

Journal
IEEE Access
Published
2025-01-01
DOI
https://doi.org/10.1109/access.2025.3612693
Citations
1
Primary Topic
Satellite Communication Systems
Type
article
Field-Weighted Citation Impact
4.99
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Minimizing Energy Consumption of Satellite Edge Computing-Capable LEO Satellites

Tibor Cinkler, Abdulhalim Fayad, László Toka, Amad Alnahdi
1 citations
IEEE Access
Satellite Communication Systems
4.99
article

Minimizing Energy Consumption of Satellite Edge Computing-Capable LEO Satellites

Tibor Cinkler, Abdulhalim Fayad, László Toka, Amad Alnahdi
article en
1 citations

Abstract

Low Earth Orbit (LEO) satellite constellations have gained considerable attention from both academia and industry due to their potential to provide reliable global coverage. However, the continuous movement of satellites causes periodic transitions between the sunlit and shadowed regions of orbit, leading to fluctuations in available energy. Satellites on the sunlit side can harvest solar energy to recharge their batteries, while those in the shadowprimarily rely on stored battery power. This paper presents a joint task and energy allocation framework that optimizes satellite energy consumption by considering three key factors: onboard processing of small tasks, relaying tasks to sunlit satellites for processing, and offloading larger tasks to ground stations when available. An Integer Linear Programming (ILP) approach is employed to determine the optimal energy distribution across these tasks, while a computationally efficient greedy algorithm is introduced as an alternative. Additionally, Dynamic Voltage and Frequency Scaling (DVFS) is incorporated to optimize the energy consumption during task processing by adjusting the processing frequency according to the available energy. The results indicate that ILP achieves optimal energy efficiency, while the greedy approach provides a near-optimal solution with only a 4.4% deviation.

IEEE AccessVol. 13
Budapest University of Technology and Economics (HU)
Openalex Percentile: Top 5%
Satellite Communication Systems
4.99
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.