Affiliation:
1. Kent State University, Kent, USA
2. Louisiana State University, Baton Rouge, USA
Abstract
We consider the group-communication maintenance problem between a set of
k
mobile agents that are tracked by a static sensor network. We develop a scalable deterministic distributed algorithm for maintaining a Steiner tree of the agents so that group communication between them can be provided with the minimum total cost possible. The main idea is that our algorithm maintains a virtual tree of mobile agents that can be immediately converted to an actual Steiner tree at all times. Our algorithm achieves the Steiner tree with total length at most
O
(log
k
) times the length of the optimal Steiner tree in the constant-doubling graph model. The total communication cost (the number of messages) to maintain the Steiner tree is only
O
(min{log
n
, log
D
}) times the optimal communication cost, where
n
and
D
, respectively, are the number of nodes and the diameter of the constant-doubling network. We also develop improved algorithms for the mobile
k
-center, sparse-aggregation, and distributed-matching problems. Experimental evaluation results show the benefits of our algorithms compared to previous algorithms. These four problems are NP-hard and, to the best of our knowledge, our algorithms are the first near-optimal deterministic algorithms for maintaining approximate solutions to these important network problems with low maintenance costs in a distributed setting.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications
Reference34 articles.
1. On-line steiner trees in the Euclidean plane
2. Nikhil Bansal Niv Buchbinder Anupam Gupta and Joseph Seffi Naor. 2007. An O(log2k)-competitive algorithm for metric bipartite matching. In ESA. 522--533. Nikhil Bansal Niv Buchbinder Anupam Gupta and Joseph Seffi Naor. 2007. An O(log 2 k)-competitive algorithm for metric bipartite matching. In ESA. 522--533.
3. Y. Bartal. 1996. Probabilistic approximation of metric spaces and its algorithmic applications. In FOCS. 184--193. Y. Bartal. 1996. Probabilistic approximation of metric spaces and its algorithmic applications. In FOCS. 184--193.
4. Yair Bartal. 1998. On approximating arbitrary metrices by tree metrics. In STOC. 161--168. 10.1145/276698.276725 Yair Bartal. 1998. On approximating arbitrary metrices by tree metrics. In STOC. 161--168. 10.1145/276698.276725
5. On the power of randomization in on-line algorithms