Channel Assignment and Graph Multicoloring

Abstract

Cellular data and communication networks are usually modeled as graphs with each node representing a base station in a cell in the network, and edges representing geographical adjacency of cells. The problem of channel assignment in such networks can be seen as a graph multicoloring problem. We survey the models, algorithms, and lower bounds for this problem.

Channel Assignment Algorithms for Graphs in the Plane with Graceful Constraints

“…The fields of graph labeling have a wide range of applications as we mentioned above; these applications are especially pervasive in channel assignment wireless networks and mobile computing [14]. For further information about other applications of labeled graphs, such applications include radar, circuit design, astronomy, data base management, on automatic drilling machine, determining configurations of simple resistor networks, and models for constraint programming over finite domains (see e.g., [1, 4, 5, 9 and 10]).…”

Misbehavior Scenarios in Cognitive Radio Networks

“…There are numerous approaches proposed to date for sharing the available spectrum in a DSA network in the frequency domain [59]. They usually model spectrum sharing as a single (or joint, in case of complex cross-layer approach) problem of optimal assignment of channels to nodes.…”

Interference in Cellular Networks: The Minimum Membership Set Cover Problem

“…The settings in which this problem was considered are numerous and include hexagon graphs, geometric intersection graphs (such as unit disk graphs), and planar graphs, but also (non-geometric) general graphs. In addition both static and dynamic (or on-line) approaches were studied [11]. The fact that channel separation constraints can depend on the distance of cells in the conflict graph was analyzed by means of graph labeling [6].…”