Topic
Distributed algorithm
About: Distributed algorithm is a research topic. Over the lifetime, 20416 publications have been published within this topic receiving 548109 citations.
Papers published on a yearly basis
Papers
More filters
10 Dec 2002
TL;DR: This paper presents a distributed fault-tolerant topology control algorithm for minimum energy consumption in these networks and presents algorithms which preserve the connectivity of a network upon failing of, at most, k nodes and simultaneously minimize the transmission power at each node to some extent.
Abstract: We can control the topology of a multi-hop wireless network by varying the transmission power at each node. The life-time of such networks depends on battery power at each node. This paper presents a distributed fault-tolerant topology control algorithm for minimum energy consumption in these networks. More precisely, we present algorithms which preserve the connectivity of a network upon failing of, at most, k nodes (k is constant) and simultaneously minimize the transmission power at each node to some extent. In addition, we present simulations to support the effectiveness of our algorithm. We also demonstrate some optimizations to further minimize the power at each node. Finally, we show how our algorithms can be extended to 3-dimensions.
127 citations
TL;DR: Sufficient conditions are obtained for designing a distributed fault-tolerant system by employing the given algorithm, which has the interesting property that it lets as many as all of the nodes and internode communication facilities fail, but upon repair or replacement of faulty facilities, the system can converge to normal operation if no more than a certain number of facilities remain faulty.
Abstract: The problem of designing distributed fault-tolerant computing systems is considered. A model in which the network nodes are assumed to possess the ability to "test" certain other network facilities for the presence of failures is employed. Using this model, a distributed algorithm is presented which allows all the network nodes to correctly reach independent diagnoses of the condition (faulty or fault-free) of all the network nodes and internode communication facilities, provided the total number of failures oes not exceed a given bound. The proposed algorithm allows for the reentry of repaired or replaced faulty facilities back into the network, and it also has provisions for adding new nodes to the system. Sufficient conditions are obtained for designing a distributed fault-tolerant system by employing the given algorithm. The algorithm has the interesting property that it lets as many as all of the nodes and internode communication facilities fail, but upon repair or replacement of faulty facilities, the system can converge to normal operation if no more than a certain number of facilities remain faulty.
127 citations
TL;DR: A new distributed algorithm is presented for constructing breadth first search (BFS) trees, a tree of shortest paths from a given root node to all other nodes of a network under the assumption of unit edge weights.
Abstract: A new distributed algorithm is presented for constructing breadth first search (BFS) trees. A BFS tree is a tree of shortest paths from a given root node to all other nodes of a network under the assumption of unit edge weights; such trees provide useful building blocks for a number of routing and control functions in communication networks. The order of communication complexity for the new algorithm is O(V^{1.6} + E) where V is the number of nodes and E the number of edges. For dense networks with E \geq V^{1.6} this order of complexity is optimum.
126 citations
TL;DR: In this article, the authors proposed a distributed algorithm with convergence assurance based on the alternating direction method of multipliers (ADMM) for minimizing the overall energy cost in a distribution network consisting of multiple MGs, with the practical operating constraints (e.g., power balance and the battery's operational constraints) explicitly incorporated.
126 citations
TL;DR: D deterministic and randomized self-stabilizing algorithms that maintain a rooted spanning tree in a general network whose topology changes dynamically, which provide for the easy construction of self-Stabilizing protocols for numerous tasks.
126 citations