Skip to main content
Article
100%
HD

In recent years Earth‑observation satellites have become smaller and more numerous. The result? A massive stream of images and measurements that must be downlinked to Earth. Low‑Earth‑Orbit (LEO) constellations can act as a "highway" for this data, but managing it is trickier than it looks.

The issue, called DTIC (Data Transmission in Communication Constellations), splits into two steps: first the data hop between satellites (inter‑satellite routing), then they reach a ground station. Researchers realized this scenario mirrors a production‑scheduling problem known as Hybrid Flow Shop, with a twist: ground antennas can handle several packets at once, as long as two‑dimensional space limits are respected.

To tackle it they introduced a new model, HFSP‑2D, and two algorithms. The first, NEHedd‑2D, quickly builds a basic solution. The second, TSMA (Two‑Stage Memetic Algorithm), starts from that base and refines it using two "job‑swapping" operators: one between different antennas (IPJS) and one within the same antenna (IAJS). Tests on small and large instances show that, when seeded with NEHedd‑2D, TSMA finds the optimal solution for tiny cases and outperforms all benchmark methods for larger ones. In practice, these tools could speed up and stabilise the flow of data from our orbital “home” to the planet, enabling sharper weather forecasts, finer environmental monitoring, and fresh scientific breakthroughs.

Bonus
100%
HD

The HFSP‑2D model extends the classic Hybrid Flow Shop (HFSP) by adding a two‑dimensional space capacity for each processor, i.e., each ground antenna is represented as a 2‑D grid where jobs (data packets) occupy cells according to their bandwidth and transmission time dimensions. This formulation captures simultaneous capacity and spatial conflict constraints, typical of satellite communications where multiple streams can coexist only if they do not overlap in frequency and time.

The NEHedd‑2D constructive algorithm builds on the NEH (Nawaz‑Enscore‑Ham) rule adapted to the 2‑D context: jobs are ordered by a priority measure (e.g., the product of space and time dimensions) and inserted sequentially in the position that minimizes the makespan increase.

TSMA combines a global evolutionary search phase with two local swapping operators. IPJS (Inter‑Processor Job‑Swapping) exchanges whole jobs between different antennas, evaluating the gain in total delivery time. IAJS (Intra‑Processor Job‑Swapping) reorders jobs within the same antenna, exploiting the freedom of placement in the 2‑D grid to reduce spatial conflicts.

Experimental results on benchmark sets generated with realistic parameters (number of satellites, bandwidth, packet sizes) show that TSMA quickly converges to optimal solutions for instances with fewer than 20 jobs and outperforms classic algorithms such as GA, PSO, and tabu search by 5‑10% on larger instances. This indicates that integrating structural knowledge (HFSP‑2D) with targeted swapping operators is an effective strategy to alleviate the remote‑sensing data bottleneck in LEO constellations.

Ask AI

Explore key aspects of this story with 3 quick insights

Source

Authors:
Jiazhao YinYuning ChenXiang LinQian Zhao
Date Published:
Original Article www.mdpi.com
Fact-check verified on 22/06/2026
Read our Editorial Guidelines & AI Ethics Policy
Creative Commons License CC BY-NC-SA 4.0

Keep exploring

Discover the full archive of science bites or head back to home

Riconnessione al server... Aggiornamento della sessione in corso
Connessione interrotta Impossibile stabilire il collegamento
Sessione aggiornata Ricarica per visualizzare i contenuti