PPoL: A Periodic Channel Hopping Sequence with Nearly Full Rendezvous Diversity
Authors:
- 7 October 2021
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 199-203
Abstract
We propose a periodic channel hopping (CH) sequence, called PPoL (Packing the Pencil of Lines in a finite projective plane), for the multichannel rendezvous problem. When N − 1 is a prime power, its period is N 2 − N + 1, and the number of distinct rendezvous channels of PPoL is at least N − 2 for any nonzero clock drift. By channel remapping, we construct CH sequences with the maximum time-to-rendezvous (MTTR) bounded by N 2 + 3N + 3 if the number of commonly available channels is at least two. This achieves a roughly 50% reduction of the state-of-the-art MTTR bound in the literature.Keywords
All Related Versions
Funding Information
- Ministry of Science and Technology
This publication has 13 references indexed in Scilit:
- Symmetric Channel Hopping for Blind Rendezvous in Cognitive Radio Networks Based on Union of Disjoint Difference SetsIEEE Transactions on Vehicular Technology, 2017
- A time-efficient rendezvous algorithm with a full rendezvous degree for heterogeneous cognitive radio networks2016
- On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-RendezvousMathematics of Operations Research, 2015
- Matrix-Based Channel Hopping Algorithms for Cognitive Radio NetworksIEEE Transactions on Wireless Communications, 2015
- A Fast Rendezvous Channel-Hopping Algorithm for Cognitive Radio NetworksIEEE Communications Letters, 2013
- Maximizing Rendezvous Diversity in Rendezvous Protocols for Decentralized Cognitive Radio NetworksIEEE Transactions on Mobile Computing, 2012
- Jump-stay based channel-hopping algorithm with guaranteed rendezvous for cognitive radio networks2011
- Asynchronous Multichannel MAC Design With Difference-Set-Based Hopping SequencesIEEE Transactions on Vehicular Technology, 2011
- A Channel Rendezvous Scheme for Cognitive Radio NetworksIEEE Communications Letters, 2010
- A Theorem in Finite Projective Geometry and Some Applications to Number TheoryTransactions of the American Mathematical Society, 1938