Efficient routing in wireless networks with random node distribution
Martin Haenggi · 2004
After deriving the distribution of the distance to the n/sup th/ nearest neighbor in uniformly random networks of any dimension we establish that nearest-neighbor routing schemes perform poorly in random networks. We suggest and analyze an improved scheme that approaches the performance of regular networks.