Solving {MBMS RRM} problem by metaheuristics - Archive ouverte HAL
Communication Dans Un Congrès Année : 2014

Solving {MBMS RRM} problem by metaheuristics

Résumé

Multimedia Broadcast Multicast Service system supports efficient diffusion of multicast multimedia services in cellular networks. Our previous work shows that the radio resource management problem for MBMS can be modeled as a combinatorial optimization problem which tries to find optimal assignment of power and channel codes [1]. In this paper, we propose to solve such problem by using metaheuristic algorithm: Tabu Search (TS). In our work, we modify the general TS algorithm and map it onto our model. We also extend the classic TS procedure by proposing a tabu repair mechanism, which helps to explore new candidate solutions. The proposed algorithm is compared with two other metaheuristics: Greedy Local Search (GLS) and Simulated Annealing (SA). Simulations show that, within acceptable amount of time, TS can find better solution than GLS and SA.
Fichier non déposé

Dates et versions

hal-03221888 , version 1 (10-05-2021)

Identifiants

  • HAL Id : hal-03221888 , version 1

Citer

Qing Xu, Hakim Mabed, Alexandre Caminada, Frédéric Lassabe. Solving {MBMS RRM} problem by metaheuristics. International Symposium on Personal, Indoor and Mobile Radio Communications, Sep 2014, Washington, United States. ⟨hal-03221888⟩
40 Consultations
0 Téléchargements

Partager

More