Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Power consumption in packet radio networks
Theoretical Computer Science
Topology control and routing in ad hoc networks: a survey
ACM SIGACT News
Energy, congestion and dilation in radio networks
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Distributed Maintenance of Resource Efficient Wireless Network Topologies (Distinguished Paper)
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Performance of Distributed Algorithms for Topology Control in Wireless Networks
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Modern Wireless Communication
Congestion, Dilation, and Energy in Radio Networks
Theory of Computing Systems
A simulation environment for ad hoc networks using sector subdivision
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Spanners, weak spanners, and power spanners for wireless networks
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 0.00 |
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.