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.
Autori interni: | |
Autori: | BERTOSSI AA; BONGIOVANNI G; BONUCCELLI M |
Titolo: | TIME SLOT ASSIGNMENT IN SS/TDMA SYSTEMS WITH INTERSATELLITE LINKS |
Anno del prodotto: | 1987 |
Digital Object Identifier (DOI): | 10.1109/TCOM.1987.1096831 |
Appare nelle tipologie: | 1.1 Articolo in rivista |