Algorithms for channel assignment in mobile wireless networks using temporal coloring
Yu Feng, Amotz Bar-Noy, Prithwish Basu, Ram Ramanathan · 2013
We model the problem of channel assignment in mobile networks as one of temporal coloring (T-coloring), that is, coloring a time-varying graph. In order to capture the impact of channel re-assignments due to mobility, we model the cost of coloring as C + αA, where C is the total number of colors used and A is the total number of color changes, and α is a user-selectable parameter reflecting the relative penalty of channel usage and re-assignments.