Abstract

This paper investigates the connectivity of wireless multihop networks with uniformly randomly distributed nodes. We analyze the required transmission range that creates, for a given node density, an almost surely k-connected topology. Besides scenarios in which each node has the same range, we discuss inhomogeneous range assignments. Our results are of practical value for the task of setting parameters in network-level simulations of ad hoc networks and in the design of wireless sensor networks.

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.