… bounded area, thus an infinite PPP model may not be an appropriate choice [26]–[30]. Thirdly,
many networks are operating under the minimum hop-count based routing schemes [31]–[…

… techniques using tools from stochastic geometry. We model the distribution of hop count using
… We introduce the system model and the two routing techniques in Section II. In Section III, …

… nodes locating randomly in CRAHNs. • We model CRAHNs as geometric random graphs and
… distribution in CRAHNs by using the global location information of PUs and SUs, together …

… geometric random graph model and considered node mobility by using random way point
model. … The authors proposed a novel hop count based localization algorithm [22] for WSN to …

… hop count based applications in CRAHNs with beamforming. … We model CRAHNs with
beamforming as geometric graphs and … The algorithm takes the location information of SUs in …

… hop-count based on the value of neighbors in the same block [35]; to reduce the localization
… In this paper, an optimized mathematical model is established by taking into consideration …

… plenty of algorithms and models that can estimate hop count based on … Therefore in this
paper, an algorithm is proposed for … The algorithm generates the random location of the MNs and …

… , we first use a stochastic geometry graph to model the multi-hop … of two algorithms: (a) the
first algorithm provides the … random source–destination pairs; (b) the second algorithm utilizes …

… In this paper, stochastic geometry graphs is used to model the AHWNs with eavesdroppers’
presence, then a simulation-based analysis method is proposed to investigate the …

… is a mathematical optimization model using the distance … location obtained from the
Centroid algorithm will be incorrect. On the other hand, the DV-Hop and terrain-hop count-based …