Neighboring group control channel allocation for cognitive radio Ad Hoc network

Current Common Control Channel (CCC) allocation in Cognitive Radio (CR) Ad Hoc network possesses several shortcomings, such as poor allocation performance in high fluctuating topology structure and poor robustness to the primary activities. To overcome these shortcomings, a novel neighboring group based CCC allocation algorithm is proposed. First, the CR node and its 1-hop neighbors are grouped based the spectrum heterogeneity. Then, the mapping from the grouped CR nodes and the idle CCC set is formulated as a maximum edge biclique problem. Finally, a novel utility function for each available CCC selection is established according to the control massage delay and its throughput; and the CCC in the set with the largest utility function value is selected as the optimal CCC. The algorithm has the advantages of robustness to primary activities and facility in dedicating control channel allocation by the agile grouping of local nodes. Simulation results show that the proposed algorithm is effective in reducing the normalized end-to-end delay when CR node density and primary user number increase; and it adapts to spatial-temporal variation in spectrum availability.