Scheduling satellite-switched time-division multiple access with general switching modes
Based on network circulation formulation, the existence of feasible beam-to-beam switching modes for a satellite-switched time-division multiple access system is completely and transparently proved, where simultaneous transmissions on several carriers in each spot-beam are configured. Showing the linear independence of all but one augmented switching modes, a new bound of mn + 2 is obtained on the number of switching modes, where m and n are the number of up-link and down-link beams, respectively. The time complexity for finding the whole sequence of switching modes and for finding the initial switching mode are improved to O(m(2)n(2)) and O(min(rootK, (m + n)(2/3))mn), respectively. Practical implementation considerations are discussed.
scheduling networks combinatorial mathematics communication switching complexity theory linear algebra satellite communication time-division switching