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

DOI10.1007/978-90-481-9794-1_36MaRDI QIDQ4932695zbMATH OpenOpenAlexFDO

Authors Fabio Campoccia, Vincenzo Mancuso

Publication date 6 October 2010

Published in Lecture Notes in Electrical Engineering (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/inria-00506803/file/59-Campoccia.pdf

zbMATH Keywords

channel assignmentedge coloringsimulated annealing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation methods and heuristics in mathematical programming (90C59) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks
• Soft Edge Coloring
• Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction
• scientific article; zbMATH DE number 1163304
• scientific article; zbMATH DE number 1263991

Cited in

(1)

• Spectrum graph coloring to improve Wi-Fi channel assignment in a real-world scenario via edge contraction

This page was built for publication: A heuristic for fast convergence in interference-free channel assignment using D1EC coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4932695)