Dynamic Interval Graph Coloring for Channel Assignment in Wireless Cellular Networks

Wireless Cellular Networks are most often modeled as a graphs and Channel Assignment Problems (CAP) can be formulated as graph coloring problms. Assignment of channels to the calls in the networks is a discrete-time event process involving the correct mapping of the channels to the caller- receiver pairs. Efficient usage of limited channels adopt the principles of reusability of same channels for some calls at same time instance. In this paper, an efficient coloring technique is proposed and we apply it to the identified interval-graph dynamically.