Efficient Rendezvous Technique with Channel Bonding for Cognitive Radio Network

In a distributed cognitive radio network, the rendezvous for normal traffic has very promising solutions. The methodology of rendezvous for bursty data communication is very important to explore. This paper proposes a channel rendezvous method with channel bonding; prime number theory is considered the primary technique for analysis. The guaranteed rendezvous by statistical distribution is illustrated with regards to the probability of rendezvous for various bonding and channel vacancy. The theoretical derivation with closed-form expressions for the rendezvous probability is accomplished and verified by Monte-Carlo simulation. In addition to that, the substantial increase of traffic throughput is ensured to support the demand for bursty data communication. Our proposed method is proven to be superior over the conventional rendezvous methods.