H.M. Koskinen (Finland)
ad hoc networks, physical model, connectivity, network performance
The connectivity of wireless multihop networks has mostly been studied neglecting interference, assuming that all net work nodes have a common transmission range within which they can form direct links. Under this assumption, the critical transmission range for connectivity of a given network equals the greatest edge length in the Euclidean minimum spanning tree of the network nodes. While the impact of interferences on the percolation phenomena of infinite networks has been studied [1], little is known about the graph connectivity of finite networks under more re alistic network models. In this paper, we generalize the critical range for connectivity to two network models pre sented earlier which are both based on a minimum required signal-to-noise-and-interference ratio for successful com munication. As these models have more than one free pa rameters, the critical range generalizes into a boundary in the space of these parameters; we show how to determine this boundary for a given network. The connectivity bound ary implies tradeoffs between different parameters dictat ing network performance. Our results allow studying the connectivity of interferences-limited networks by simula tion and give insight on the sensitivity of connectivity to different network parameters.
Important Links:
Go Back
