An Approximately Optimal Rendezvous Scheme for Dynamic Spectrum Access Networks

In this paper, we present a rendezvous scheme for dynamic spectrum access (DSA) networks that can achieve approximately optimal throughput while not relying on a common control channel. Compared with existing rendezvous schemes for DSA networks that use a common control channel, the proposed scheme avoids congestion and jamming of the control channel, and also reduces control complexity and overhead in DSA. We prove that the proposed rendezvous scheme achieves approximately optimal throughput, and analyze the convergence time of this scheme to obtain the approximately optimal throughput.