A Solution Method for the Time Slot Assignment Problem in SS/TDMA Systems with Intersatellite Links

B.M. Nyambo (Zimbabwe) and G.K. Janssens (Belgium)


SS/TDMA; inter-satellite link; integer programming; work scheduling


The time slot assignment problem (TSAP) is considered in a cluster of satellite-switched time-division multiple access (SS/TDMA) satellite systems with inter-satellite links. The TSAP is formulated as a graph coloring problem and leads to an integer programming formulation. Efforts are made to solve the problem by solving continuous linear programming methods and by rounding continuous values as integer optimal values. The interactive solution approach is satisfactory for real world problems.

Important Links:

Go Back