Near-Optimal Deterministic Steiner Tree Maintenance in Sensor Networks

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 in the minimum cost possible. The main idea is that our algorithm maintains a virtual tree of mobile agents which 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 minimum Steiner tree in the constant-doubling graph model. The total communication cost (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 network. We also develop improved algorithms for the 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 problems with low maintenance costs in a distributed setting.

[1]  Gokarna Sharma,et al.  Near-Optimal Deterministic Steiner Tree Maintenance in Sensor Networks , 2014, DCOSS.

[2]  Yair Bartal,et al.  On approximating arbitrary metrices by tree metrics , 1998, STOC '98.

[3]  Leonidas J. Guibas,et al.  Distributed resource management and matching in sensor networks , 2009, 2009 International Conference on Information Processing in Sensor Networks.

[4]  Noga Alon,et al.  On-line steiner trees in the Euclidean plane , 1992, SCG '92.

[5]  Roger Wattenhofer,et al.  An optimal maximal independent set algorithm for bounded-independence graphs , 2010, Distributed Computing.

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Samir Ranjan Das,et al.  A measurement study of interference modeling and scheduling in low-power wireless networks , 2008, SenSys '08.

[8]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[9]  Jie Gao,et al.  Sparse Data Aggregation in Sensor Networks , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.

[10]  Allan Borodin,et al.  On the power of randomization in online algorithms , 1990, STOC '90.

[11]  Fabrizio Grandoni,et al.  Steiner Tree Approximation via Iterative Randomized Rounding , 2013, JACM.

[12]  Sunghee Choi,et al.  Distributed event-triggered path construction in wireless sensor networks , 2013, Wirel. Networks.

[13]  Leonidas J. Guibas,et al.  Deformable spanners and applications. , 2006, Computational geometry : theory and applications.

[14]  Magnús M. Halldórsson,et al.  Nearly Optimal Bounds for Distributed Wireless Scheduling in the SINR Model , 2011, ICALP.

[15]  Yu-Chee Tseng,et al.  Efficient in-network moving object tracking in wireless sensor networks , 2006, IEEE Transactions on Mobile Computing.

[16]  Guevara Noubir,et al.  Universal approximations for TSP, Steiner tree, and set cover , 2005, STOC '05.

[17]  Jie Gao,et al.  Maintaining Approximate Minimum Steiner Tree and k-center for Mobile Agents in a Sensor Network , 2010, 2010 Proceedings IEEE INFOCOM.

[18]  Roger Wattenhofer,et al.  Topology control meets SINR: the scheduling complexity of arbitrary topologies , 2006, MobiHoc '06.

[19]  Satish Rao,et al.  A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.

[20]  Lui Sha,et al.  Dynamic clustering for acoustic target tracking in wireless sensor networks , 2003, IEEE Transactions on Mobile Computing.

[21]  Magnús M. Halldórsson,et al.  Nearly optimal bounds for distributed wireless scheduling in the SINR model , 2011, Distributed Computing.

[22]  Leonidas J. Guibas,et al.  Network warehouses: Efficient information distribution to mobile users , 2011, 2011 Proceedings IEEE INFOCOM.

[23]  Joseph Naor,et al.  An O (log2 k )-Competitive Algorithm for Metric Bipartite Matching , 2007, ESA.

[24]  Allan Borodin,et al.  On the power of randomization in on-line algorithms , 2005, Algorithmica.

[25]  David R. Karger,et al.  Finding nearest neighbors in growth-restricted metrics , 2002, STOC '02.

[26]  Ye Sun,et al.  Distributed transactional memory for metric-space networks , 2005, Distributed Computing.

[27]  Robert Krauthgamer,et al.  Navigating nets: simple algorithms for proximity search , 2004, SODA '04.

[28]  Roger Wattenhofer,et al.  Protocol Design Beyond Graph-Based Models , 2006, HotNets.

[29]  Gokarna Sharma,et al.  Near-Optimal Location Tracking Using Sensor Networks , 2014, 2014 IEEE International Parallel & Distributed Processing Symposium Workshops.

[30]  H. T. Kung,et al.  Efficient location tracking using sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[31]  Gokarna Sharma,et al.  Optimal Nearest Neighbor Queries in Sensor Networks , 2013, ALGOSENSORS.

[32]  Daniel J. Rosenkrantz,et al.  An analysis of several heuristics for the traveling salesman problem , 2013, Fundamental Problems in Computing.

[33]  Yair Bartal,et al.  Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[34]  Feng Zhao,et al.  RoamHBA: maintaining group connectivity in sensor networks , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[35]  Alex Zelikovsky,et al.  Improved Steiner tree approximation in graphs , 2000, SODA '00.