A heuristic for fast convergence in interference-free channel assignment using D1EC coloring

Abstract : This work proposes an efficient method for solving the Distance-1 Edge Coloring problem (D1EC) for the assignment of orthogonal channels in wireless networks with changing topology. The coloring algorithm is performed by means of the simulated annealing method, a generalization of Monte Carlo methods for solving combinatorial problems. We show that the simulated annealing-based coloring converges fast to a suboptimal coloring scheme. Furthermore, a stateful implementation of the D1EC scheme is proposed, in which network coloring is executed upon topology changes. The stateful D1EC reduces the algorithm's convergence time by one order of magnitude in comparison to stateless algorithms.
Type de document :
Communication dans un congrès
ISCIS 2010, Sep 2010, LONDON, United Kingdom. 2010
Liste complète des métadonnées

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

https://hal.inria.fr/inria-00506803
Contributeur : Vincenzo Mancuso <>
Soumis le : jeudi 29 juillet 2010 - 08:45:41
Dernière modification le : jeudi 11 janvier 2018 - 16:57:54
Document(s) archivé(s) le : jeudi 4 novembre 2010 - 10:26:05

Fichier

59-Campoccia.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00506803, version 1

Collections

Citation

Fabio Campoccia, Vincenzo Mancuso. A heuristic for fast convergence in interference-free channel assignment using D1EC coloring. ISCIS 2010, Sep 2010, LONDON, United Kingdom. 2010. 〈inria-00506803〉

Partager

Métriques

Consultations de la notice

158

Téléchargements de fichiers

117