Distributive online channel assignment for hexagonal cellular networks with constraints

Citations of this article
Mendeley users who have this article in their library.


In cellular networks, channels must be assigned to call requests so that interference constraints are respected and bandwidth is minimized. The number of call requests per cell is continually changing, making channel assignment naturally an online problem. We describe two new online channel assignment algorithms for networks based on a regular hexagonal layout of cells, where interference levels depend only on the distance between cells. Such networks can be modeled by so-called hexagon graphs. Our model incorporates different separation constraints, prescribed minimal differences between channels assigned to cells within a certain distance of each other. The algorithms presented are the first to take into account separation constraints between non-adjacent cells in this type of layout. The algorithms are distributed in nature: each cell server will need only a limited exchange of information with cells in its proximity to make decisions on its channel assignment. © 2004 Elsevier B.V. All rights reserved.




Fitzpatrick, S., Janssen, J., & Nowakowski, R. (2004). Distributive online channel assignment for hexagonal cellular networks with constraints. Discrete Applied Mathematics, 143(1–3), 84–91. https://doi.org/10.1016/j.dam.2003.06.005

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free