A Tabu Search DSA Algorithm for Reward Maximization in Cellular Networks

Abstract :

In this paper, we present and analyze a Tabu Search (TS) algorithm for DSA (Dynamic Spectrum Access) in cellular networks. We study a mono-operator case where the operator is providing packet services to the end-users. The objective of the cellular operator is to maximize its reward while taking into account the trade-off between the spectrum cost and the revenues obtained from end-users. These revenue are modeled here as an increasing function of the achieved throughput. Results show that the algorithm allows the operator to increase its reward by taking advantage of the spatial heterogeneity of the traffic in the network, rather than assuming homogeneous traffic for radio resource allocation. Our TS-based DSA algorithm is efficient in terms of the required memory space and convergence speed. Results show that the algorithm is fast enough to suit a dynamic context.

Type de document :
Communication dans un congrès
IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob, Oct 2010, Niagara Falls, Canada. pp.1-6, 2010
Liste complète des métadonnées

Littérature citée [16 références]  Voir  Masquer  Télécharger

https://hal-imt.archives-ouvertes.fr/hal-01144494
Contributeur : Admin Télécom Paristech <>
Soumis le : mardi 21 avril 2015 - 17:16:00
Dernière modification le : jeudi 11 janvier 2018 - 06:23:39
Document(s) archivé(s) le : mercredi 19 avril 2017 - 02:24:19

Fichier

inproceedings-2010-10481-4.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01144494, version 1

Citation

Hany Kamal, Marceau Coupechoux, Philippe Godlewski. A Tabu Search DSA Algorithm for Reward Maximization in Cellular Networks. IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob, Oct 2010, Niagara Falls, Canada. pp.1-6, 2010. 〈hal-01144494〉

Partager

Métriques

Consultations de la notice

68

Téléchargements de fichiers

51