Scheduling in Multibeam Satellites with Interfering Zones
- 1 August 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 31 (8) , 941-951
- https://doi.org/10.1109/tcom.1983.1095916
Abstract
The traffic scheduling problem is studied in a satellite-switched time-division multiple-access system with interfering beams. A two-step approach is investigated, the first step being the assignment of orthogonal polarization to reduce the interference, and the second step being the scheduling of traffic, taking into account the ″resultant″ interference. The first step can be solved in polynomial time in most cases, while the second step is proved to be NP-complete, even for very simple interference patterns. Several suboptimal algorithms for this second step are suggestedKeywords
This publication has 14 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- An Optimal Switching Algorithm for Multibeam Satellite Systems with Variable Bandwidth BeamsIEEE Transactions on Communications, 1982
- A General Multibeam Satellite Switching AlgorithmIEEE Transactions on Communications, 1981
- An Optimum Time Slot Assignment Algorithm for an SS/TDMA System with Variable Number of TranspondersIEEE Transactions on Communications, 1981
- An Efficient SS/TDMA Time Slot Assignment AlgorithmIEEE Transactions on Communications, 1979
- Efficient Utilization of Satellite Transponders via Time-Division Multibeam ScanningBell System Technical Journal, 1978
- Communications: Spot beams promise satellite communication breakthrough: Focused antenna beams with frequencies accessed by time division can mean higher uplink power and more powerful communication serviceIEEE Spectrum, 1978
- P-Complete Approximation ProblemsJournal of the ACM, 1976
- On Various Algorithms for Estimating the Chromatic Number of a GraphThe Computer Journal, 1976
- Finding a Maximum Cut of a Planar Graph in Polynomial TimeSIAM Journal on Computing, 1975