Title
Solving Mbms Rrm Problem By Metaheuristics
Abstract
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.
Year
Venue
Keywords
2014
2014 IEEE 25TH ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR, AND MOBILE RADIO COMMUNICATION (PIMRC)
Radio resource management, Metaheuristics, MBMS, Tabu Search
Field
DocType
Citations 
Simulated annealing,Multimedia Broadcast Multicast Service,Mathematical optimization,Algorithm design,Guided Local Search,Computer science,Computer network,Local search (optimization),Multicast,Tabu search,Metaheuristic
Conference
0
PageRank 
References 
Authors
0.34
7
4
Name
Order
Citations
PageRank
Qing Xu141.85
Hakim Mabed210014.07
Alexandre Caminada310723.61
Frederic Lassabe4658.13