Cognitive Radio Network (CRN) is an intelligent radio that can be programmed and configured dynamically, Cognitive radio (CR) is a new emerging and challenging research area to improve spectral efficiency of wireless communication. A cognitive radio wireless sensor network is one of the postulant areas where cognitive techniques can be used for opportunistic spectrum access. Cognitive radio is a form of wireless communication in which a transceiver can intelligently detect which communication channels are in use and which are not, and instantly move into vacant channels while avoiding occupied ones. This optimizes the use of available radio-frequency (RF) spectrum while minimizing interference to other users. Now a days ISM (Industrial, Scientific and Medical) band is going to be saturated due to increasing availability of wireless device such as mobile, laptop, notebook, pump top. However, in CRN, improve the channel usability by optimistic spectrum access into licensed bands by the secondary users at the absence of primary user. In CRN, channel rendezvous amongst the secondary users to discover the neighbor is the main challenge. A large number of existing works propose overcome this challenge using pseudo random channel hoping (i.e, switching channel from one to other) sequence. However, we dispute that pseudo random sequence cannot provide proficient channel rendezvous in many scenarios and sometimes even the secondary users do not find out their neighbors. Hence in this paper, we propose a channel hoping method using Heap Tree Traversing Algorithm (HTTA) for multi-channel rendezvous amongst the secondary users of CRN. We have analyzed and implemented the proposed mechanism, and found that it provides better results in terms of the number of iteration and success rate for channel rendezvous then the pseudo random approach.

Keywords : Cognitive Radio (CR); Primary User (PU); Secondary User (SU); Pseudo Random; Heap Tree.