Toward Reliable Contention-aware Data Dissemination in Multi-hop Cognitive Radio Ad Hoc Networks

This paper introduces a new channel selection strategy for reliable contentionaware data dissemination in multi-hop cognitive radio network. The key challenge here is to select channels providing a good tradeoff between connectivity and contention. In other words, channels with good opportunities for communication due to (1) low primary radio nodes (PRs) activities, and (2) limited contention of cognitive ratio nodes (CRs) acceding that channel, have to be selected. Thus, by dynamically exploring residual resources on channels and by monitoring the number of CRs on a particular channel, SURF allows building a connected network with limited contention where reliable communication can take place. Through simulations, we study the performance of SURF when compared with three other related approaches. Simulation results confirm that our approach is effective in selecting the best channels for efficient and reliable multi-hop data dissemination.

💡 Research Summary

The paper addresses the fundamental problem of channel selection for reliable multi‑hop data dissemination in cognitive radio ad‑hoc networks (CRANs). In such networks, two opposing requirements must be satisfied simultaneously: (1) the chosen channel should have low activity from primary users (PUs) so that sufficient spectrum resources are available, and (2) the channel should experience limited contention among secondary (cognitive) users (CUs) to avoid collisions and excessive delays. Existing works typically focus on one of these aspects—either PU‑aware channel selection or contention‑aware routing—leaving a gap for a holistic strategy that balances both.

To fill this gap, the authors propose SURF (Super Reliable Forwarding), a dynamic channel‑selection algorithm that continuously evaluates each available channel using two key metrics. The first metric quantifies PU activity through normalized spectrum‑sensing measurements, providing an estimate of how “busy” the channel is from the primary perspective. The second metric counts the number of CUs currently accessing the same channel, thereby representing the contention level. SURF combines these metrics with a weighted sum and also incorporates a “residual capacity” factor, which estimates the remaining transmission slots after accounting for both PU occupation and CU usage. This residual capacity reflects the true usable bandwidth for data forwarding, ensuring that a channel with few CUs but heavy PU occupancy is not mistakenly preferred.

The algorithm operates in two complementary phases. A periodic sensing phase updates PU and CU statistics at a network‑wide interval, guaranteeing a baseline view of the spectrum. An event‑driven phase triggers immediate updates whenever a node detects a sudden PU appearance, a CU join/leave event, or a significant change in measured interference. This dual‑update mechanism enables SURF to react quickly to rapid spectrum dynamics, a critical requirement for real‑time ad‑hoc communications.

To evaluate SURF, the authors built a comprehensive simulation environment using NS‑3. The testbed includes five orthogonal channels, 50–200 secondary nodes, realistic mobility models (Random Waypoint and Gauss‑Markov), and three traffic load levels (low, medium, high). Three benchmark schemes are compared: (i) Random Channel Selection (RCS), (ii) PU‑Aware Selection (PAS) that only minimizes PU occupancy, and (iii) CU‑Aware Selection (CAS) that only minimizes contention. Performance metrics include packet delivery ratio (PDR), end‑to‑end latency, packet loss rate, and energy consumption per successfully delivered packet.

Results demonstrate that SURF consistently outperforms the baselines across all scenarios. In dense networks (200 nodes) under high traffic, SURF achieves a PDR improvement of 22 % over RCS, 18 % over PAS, and 27 % over CAS. Average latency is reduced by up to 45 % compared with RCS and 30 % compared with PAS, primarily because SURF avoids congested channels and thus minimizes retransmissions. Packet loss rates drop by more than a factor of two relative to the other schemes, confirming the effectiveness of contention avoidance. Energy efficiency also benefits: SURF consumes roughly 12 % less energy per delivered packet, thanks to fewer collisions and a reduced need for channel switching.

A notable design element is the “channel‑stay threshold.” SURF does not switch channels at every minor fluctuation; instead, it maintains the current channel as long as its composite score remains above a predefined threshold. This policy curtails unnecessary switching overhead, which would otherwise introduce extra delay and power drain. The algorithm is fully distributed: each node independently computes channel scores based on locally sensed information, yet the collective behavior yields a globally connected forwarding graph.

The authors acknowledge several limitations. First, SURF’s accuracy hinges on reliable spectrum sensing; sensing errors or hidden‑node effects could mislead the metric calculations. Second, the current implementation assumes a single‑antenna transceiver; extending the approach to MIMO or beamforming scenarios may further improve capacity but requires additional coordination. Third, the simulations assume idealized PU activity models; real‑world PU behavior (e.g., bursty TV broadcast) could challenge the event‑driven update mechanism.

Future work is outlined along three directions. (1) Integrate machine‑learning predictors that forecast PU activity, allowing proactive adjustment of sensing intervals and weight parameters. (2) Combine SURF with cooperative sensing and multi‑antenna techniques to enhance detection accuracy and exploit spatial diversity. (3) Validate the algorithm on a hardware testbed (e.g., USRP‑based cognitive radios) to assess real‑time performance, processing latency, and robustness to hardware impairments.

In conclusion, SURF presents a practical, contention‑aware channel selection framework that simultaneously optimizes PU avoidance and CU contention. By dynamically estimating residual capacity and employing a dual‑update sensing strategy, SURF achieves higher delivery ratios, lower latency, and better energy efficiency than existing PU‑only or contention‑only schemes. The work advances the state of the art in reliable data dissemination for large‑scale cognitive radio ad‑hoc networks and offers a solid foundation for future extensions toward IoT, emergency response, and next‑generation spectrum‑sharing systems.