energy-optimal distributed algorithms for minimum spanning trees
Traditionally, the performance of distributed algorithms has been measured in terms of time and message complexity. Message complexity concerns the number of messages transmitted over all the edges during the course of the algorithm. However, in energy-constraint radio or wireless networks (e.g., sensor networks), energy is a critical factor in measuring the efficiency of a distributed algorithm. Transmitting a message between two nodes has an associated cost (energy) and moreover this cost can depend on the two nodes (e.g., the distance between them among other things). Thus in addition to the time and message complexity, it is important to consider energy complexity that accounts for the total energy associated with the messages exchanged among the nodes in a distributed algorithm, and design energy-efficient distributed algorithms for energy-constraint networks. This paper addresses the minimum spanning tree (MST) problem, an important problem in distributed computing. We study energy-efficient distributed algorithms for the Euclidean MST problem assuming random distribution of nodes. We show a non-trivial lower bound of ?(log n ) on the energy complexity of any distributed MST algorithm. We then give a distributed algorithm that constructs an optimal MST with energy complexity O (log n ) on average and O (log n log log n ) with high probability. This is an improvement over the previous best known bound on the average energy complexity of ?(log 2 n ). All the above results assume that nodes do not know their geometric coordinates. If the nodes know their own coordinates, then we give an algorithm with O (1) energy complexity (which is the best possible) that gives an O (1) approximation to the MST.
distributed algorithm minimum spanning tree energy-efficient distributed approximation algorithm