Planning of dynamic channel allocation in HetNet under IEEE 1900.4 framework

Dynamic spectrum allocation (DSA) approach offers an effective means to wireless service providers (WSPs) for efficient utilization of their spectrum resources in order to manage their heterogeneous network (HetNet). The architecture for implementation of DSA has been proposed in IEEE 1900.4 standard. Under the IEEE 1900.4 framework, we envisage a scenario in which, the spectrum available with the WSP is inadequate to serve the aggregate demands of channels or the spectrum, from its radio access networks (RANs). Hence, a plausible solution has been sought in this work that employs and implements the notion of the Bankruptcy Game to formulate a policy decision which would certainly be agreeable to all the RANs. Maximization of proportional fairness (PF) is selected as the potential objective of the WSP. To arrive at an efficient solution that suits the objective of the WSP, we have proposed a novel heuristic namely, H_MPF and have compared the performance of the H_MPF with those of the Shapley value and simulated annealing based channel allocation (SACA) techniques considering solution quality and computational time as the performance indices.