Expected Density of Progress of Cognitive Radio Networks with Selection Region Based Routing Protocol

Cognitive Radio networks which consist of primary and secondary networks are widely considered efficient systems to solve the serious problem of spectrum scarcity. The data transmission of secondary network is subject to the spectrum opportunity provided by primary network. In this paper, we investigate expected density of progress of secondary network with three routing strategies which are farthest receiver, random receiver and nearest receiver rooting strategies based on selection region. Numerical results show that the best performance can be achieved with nearest receiver routing strategy, and a maximum of expected density of progress could be got by setting an optimal transmission probability with that routing strategy.