Download now Free registration required
Traditionally, the performance of distributed algorithms has been measured in terms of running time and message complexity. However, in many settings, a more accurate and relevant measure of performance is required. In ad hoc wireless networks, energy is a very critical factor for measuring the efficiency of a distributed algorithm. Thus in addition to the traditional time and message complexity, it is also relevant to consider energy complexity that accounts for the total energy associated with the messages exchanged among the nodes in a distributed algorithm. This paper focuses on the energy complexity of distributed algorithms for the Euclidean Minimum Spanning Tree (MST) problem, one of the most important problems in distributed computing.
- Format: PDF
- Size: 217.1 KB