JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Polynomial Time Algorithm for Multi-Beam SS/TDMA Satellite Communications Scheduling Problem with Frequency-Hopping Ground Stations
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Polynomial Time Algorithm for Multi-Beam SS/TDMA Satellite Communications Scheduling Problem with Frequency-Hopping Ground Stations
Lee, Sang-Un;
  PDF(new window)
 Abstract
The time slot assignment problem (TSAP) or Satellite Communications scheduling problem (SCSP) for a satellite performs ground station data traffic switching has been known NP-hard problem. This paper suggests time complexity algorithm for TSAP of a satellite that performs ground station data traffic switching. This problem is more difficult than 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 traffic matrix that sum of rows and columns all of transponders have LB. Finally, we select the maximum traffic of row and column in , then decide the duration of kth switch mode to minimum traffic from selected values. The proposed algorithm can be get the optimal solution for experimental data.
 Keywords
Multi-beam;Duplicated coverage;Time slot;Makespan;Switch mode;
 Language
Korean
 Cited by
 References
1.
K. T. Huang and J. H. Wen, "A Traffic Reallocation Algorithm for an SS/TDMA System with Frequency-Hopping Earth Stations," Proceedings of IEEE Vehicular Technology, Tokyo, Japan, Vol. 2, pp. 1606-1610, May 2000.

2.
T. Inukai, "An Efficient SS/TDMA Time Slot Assignment Algorithm," IEEE Transactions on Communications, Vol. COM-27, No. 10, pp. 1449-1455, Oct. 1979.

3.
G. Rote and A. Vogel, "A Heuristic for Decomposing Traffic Matrics in TDMA Satellite Communication," Zeitschrift fur-Methods and Models of Operations Research, Vol. 38, No. 3, pp. 281-307, Oct. 1993.

4.
K. L. Yeung, "Efficient Time Slot Assignment Algorithms for TDM Hierarchical and Nonhierarchical Switching Systems," IEEE Transactions on Communications, Vol. 49, No. 2, pp. 351-359, Feb. 2001. crossref(new window)

5.
X. Wan, F. Shan, and Z. Shen, "An Optimal Algorithm for Time-slot Assignment in SS/TDMA Satellite Systems," IEEE 22nd International Conference on Computer Communications and Networks (ICCCN), pp. 1-6, Jul. 2013.

6.
D. Werra, "A Note on SS/TDMA Satellite Communication," Linear Algebra and Its Applications, Vol. 135, pp. 69-77, Jul. 1990. crossref(new window)

7.
T. H. Lee and S. S. Park, "An Integer Programming Approach to the Time Slot Assignment Problem in SS/TDMA Systems with Intersatellite Links," European Journal of Operational Research, Vol. 135, No. 1, pp. 57-66, Nov. 2001. crossref(new window)

8.
D. L. Adamy, "EW 102: A Second Course in Electronic Warfare, Chapter 7: Communication Satellite Links," Horizon House Publications, Inc. 2004.

9.
T. Gonzalez and S. Sahni, "Open-Shop Scheduling to Minimize Finish Time," Journal of the ACM, Vol. 23, No. 4, pp. 665-679, Oct. 1976. crossref(new window)

10.
S. Martello, "Jeno Egervary: From the Origins of the Hungarian Algorithm to Satellite Communication," Central European Journal of Operations Research, Vol. 18, No. 1, pp. 47-57, Mar. 2010. crossref(new window)

11.
S. U. Lee, "Polynomial Time Algorithm for Satellite Communications Scheduling Problem," Journal of KIIT, Vol. 13, No. 4, pp. 27-36, Apr. 2015.