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.

翻译：我们为多通道会合问题建议了一个定期频道购物(CH)序列,称为PPOL(在有限投影平面上打上线笔),用于多通道会合问题。当$N-1是一个主要电源时,其周期为$N2-N+1美元,而PPOL的独特会合频道数量对于任何非零时的漂移来说至少是$2-N2美元。通过频道重新绘图,我们以最大时间-会合时间(MTTR)来构建CH序列,如果现有普通频道的数量至少为2美元,则以$N2+3N+3美元为约束。这可以使文献中约束的最新MTTR减少大约50%。