Performance Analysis of the Hierarchical Layer Graph for Wireless Networks

The Hierarchical Layer Graph (HL graph) is a promising network topology for wireless networks with<br>variable transmission ranges. It was introduced and analyzed by Meyer auf der Heide et al. 2004.<br>In this paper we present a distributed, localized and resource-efficient algorithm for constructing this graph. The qualtiy of the HL graph depends on the domination radius and the publication radius, which affect the amount of interference in the network. These parameters also determine whether the HL graph is a c-spanner, which implies an energy-efficient topology. We investigate the performance on randomly distributed node sets and show that the restrictions on these parameters derived from a worst case analysis are not so tight using realistic settings.<br><br>Here, we present the results of our extensive experimental evaluation, measuring congestion, dilation and energy. Congestion includes the load that is induced by interfering edges. We distinguish between congestion and realistic congestion where we also take the signal-to-interference ratio into account. <br>Our experiments show that the HL graph contains energy-efficient paths as well as paths with a few number of hops while preserving a low congestion.