The time slot assignment problem in clusters of SS/TDMA satellite systems interconnected through intersatellite links is studied. The authors show that the problem of finding an assignment which minimizes the total transmission time is NP-complete, i. e. , computationally intractable, even for quite restricted intersatellite link patterns and simplified system models. Successively, they focus attention on clusters of two satellites, proposing a branch-and-bound optimal algorithm and two fast heuristic algorithms. They investigate the performance of the proposed heuristic algorithms both by a theoretical worst case bound and by simulation trials showing that the produced solutions are close to the optimal on the average.
TIME SLOT ASSIGNMENT IN SS/TDMA SYSTEMS WITH INTERSATELLITE LINKS
BONUCCELLI, MAURIZIO ANGELO
1987-01-01
Abstract
The time slot assignment problem in clusters of SS/TDMA satellite systems interconnected through intersatellite links is studied. The authors show that the problem of finding an assignment which minimizes the total transmission time is NP-complete, i. e. , computationally intractable, even for quite restricted intersatellite link patterns and simplified system models. Successively, they focus attention on clusters of two satellites, proposing a branch-and-bound optimal algorithm and two fast heuristic algorithms. They investigate the performance of the proposed heuristic algorithms both by a theoretical worst case bound and by simulation trials showing that the produced solutions are close to the optimal on the average.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
