A Multihop Rendezvous Protocol for Cognitive Radio-based Emergency Response Network
For emergency response networks requiring fast and reliable node discovery, this work provides a more efficient rendezvous protocol, though the improvement is incremental over existing channel-hopping methods.
The paper tackles the problem of high rendezvous delay in multihop cognitive radio networks for emergency response. The proposed M-DMCA protocol achieves up to 24% reduction in rendezvous time compared to existing approaches under worst-case conditions.
This paper addresses the challenge of efficient rendezvous in multihop cognitive radio networks, where existing channel-hopping algorithms designed for single-hop scenarios incur increased delay and coordination inefficiencies in multinode topologies. To overcome these limitations, we propose a Multihop Dual Modular Clock Algorithm (M-DMCA), which systematically extends modular clock-based rendezvous to multihop environments while preserving efficient channel coordination. The proposed scheme enables dual-channel selection per timeslot and incorporates a lightweight three-way handshake mechanism to improve coordination among intermediate nodes. Simulation results under worst-case conditions, including high primary user activity, asymmetric channel availability, and dense network settings, demonstrate that M-DMCA significantly reduces rendezvous time compared to existing approaches, achieving up to 24% improvement. These results demonstrate the suitability of M-DMCA for timely node discovery in dynamic emergency response scenarios.