Connectivity of wireless multihop networks in a shadow fading environment

This article analyzes the connectivity of multihop radio networks in a log-normal shadow fading environment. Assuming the nodes have equal transmission capabilities and are randomly distributed according to a homogeneous Poisson process, we give a tight lower bound for the minimum node density that is necessary to obtain an almost surely connected subnetwork on a bounded area of given size. We derive an explicit expression for this bound, compute it in a variety of scenarios, and verify its tightness by simulation. The numerical results can be used for the practical design and simulation of wireless sensor and ad hoc networks. In addition, they give insight into how fading affects the topology of multihop networks. It is explained why a high fading variance helps the network to become connected.

• Type: Conference
• Year: 2003
• Where: MSWIM
• Authors: Christian Bettstetter, Christian Hartmann
• Keywords: Modelling And Simulation, MSWIM 2003, Multihop Radio Networks, Shadow Fading Environment, Tight Lower Bound