Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/inria-00506803
Contributor : Vincenzo Mancuso <>
Submitted on : Thursday, July 29, 2010 - 8:45:41 AM
Last modification on : Tuesday, October 30, 2018 - 5:04:09 PM
Long-term archiving on: : Thursday, November 4, 2010 - 10:26:05 AM

File

59-Campoccia.pdf
Files produced by the author(s)

Identifiers

  • 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. ⟨inria-00506803⟩

Share

Metrics

Record views

194

Files downloads

254