A heuristic for fast convergence in interference-free channel assignment using D1EC coloring - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

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.
Fichier principal
Vignette du fichier
59-Campoccia.pdf (365.31 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00506803 , version 1 (29-07-2010)

Identifiers

  • HAL Id : inria-00506803 , version 1

Cite

Fabio Campoccia, Vincenzo Mancuso. A heuristic for fast convergence in interference-free channel assignment using D1EC coloring. ISCIS 2010, Sep 2010, LONDON, United Kingdom. ⟨inria-00506803⟩
46 View
160 Download

Share

Gmail Facebook X LinkedIn More