Heuristic algorithms for TDMA burst assignment
Abstract
This work examines the problem of TDMA burst assignment. Interconnectivity between satellite receiving and transmitting beams is assumed to be fixed and known in advance. Several assignment algorithms are proposed and compared to other procedures previously presented in the literature. The algorithms here suggested are heuristic and indeed very simple. Nevertheless, at least from the considered examples, no further refinement seems to be required, once solutions which are very close to optimum have already been attained.
- Publication:
-
5th International Conference on Digital Satellite Communications
- Pub Date:
- 1981
- Bibcode:
- 1981dsc..conf..387L
- Keywords:
-
- Communication Satellites;
- Heuristic Methods;
- Satellite Networks;
- Time Division Multiple Access;
- Algorithms;
- Bursts;
- Computer Techniques;
- Ground Stations;
- Matrices (Mathematics);
- Communications and Radar