Deploying sensor networks with guaranteed capacity and fault tolerance

We consider the problem of deploying or repairing a sensor network to guarantee a specified level of multi-path connectivity (k-connectivity) between all nodes. Such a guarantee simultaneously provides fault tolerance against node failures and high capacity through multi-path routing. We design and analyze the first algorithms that place an almost-minimum number of additional sensors to augment an existing network into a k-connected network, for any desired parameter k. Our algorithms have provable guarantees on the quality of the solution. Specifically, we prove that the number of additional sensors is within a constant factor of the absolute minimum, for any fixed k. We have implemented greedy and distributed versions of this algorithm, and demonstrate in simulation that they produce high-quality placements for the additional sensors. We are also in the process of using our algorithms to deploy nodes in a physical sensor network using a mobile robot.

[1]  Yu Wang,et al.  Robust deployment and fault tolerant topology control for wireless ad hoc networks , 2003 .

[2]  Ram Ramanathan,et al.  Topology control of multihop wireless networks using transmit power adjustment , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  Andrzej Pelc,et al.  Power consumption in packet radio networks , 2000, Theor. Comput. Sci..

[4]  Guohui Lin,et al.  Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-Length , 1999, Inf. Process. Lett..

[5]  Samir Khuller,et al.  Improved approximation algorithms for uniform connectivity problems , 1995, STOC '95.

[6]  Nicole Immorlica,et al.  Power Optimization in Fault-Tolerant Topology Control Algorithms for Wireless Multi-hop Networks , 2003, IEEE/ACM Transactions on Networking.

[7]  Vahab S. Mirrokni,et al.  Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.

[8]  Andrzej Lingas,et al.  A Polynomial Time Approximation Scheme for Euclidean Minimum Cost k-Connectivity , 1998, ICALP.

[9]  Jennifer C. Hou,et al.  FLSS: a fault-tolerant topology control algorithm for wireless networks , 2004, MobiCom '04.

[10]  Guy Kortsarz,et al.  Approximating Node Connectivity Problems via Set Covers , 2003, Algorithmica.

[11]  Sampath Kannan,et al.  Sampling based sensor-network deployment , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

[12]  A. Frank,et al.  An application of submodular flows , 1989 .

[13]  Lusheng Wang,et al.  The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points , 2001, COCOON.

[14]  Xiang-Yang Li,et al.  Efficient Topology Control for Ad-Hoc Wireless Networks with Non-Uniform Transmission Ranges , 2005, Wirel. Networks.

[15]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems , 1998, JACM.

[16]  Gaurav S. Sukhatme,et al.  Deployment and Connectivity Repair of a Sensor Net with a Flying Robot , 2004, ISER.

[17]  Nicole Immorlica,et al.  Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks , 2007, IEEE/ACM Trans. Netw..

[18]  Madhav V. Marathe,et al.  Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks , 2002, MobiHoc '02.

[19]  Gaurav S. Sukhatme,et al.  Autonomous deployment and repair of a sensor network using an unmanned aerial vehicle , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[20]  Santosh S. Vempala,et al.  An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph , 2003, SIAM J. Comput..

[21]  Vahab S. Mirrokni,et al.  Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks , 2006, Wirel. Networks.

[22]  Harold N. Gabow,et al.  A representation for crossing set families with applications to submodular flow problems , 1993, SODA '93.

[23]  Robert Krauthgamer,et al.  Hardness of Approximation for Vertex-Connectivity Network Design Problems , 2002, SIAM J. Comput..

[24]  Dimitri P. Bertsekas,et al.  Network optimization : continuous and discrete models , 1998 .

[25]  Mauro Leoncini,et al.  On the Symmetric Range Assignment Problem in Wireless Ad Hoc Networks , 2002, IFIP TCS.

[26]  Paramvir Bahl,et al.  Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks , 2001, PODC '01.

[27]  Li Li,et al.  Distributed topology control for power efficient operation in multihop wireless ad hoc networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[28]  Lusheng Wang,et al.  Approximations for Steiner Trees with Minimum Number of Steiner Points , 2000, Theor. Comput. Sci..

[29]  Joseph S. B. Mitchell,et al.  Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems , 1999, SIAM J. Comput..

[30]  Ion I. Mandoiu,et al.  Symmetric Connectivity with Minimum Power Consumption in Radio Networks , 2002, IFIP TCS.