  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.
