A Decomposition Method for Frequency Assignment in Multibeam Satellite Systems

Jean-Thomas Camino, Christian Artigues, Laurent Houssin, Stéphane Mourgues

Abstract

To comply with the continually growing demand for multimedia content and higher throughputs, the telecom- munication industry has to keep improving the use of the bandwidth resources, leading to the well-known Frequency Assignment Problems (FAP). In this article, we present a new extension of these problems to the case of satellite systems that use a multibeam coverage. With the models we propose, we make sure that for each frequency plan produced there exists a corresponding satellite payload architecture that is cost-efficient and decently complex. Two approaches are presented and compared : a global constraint program that handles all the constraints simultaneously, and a decomposition method that involves both constraint programming and integer linear programming. For the latter approach, we show that the two identified subproblems can re- spectively be modeled as a multiprocessor scheduling problem and a path-covering problem, and this analogy is used to prove that they both belong to the category of NP-hard problems. We also show that, for the most common class of interference graphs in multibeam satellite systems, the maximal cliques can all be enumer- ated in polynomial time and their number is relatively low, therefore it is perfectly acceptable to rely on them in the scheduling model that we derived. Our experiments on realistic scenarios show that the decomposition method proposed can indeed provide a solution of the problem when the global CP model does not.

References

  1. Aardal, K. I., van Hoesel, S. P. M., Koster, A. M. C. A., Mannino, C., and Sassano, A. (2007). Models and solution techniques for frequency assignment problems. Annals of Operations Research, 153:79-129.
  2. Beldiceanu, N., Carlsson, M., and Rampon, J.-X. (2005).
  3. Boesch, F. T. and Gimpel, J. F. (1977). Covering the points of a digraph with point-disjoint paths and its application to code optimization. Journal of the ACM, 24:192-198.
  4. Bousquet, M. and Maral, G. (2009). Satellite Communications Systems : Systems, Techniques and Technology. 5th edition.
  5. Bron, C. and Kerbosch, J. (1973). Finding all cliques of an undirected graph. Communications of the ACM, 16:575-577.
  6. Kiatmanaroj, K., Artigues, C., and Houssin, L. (2013). On scheduling models for the frequency interval assignment problem with cumulative interferences.
  7. Koster, A. and Tieves, M. (2012). Column generation for frequency assignment in slow frequency hopping networks. EURASIP Journal on Wireless Communications and Networking, 2012(1):1-14.
  8. Luna, F., Estbanez, C., Len, C., Chaves-Gonzlez, J., Nebro, A., Aler, R., and Gmez-Pulido, J. (2011). Optimization algorithms for large-scale real-world instances of the frequency assignment problem. Soft Computing, 15(5):975-990.
  9. Muoz, D. (2012). Algorithms for the generalized weighted frequency assignment problem. Computers and Operations Research, 39(12):3256-3266.
  10. Salma, A., Omran, I. A. M., and Mohammad, M. (2010).
  11. Frequency assignment problem in satellite communications using differential evolution. Computers and Operations Research, 37(12):2152-2163.
  12. Schulte, C., Tack, G., and Lagerkvist, M. Z. (2013). Modeling and programming with gecode. 522.
  13. Segura, C., Miranda, G., and Len, C. (2011). Parallel hyperheuristics for the frequency assignment problem. Memetic Computing, 3(1):33-49.
  14. Shum, H. and Trotter, L. E. (1996). Cardinality-restricted chains and antichains in partially ordered sets. Discrete Applied Mathematics, pages 421-439.
  15. Tomita, E., Tanaka, A., and Takahashi, H. (2006). The worst-case time complexity for generating all maximal cliques and computational experiments. Theoretical Computer Science, 363:28-42.
  16. van Hoeve, W.-J. (2001). The alldifferent constraint: A survey. Cornell University Library.
  17. Wang, J. and Cai, Y. (2014). Multiobjective evolutionary algorithm for frequency assignment problem in satellite communications. Soft Computing, pages 1-25.
  18. Yang, C., Peng, S., Jiang, B., Wang, L., and Li, R. (2014). Hyper-heuristic genetic algorithm for solv- ing frequency assignment problem in td-scdma. In Proceedings of the 2014 conference companion on Genetic and evolutionary computation companion, ACM:1231-1238.
Download


Paper Citation


in Harvard Style

Camino J., Artigues C., Houssin L. and Mourgues S. (2015). A Decomposition Method for Frequency Assignment in Multibeam Satellite Systems . In Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-075-8, pages 23-33. DOI: 10.5220/0005218700230033


in Bibtex Style

@conference{icores15,
author={Jean-Thomas Camino and Christian Artigues and Laurent Houssin and Stéphane Mourgues},
title={A Decomposition Method for Frequency Assignment in Multibeam Satellite Systems },
booktitle={Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2015},
pages={23-33},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005218700230033},
isbn={978-989-758-075-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - A Decomposition Method for Frequency Assignment in Multibeam Satellite Systems
SN - 978-989-758-075-8
AU - Camino J.
AU - Artigues C.
AU - Houssin L.
AU - Mourgues S.
PY - 2015
SP - 23
EP - 33
DO - 10.5220/0005218700230033