A Multihop Rendezvous Protocol for Cognitive Radio-based Emergency Response Network

Abstract

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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…