A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is
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.doi:10.1145/940991.940998 dblp:conf/mswim/BettstetterH03 fatcat:2qmc5b2o3jg7hnsvabjzss4rsi