Abstract

This paper investigates the connectivity of wireless multihop networks in a log--normal shadow fading environment. Assuming a spatial Poisson distribution of the network nodes, we derive (a) a closed--form expression for the probability that a node is isolated and (b) a tight bound for the minimum node density that is needed to obtain an almost surely connected subnetwork on a given area. Both results find application in the design and simulation of wireless sensor and ad hoc networks.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.