Abstract-In this paper, we present an analytical procedure for the computation of the node isoiation probability in an ad hoc network in the presence of channet randomness, with applications to shadowing and fading phenomena. Such a probability coincides with the complement of the coverage probability, given that nodes are distributed according to a Poisson point process. These results are used to obtain an estimate of the connectivity features for very dense networks. For the case of superimposed lognorma1 shadowing and Rayleigh fading, the connectivity improvements achievable hy means of diversity schemes are investigated. I d e x Terms-connectivity, coverage, ad hoc networks, noisy channels,
In REF , the authors presented an analytical procedure to compute the node isolation probability in an ad hoc network in the presence of channel randomness, and showed that, under the assumption that sensing relies on the same wave propagation laws that also guide signal propagation, the coverage probability coincides with the complement of the node isolation probability.
Coverage and connectivity of ad hoc networks presence of channel randomness
Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
Computer Science