Sciweavers

Share
SODA
2003
ACM

Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons

9 years 14 days ago
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected and weakly connected dominating sets whose size is at most O(log ∆) times the optimum, ∆ being the maximum degree of the input network. This is best-possible if NP ⊆ Dtime[nO(log log n)] and if the processors are required to run in polynomial-time. We then show how to construct dominating sets that have the above properties, as well as the “low stretch” property that any two adjacent nodes in the network have their dominators at a distance of at most O(log n) in the output network. (Given a dominating set S, a dominator of a vertex u is any v ∈ S such that the distance between u and v is at most one.) We also show our time bounds to be essentially optimal. Key words: Ad hoc networks, dominating sets, distributed algorithms. Preprint submitted to Elsevier Science 12 April 2005
Devdatt P. Dubhashi, Alessandro Mei, Alessandro Pa
Added 01 Nov 2010
Updated 01 Nov 2010
Type Conference
Year 2003
Where SODA
Authors Devdatt P. Dubhashi, Alessandro Mei, Alessandro Panconesi, Jaikumar Radhakrishnan, Aravind Srinivasan
Comments (0)
books