Therefore, by integrating all such points, we obtain the average number of nodes lying in( mathcal{D}left 0,2Rright backslash mathcal{D}left 0,Rright) ) as mathbb{E}left[{Delta}_p^ q right]=frac{lambda }{pi {R}^2}{int}_0^{2pi }{int}_0^Rleft(pi {R}^2-A(r)right) rdrdtheta =lambda {R}^2frac{3sqrt{3}}{4} (9).
It uses link stability metric with respect to least distance and low mobility of nodes lying in the progress area of source node, for selecting next forwarder.
SGFL is equipped with link stability metric that selects the next forwarder node having least distance and low mobility with respect to nodes lying in the progress area of source node.
The 2-nd TD is composed by all nodes lying in the interval (d 0,k, d 0,k+ z) ⊂ ℝ, and it can also include some former nodes of the 1-st TD (those following the k-th node). .
Similarly, the random variable N z, denoting the number of nodes lying in the transmission range of the source (e.g., within the interval (0, z)), has a Poisson distribution with parameter ρsz.
The cognitive radio (CR) nodes with sensing and adaptive abilities have been recognized as a promising solution [1] to realize the next-generation intelligent sensing networks; the key ideas behind detector nodes lie in sensing spectrum information accurately under the practical noise background.
The distinct feature of NODE lies in its relational approach to graphic design.
In greedy routing, communication link is available only when node lies in the progress area.
A neighbouring node lies in the progress area if distance from source to destination is greater than distance between neighbour nodes to destination node.
As can be seen in Figure 3, the target node lies in between r and rmax, which also shows the only possibility of existence of the boundary target node (triangles are the target nodes).
