ZOS: A Fast Rendezvous Algorithm Based on Set of Available Channels for Cognitive Radios
Zhiyong Lin, Hai Liu, Lu Yu, Yiu-Wing Leung, and Xiaowen Chu

TL;DR
ZOS is a novel channel-hopping algorithm for cognitive radios that efficiently guarantees rendezvous using elementary sequences, especially when available channels are limited, with a bounded maximum time-to-rendezvous.
Contribution
The paper introduces ZOS, a new rendezvous algorithm utilizing elementary sequences tailored for small available channel sets, improving efficiency over traditional methods.
Findings
ZOS guarantees rendezvous without extra requirements.
Maximum time-to-rendezvous is bounded by O(m1*m2*log2M).
Effective for small available channel subsets.
Abstract
Most of existing rendezvous algorithms generate channel-hopping sequences based on the whole channel set. They are inefficient when the set of available channels is a small subset of the whole channel set. We propose a new algorithm called ZOS which uses three types of elementary sequences (namely, Zero-type, One-type, and S-type) to generate channel-hopping sequences based on the set of available channels. ZOS provides guaranteed rendezvous without any additional requirements. The maximum time-to-rendezvous of ZOS is upper-bounded by O(m1*m2*log2M) where M is the number of all channels and m1 and m2 are the numbers of available channels of two users.
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.
Taxonomy
TopicsCognitive Radio Networks and Spectrum Sensing · Wireless Communication Networks Research · Satellite Communication Systems
