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 variable transmission ranges. It was introduced and analyzed by Meyer auf der Heide et al. 2004. 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. 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. 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.

[1]  Xiang-Yang Li,et al.  Applications of Computational Geometry in Wireless Networks , 2004 .

[2]  Ivan Stojmenovic,et al.  Topology Control in Wireless AD HOC Networks , 2004 .

[3]  Rajmohan Rajaraman,et al.  Topology control and routing in ad hoc networks: a survey , 2002, SIGA.

[4]  Christian Schindelhauer,et al.  Spanners, Weak Spanners, and Power Spanners for Wireless Networks , 2004, ISAAC.

[5]  Yu Wang,et al.  Wireless Sensor Networks and Computational Geometry , 2004, Handbook of Sensor Networks.

[6]  Klaus Volbert.  A simulation environment for ad hoc networks using sector subdivision , 2002, Proceedings 10th Euromicro Workshop on Parallel, Distributed and Network-based Processing.

[7]  S. Haykin,et al.  Modern Wireless Communications , 1939, Nature.

[8]  Andrea E. F. Clementi,et al.  On the Power Assignment Problem in Radio Networks , 2004, Mob. Networks Appl..

[9]  Friedhelm Meyer auf der Heide,et al.  Energy, congestion and dilation in radio networks , 2002, SPAA '02.

[10]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[11]  Friedhelm Meyer auf der Heide,et al.  Congestion, Dilation, and Energy in Radio Networks , 2004, Theory of Computing Systems.

[12]  F. Thomson Leighton,et al.  ARRAYS AND TREES , 1992 .

[13]  Sajal K. Das,et al.  Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992) , 1992, SIGA.

[14]  Tamás Lukovszki,et al.  Distributed Maintenance of Resource Efficient Wireless Network Topologies (Distinguished Paper) , 2002, Euro-Par.

[15]  Christian Schindelhauer,et al.  Performance of distributed algorithms for topology control in wireless networks , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[16]  Andrzej Pelc,et al.  Power consumption in packet radio networks , 2000, Theor. Comput. Sci..