Frequency assignment in a SDMA satellite communication system with beam decentring feature

Kata Kiatmanaroj (1) , Christian Artigues (1) , Laurent Houssin (1) , Frédéric Messine (2)

1 LAAS - Laboratoire d'analyse et d'architecture des systèmes
2 IRIT-APO - Algorithmes Parallèles et Optimisation

In satellite communication, Spatial Division Multiple Access (SDMA) has become one of the most promising techniques that can accommodate continuing increase in the number of users and traffic demands. The technology is based on radio resource sharing that separates communication channels in space. It relies on adaptive and dynamic beam-forming technology and well-designed algorithms for resource allocation among which frequency assignment is considered. This paper studies static Frequency Assignment Problem (FAP) in a satellite communication system involving a satellite and a number of users located in a service area. The objective is to maximize the number of users that the system can serve while maintaining the signal to interference plus noise ratio of each user under a predefined threshold. Traditionally, interference is treated as fixed (binary interferences or fixed minimal required separation between frequencies) . In this paper, the interference is cumulative and variable. To solve the problem, we work on both discrete and continuous optimizations. Integer linear programming formulations and greedy algorithms are proposed for solving the discrete frequency assignment problem. The solution is further improved by beam decentring algorithm which involves continuous adjustment of satellite beams and deals with non-linear change of interference.

Mots clés: SDMA system; Frequency assignment problem; Integer programming; Greedy algorithm; Non-linear optimization

Domaines: Recherche opérationnelle [math.OC]; Réseaux et télécommunications [cs.NI]

Kata Kiatmanaroj, Christian Artigues, Laurent Houssin, Frédéric Messine. Frequency assignment in a SDMA satellite communication system with beam decentring feature. Computational Optimization and Applications, 2013, 56 (2), pp.439-455. ⟨10.1007/s10589-013-9557-4⟩. ⟨hal-00862343⟩