Skip to Main Content
This paper investigates the connectivity probability of 1-dimensional ad hoc networks in which nodes have random, non-identically distributed locations, this leads to optimization of the number of nodes required. An empirical approach is used. We fit a parametric distribution to the CDF of the maximum distance between adjacent nodes. Special and extreme cases which are not covered by the empirical approach are treated separately.
Date of Publication: Jan 2006