Optimal spectrum sensing in cognitive adhoc networks: a multi-layer frame work
Proceedings of the 4th International Conference on Cognitive Radio and Advanced Spectrum Management
Reactive routing for mobile cognitive radio ad hoc networks
Ad Hoc Networks
A survey of common control channel design in cognitive radio networks
Physical Communication
Cooperative spectrum sensing in cognitive radio networks: A survey
Physical Communication
Routing in Distributed Cognitive Radio Networks: A Survey
Wireless Personal Communications: An International Journal
Primary weight measure and its support in stochastic routing for dynamic cognitive radio networks
Proceedings of the 1st ACM workshop on Cognitive radio architectures for broadband
On estimating the end-to-end bandwidth in multi-transceiver multi-hop cognitive radio networks
Proceedings of the 8th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
| Hi-index | 0.07 |
Cognitive radio (CR) technology enables the opportunistic use of the vacant licensed frequency bands, thereby improving the spectrum utilization. However, the CR operation must not interfere with the transmissions of the licensed or primary users (PUs), and this is generally achieved by incurring a trade-off in the CR network performance. In order to evaluate this trade-off, a distributed CR routing protocol for ad hoc networks (CRP) is proposed that makes the following contributions: (i) explicit protection for PU receivers that are generally not detected during spectrum sensing, (ii) allowing multiple classes of routes based on service differentiation in CR networks, and (iii) scalable, joint route-spectrum selection. A key novelty of CRP is the mapping of spectrum selection metrics, and local PU interference observations to a packet forwarding delay over the control channel. This allows the route formation undertaken over a control channel to capture the environmental and spectrum information for all the intermediate nodes, thereby reducing the computational overhead at the destination. Results reveal the importance of formulating the routing problem from the viewpoint of safeguarding the PU communication, which is a unique feature in CR networks.