Node Isolation Probability of Wireless Adhoc Networks in Nagakami Fading Channel
A.V. Babu, Mukesh Kumar Singh (National Institute of Technology, Calicut, India)

TL;DR
This paper derives analytical expressions for node isolation probability in wireless ad hoc networks affected by Nakagami-m fading and shadowing, providing insights for network design under realistic channel conditions.
Contribution
It introduces new analytical formulas for node isolation probability considering Nakagami-m fading with shadowing, enhancing understanding of connectivity in realistic wireless environments.
Findings
Node isolation probability increases with higher path loss and shadowing.
Higher diversity order reduces node isolation probability.
Network connectivity improves with increased node density.
Abstract
This paper investigates the issue of connectivity of a wireless adhoc network in the presence of channel impairments. We derive analytical expressions for the node isolation probability in an adhoc network in the presence of Nakagami-m fading with superimposed lognormal shadowing. The node isolation probability is the probability that a randomly chosen node is not able to communicate with none of the other nodes in the network. An extensive investigation into the impact of path loss exponent, lognormal shadowing, Nakagami fading severity index, node density, and diversity order on the node isolation probability is conducted. The presented results are beneficial for the practical design of ad hoc networks.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
