An interval assignment problem for resource optimization in LTE networks

Mohamad Assaad (1, 2) , Walid Ben-Ameur (3, 4, 5) , Faiz Hamid (3, 4, 5)

1 E3S - Supélec Sciences des Systèmes
2 L2S - Laboratoire des signaux et systèmes
3 TSP - RS2M - Département Réseaux et Services Multimédia Mobiles
4 SAMOVAR - Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux
5 CNRS - Centre National de la Recherche Scientifique

In this paper we study the problem of resource allocation in SC-FDMA (Single Carrier Frequency Division Multiple Access) which is adopted as the multiple access scheme for the uplink in the 3GPP-LTE (3rd Generation Partnership Project - Long Term Evolution) standard. The problem can be modeled as an assignment problem where each user can be given a subset of consecutive channels seen as an interval. After introducing the problem, we first prove that it is NP-hard to solve. Then we review some cases where the problem is solvable in polynomial time. An efficient cutting plane algorithm is presented with experimental results.

Mots clés: Resource allocation; Integer programming; Polyhedra; Complexity; Resource allocation

Domaines: Réseaux et télécommunications [cs.NI]

Mohamad Assaad, Walid Ben-Ameur, Faiz Hamid. An interval assignment problem for resource optimization in LTE networks. INOC '13 : International Network Optimization Conference, May 2013, Tenerife, Spain. pp.237-244, ⟨10.1016/j.endm.2013.05.098⟩. ⟨hal-00838466⟩