Eliminating Premature Termination in Multihop Rendezvous for Cognitive Radio-based Emergency Response Network
Zahid Ali, Saritha Unnikrishnan, Eoghan Furey, Ian McLoughlin, and Saim Ghafoor

TL;DR
This paper introduces MR-DMCA, a protocol that prevents premature termination in multihop rendezvous for cognitive radio emergency networks, ensuring complete network discovery and significantly reducing rendezvous time.
Contribution
It proposes a novel reliable dual-modular clock algorithm with validation and autonomous termination, improving multihop rendezvous reliability in cognitive radio networks.
Findings
Achieves 100% neighbour and topology discovery in simulations.
Reduces rendezvous time by up to 76% compared to baseline protocols.
Addresses a critical issue of premature termination in multihop rendezvous protocols.
Abstract
In post-disaster environments, damaged communication infrastructure severely limits coordination among emergency response teams. Cognitive radio networks (CRNs) enable rapidly deployable communication by allowing nodes to opportunistically access available spectrum. However, existing multihop rendezvous protocols typically rely on N-1 termination conditions, which can lead to premature termination, resulting in incomplete neighbour discovery and invalid network topology formation. This work identifies this limitation as a previously overlooked issue in multihop rendezvous protocols. This paper proposes a Multihop Reliable Dual-Modular Clock Algorithm (MR-DMCA) that eliminates premature termination and ensures reliable network formation. The proposed protocol introduces a coordinate-assisted neighbour validation mechanism and an autonomous termination strategy that guarantees complete…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
