Sciweavers

7 search results - page 2 / 2
» Compact routing messages in self-healing trees
Sort
View
WDAG
2007
Springer
162views Algorithms» more  WDAG 2007»
13 years 11 months ago
A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
Beat Gfeller, Nicola Santoro, Peter Widmayer
SENSYS
2004
ACM
13 years 10 months ago
Synopsis diffusion for robust aggregation in sensor networks
Previous approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-count...
Suman Nath, Phillip B. Gibbons, Srinivasan Seshan,...