Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks

DOI10.1016/J.EJOR.2015.12.016MaRDI QIDQ322774zbMATH OpenOpenAlexFDO

Authors Aizaz U. Chaudhry, John W. Chinneck, Roshdy H. M. Hafez

Publication date 7 October 2016

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2015.12.016

zbMATH Keywords

heuristicschannel assignmentminimum coloring

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Communication networks in operations research (90B18) Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 1263991
• APPLICATION OF THE GRAPH COLORING ALGORITHM TO THE FREQUENCY ASSIGNMENT PROBLEM
• scientific article; zbMATH DE number 1795728
• Models and solution techniques for frequency assignment problems
• Frequency assignment in cellular phone networks

Cites work

• scientific article; zbMATH DE number 3943863 (Why is no real title available?)
• scientific article; zbMATH DE number 956851 (Why is no real title available?)
• A GRASP for coloring sparse graphs
• A branch-and-cut algorithm for graph coloring
• A cutting plane algorithm for graph coloring
• A graph coloring algorithm for large scheduling problems
• A probabilistic heuristic for a computationally difficult set covering problem
• A survey on vertex coloring problems
• A topology control approach for utilizing multiple channels in multi-radio wireless mesh networks
• An exact approach for the vertex coloring problem
• Cellular network configuration with co-channel and adjacent-channel interference constraints
• Greedy randomized adaptive search procedures
• Heuristic manipulation, tabu search and frequency assignment
• Hierarchical cellular network design with channel allocation
• Models and solution techniques for frequency assignment problems
• Negative cycle separation in wireless network design
• New methods to color the vertices of a graph
• Reducibility among combinatorial problems
• Some simplified NP-complete graph problems
• The capacity of wireless networks
• The greedy coloring is a bad probabilistic algorithm

Cited in

(4)

• A heuristic for fast convergence in interference-free channel assignment using D1EC coloring
• Local search algorithms for the radio link frequency assignment problem
• Tabu search for frequency assignment in mobile radio networks
• Contrast in greyscales of graphs

Describes a project that uses

Uses Software

• Matlab
• CALMA
• AMPL
• CPLEX

This page was built for publication: Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks

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