Abstract
In this paper, we investigate the multi-hop connectivity in cognitive radio ad-hoc networks (CRAHNs). Specifically, we propose an algorithm to check the multi-hop connectivity of two arbitrary secondary nodes with random nodes' locations and primary nodes' active states as inputs. Then, we use statistical simulation approach with our proposed algorithm to obtain the overall multi-hop connectivity in CRAHNs. We also compare multi-hop connectivity in CRAHNs with conventional ad-hoc networks (AHNs). The simulation results with various network parameters in this paper show that multi-hop connectivity in CRAHNs is always lower than that in AHNs. Multi-hop connectivity has inverse u-shape and is relieved as primary node density decreases. Moreover, multi-hop connectivity in both CRAHNs and AHNs increases and reaches saturation point as secondary node density increases.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
