Neighbor discovery for cognitive radio ad hoc networks

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. In this paper, we propose a neighbors discovery mechanism that provides how a secondary user could find its neighbor in cognitive radio ad hoc networks without any collaboration. In this mechanism, no prior knowledge of neighboring users is required. In the cognitive radio networks, the available channel sets are varying and users choose neighbor discovery strategies according to the number of available channels they observed. In other words, neighbor discovery strategies are adaptively changing in a dynamic environment. The strategies are simple and totally distributed, but these provide minimum time to rendezvous (TTR).