Effective channel assignments in cognitive radio networks

Abstract

a b s t r a c tCognitive radio networks (CRNs) promise to be the next generation of the key enabling technology that enables dynamic spectrum access (DSA). The channel assignment (CA) problem is one of the most important issues in CRNs, with the objective of satisfying the interference constraints, and maximizing the number of nodes with channels assigned. In this paper, our goal is to design highly-efficient and localized protocols for CA. In addition, we want to maximize node connectivity after CA, which is important for packet delivery. To this end, we design two basic algorithms and an advanced algorithm framework. Within this framework, we can change the edge priority in CA to meet different requirements. Simulation results show that the proposed framework is fast (two rounds of communication among nodes, regardless of network size) and outperforms an existing method.

Channel Assignment Algorithms in Cognitive Radio Networks: Taxonomy, Open Issues, and Challenges

“…The algorithms presented in [56], [57], [122], [123], [126], [136], [138], [142], [144]- [146] use the inband signaling where data and control information travel on a data channel. The channel assignment algorithms proposed in [31]- [35], [42]- [44], [116]- [118], [124], [125], [127]- [135], [139], [140], [143], [147], [148] implement out-of-band signaling.…”

“…The channel assignment algorithms presented in [33]- [35], [43], [56], [116], [123]- [127], [130], [133], [137]- [139], [142], [143], [146]- [148] work independent of routing; whereas, the channel assignment algorithms proposed in [31], [32], [42], [44], [57], [117], [118], [122], [128], [129], [131], [132], [134]- [136], [140], [144], [145] run jointly with the routing algorithm. The dependent design of channel assignment algorithms makes the channel assignment process relatively complicated and difficult to implement.…”

“…The scope of the control channel can be local and global. The research works presented in [118], [124], [125], [132], [133], [138], [139] use the locally common control channel to exchange the control information within the one-hop neighborhood; whereas, the channel assignment algorithms proposed in [31]- [35], [42]- [44], [116], [117], [125], [127]- [131], [134]- [136], [140], [143], [147], [148] use the globally common control channel to exchange coordination information among all of the CRN nodes via multi-hops. Nevertheless, the channel assignment algorithms proposed in [56], [57], [122], [123], [126], [137], [142], [144]- [146] do not employ a control channel.…”

“…(l) Effective CA: Wu et al [127] propose three localized channel assignment algorithms to maximize the node connectivity. The first algorithm is a basic algorithm that only uses the available channel information on a node to select channels for the adjacent links.…”

“…Channel Selection Characteristics and Requirement-based Comparison Table III shows comparison of the channel assignment algorithms based on the channel selection characteristics and requirements. The parameters Segment-based CA [122] n/a n/a ACO-based CA [126] n/a n/a Centralized and distributed CA [123] n/a n/a MRF-based CA [124] RMCA [118] Path-centric CA [132] Cross-layer design [117] Risk-based CA [44] Dynamic source routing [128] Joint power CA [129] Maximum flow segment-based CA [131] Throughput-oriented CA [42] Effective CA [127] Genetic algorithm-based CA [130] Distance-and traffic-aware CA [34] Spectrum-aware CA [35] RIMCA [125] Probabilistic CA [133] Receiver-centric CA [33] Access contention resolution [116] CCAR [134] Joint link & CA routing optimization [135] Cross-layer optimization framework [136] Transmission opportunity-based CA [137] n/a n/a n/a n/a CA for CSS [43] Downlink CA [138] QoS-aware CA [57] n/a n/a Residual energy-aware CA [139] Dynamic CA [140] Cognitive dynamic fair CA [142] n/a n/a Q-learning-based CA [56] n/a n/a Uplink CA [146] n/a n/a ZAP [147] CoSAP [143] Unified CA [148] CA and routing [145] n/a n/a Route tree-based CA [144] n/a n/a CARD …”