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

Vincenzo Mancuso, Fabio Campoccia

    Risultato della ricerca: Other

    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 is also based on simulated annealing and reduces the algorithm’s convergence time by one order of magnitude in comparison to stateless algorithms.
    Lingua originaleEnglish
    Numero di pagine15
    Stato di pubblicazionePublished - 2010

    Fingerprint

    Entra nei temi di ricerca di 'A heuristic for fast convergence in interference-free channel assignment using D1EC coloring'. Insieme formano una fingerprint unica.

    Cita questo