Abstract
The authors present a novel approach to the optimal time-slot assignment problem for a general satellite-switched time-division multiple-access (SS/TDMA) satellite cluster with intersatellite links (ISLs) interconnection. The proposed allocation algorithm accounts for the following: systems with any number of satellites; each satellite covers an arbitrary number of zones; no onboard buffering at the satellites; and ISLs with arbitrary capacities. They present an analogy between the satellite cluster scheduling problem and the modified openshop scheduling problem. Using this analogy the authors introduce a heuristic algorithm and an optimal branch-and-bound algorithm. They investigate the performance of the proposed heuristic both by theoretical bounds and by comparing the simulation results produced by the heuristic with the optimal results. In all cases the heuristic algorithm results are within 10% of the optimum. >
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
