JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Polynomial Time Algorithm for Satellite Communications Scheduling Problem with Capacity Constrainted Transponder
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Polynomial Time Algorithm for Satellite Communications Scheduling Problem with Capacity Constrainted Transponder
Lee, Sang-Un;
  PDF(new window)
 Abstract
This paper deals with the capacity constrained time slot assignment problem(CTSAP) that a satellite switches to traffic between ground stations using on-board k-transponders switching modes in SS/TDMA time-division technology. There was no polynomial time algorithm to solve the optimal solution thus this problem classified by NP-hard. This paper suggests a heuristic algorithm with O(mn) time complexity to solve the optimal solution for this problem. Firstly, the proposed algorithm selects maximum packet lengths of combination and transmits the cut of minimum packet length in each switching mode(MSMC). In the case of last switching mode with inefficient transmission, we applies a compensation strategy to obtain the minimum number of switching modes and the minimum makespan. The proposed algorithm finds optimal solution in polynomial time for all of the experimental data.
 Keywords
Time slot;Makespan;Switch mode;Duration;Capacity constrainted;
 Language
Korean
 Cited by
 References
1.
T. Inukai, "An Efficient SS/TDMA Time Slot Assignment Algorithm," IEEE Transactions on Communications, Vol. COM-27, No. 10, pp. 1449-1455, Oct. 1979.

2.
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. crossref(new window)

3.
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)

4.
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.

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

6.
C. Gueret, X. Prins, and M. Sevaux, "Applications of Optimization with Xpress-MP: 12.5 Scheduling of Telecommunications via Satellite," Dash Optimization Ltd., pp. 185-190, Feb. 2005.

7.
M. Edvall, "Publicity Campaign," Tomlab Optimization Inc, http://tomsym.com/examples/tomsym_satellite comm.html, Apr. 2009.

8.
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)

9.
J. P. Jue, "Lightpath Establishment in Wavelength- Routed WDM Optical Networks," Optical networks, Kluwer Academic Publishers, pp. 99-122, 2001.

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

11.
S. U. Lee, "Polynomial Time Algorithm for Multi-Beam SS/TDMA Satellite Communications Scheduling Problem with Frequency-Hopping Ground Stations," Journal of KSCI, Vol. 20, No. 7, pp. 33-40, Jul. 2015.

12.
S. U. Lee, "Polynomial Time Algorithm for Multi-Satellite Communications Scheduling Problem with Intersatellite Links," Journal of KIIT, Vol. 13, No. 8, pp. 29-37, Aug. 2015.

13.
R. A. Brualdi, "Some Applications of Doubly Stochastic Matrices," Linear Algebra and Its Applications, Vol. 107,pp. 77-100, Aug. 1988. crossref(new window)

14.
A. S. Acampora and B. R. Davis, "Efficient Utilization of Satellite Transponders via Time- Division Multibeam Scanning," The Bell System Technical Journal, Vol. 57, No. 8, pp. 2901-2914, Oct. 1978. crossref(new window)

15.
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.

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

17.
G. Maral and M. Bousquet, "Performance of Fully Variable Demand Assignment SS/TDMA Satellite Systems," International Journal of Satellite Communications, Vol. 5, No. 1, pp. 279-290, Jan. 1987. crossref(new window)

18.
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)

19.
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)

20.
S. G. Petridou, P. G. Sarigiannidis, G. I. Papadimitriou, and A. S. Pomportsis, "An Efficient Clustering Oriented Algorithm for Message Scheduling on WDM Star Networks," 14th IEEE Symposium on Communications and Vehicular Technology, Benelux, pp. 143-147, Nov. 2007.