Resource allocation using graph coloring for dense cellular networks

Abstract

"Anywhere" and "anytime" are the ultimate properties of wireless communications. To achieve these goals, frequency reuse is one of the most important concepts that has to be considered in high user density networks providing various broadband services. This paper proposes an efficient resource allocation algorithm called Group Based Graph Coloring (GBGC) that exploits unused spectrum areas (TV White Space-TVWS) to improve broadband services in densely populated areas. To achieve this, GBGC groups the users into blocks with each having a leader (Group Head) that connects its cluster members to the base station. The Group Head employs a graph-coloring algorithm to tether other users to the base station, through the available unlicensed TVWS band. The simulation results indicate that the proposed algorithm achieves a good performance/complexity tradeoff that provides a promising alternative to the case of having only direct communication between the cellular users and the base station.