@article{ART002016380},
author={Sang-Un, Lee},
title={Polynomial Time Algorithm for Multi-Beam SS/TDMA Satellite Communications Scheduling Problem with Frequency-Hopping Ground Stations},
journal={Journal of The Korea Society of Computer and Information},
issn={1598-849X},
year={2015},
volume={20},
number={7},
pages={33-40}
TY - JOUR
AU - Sang-Un, Lee
TI - Polynomial Time Algorithm for Multi-Beam SS/TDMA Satellite Communications Scheduling Problem with Frequency-Hopping Ground Stations
JO - Journal of The Korea Society of Computer and Information
PY - 2015
VL - 20
IS - 7
PB - The Korean Society Of Computer And Information
SP - 33
EP - 40
SN - 1598-849X
AB - The time slot assignment problem (TSAP) or Satellite Communications scheduling problem (SCSP) for a satellite performs n ×n ground station data traffic switching has been known NP-hard problem. This paper suggests O(n2) time complexity algorithm for TSAP of a satellite that performs n2 × n2 ground station data traffic switching. This problem is more difficult than n × n TSAP as NP-hard problem. Firstly, we compute the average traffic for n -transponder's basic coverage zone and applies ground station exchange method that swap the ground stations until all of the transponders have a average value as possible. Nextly, we transform the D matrix to DLB traffic matrix that sum of rows and columns all of transponders have LB. Finally, we select the maximum traffic of row and column in DLB , then decide the duration of th switch mode to minimum traffic from selected values. The proposed algorithm can be get the optimal solution for experimental data.
KW - Multi-beam;Duplicated coverage;Time slot;Makespan;Switch mode
DO -
UR -
ER -
Sang-Un, Lee. (2015). Polynomial Time Algorithm for Multi-Beam SS/TDMA Satellite Communications Scheduling Problem with Frequency-Hopping Ground Stations. Journal of The Korea Society of Computer and Information, 20(7), 33-40.
Sang-Un, Lee. 2015, "Polynomial Time Algorithm for Multi-Beam SS/TDMA Satellite Communications Scheduling Problem with Frequency-Hopping Ground Stations", Journal of The Korea Society of Computer and Information, vol.20, no.7 pp.33-40.
Sang-Un, Lee "Polynomial Time Algorithm for Multi-Beam SS/TDMA Satellite Communications Scheduling Problem with Frequency-Hopping Ground Stations" Journal of The Korea Society of Computer and Information 20.7 pp.33-40 (2015) : 33.
Sang-Un, Lee. Polynomial Time Algorithm for Multi-Beam SS/TDMA Satellite Communications Scheduling Problem with Frequency-Hopping Ground Stations. 2015; 20(7), 33-40.
Sang-Un, Lee. "Polynomial Time Algorithm for Multi-Beam SS/TDMA Satellite Communications Scheduling Problem with Frequency-Hopping Ground Stations" Journal of The Korea Society of Computer and Information 20, no.7 (2015) : 33-40.
Sang-Un, Lee. Polynomial Time Algorithm for Multi-Beam SS/TDMA Satellite Communications Scheduling Problem with Frequency-Hopping Ground Stations. Journal of The Korea Society of Computer and Information, 20(7), 33-40.
Sang-Un, Lee. Polynomial Time Algorithm for Multi-Beam SS/TDMA Satellite Communications Scheduling Problem with Frequency-Hopping Ground Stations. Journal of The Korea Society of Computer and Information. 2015; 20(7) 33-40.
Sang-Un, Lee. Polynomial Time Algorithm for Multi-Beam SS/TDMA Satellite Communications Scheduling Problem with Frequency-Hopping Ground Stations. 2015; 20(7), 33-40.
Sang-Un, Lee. "Polynomial Time Algorithm for Multi-Beam SS/TDMA Satellite Communications Scheduling Problem with Frequency-Hopping Ground Stations" Journal of The Korea Society of Computer and Information 20, no.7 (2015) : 33-40.
