A Neighbor Discovery Approach for Cognitive Radio Network Using intersect Sequence Based Channel Rendezvous
Publisher Tahmina Akter, Md Delwar Hossain, Rafiqul Islam · 2015
In wireless networking, The cognitive is efficient manner to bandwidth utilization. But rendezvous is the most important issue for two or more users on a common channel to establish data communication. Neighbor discovery is a critical task in cognitive radio ad hoc networks, since the secondary users operate on available channels which are dynamically changing according to the primary users activities. It can possible to communicate by using three well known mechanisms. First of all common control channel, second channel hopping procedure and broadcasting. All of these introduce few particular problems. But channel hopping procedure is able to reduce various kind of problem such as hidden terminal problem. In this paper, we propose Channel hoping but that would be efficient by this manner. These device want to communicate each other they must have at least one common channel by which they can communicate . To find the common channel the cognitive users comparing their available channel in ascending order. So it is possible to find the intersect users between them. Then that would be essay and simple way to find the common channel to communicate and provide minimum time to rendezvous (TTR).