Deploying Sensor Networks With Guaranteed Fault Tolerance

We consider the problem of deploying or repairing a sensor network to guarantee a specified level of multipath connectivity (k-connectivity) between all nodes. Such a guarantee simultaneously provides fault tolerance against node failures and high overall network capacity (by the max-flow min-cut theorem). 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.

[1]  Jie Wang,et al.  Fault-Tolerant Sensor Coverage for Achieving Wanted Coverage Lifetime with Minimum Cost , 2007, International Conference on Wireless Algorithms, Systems and Applications (WASA 2007).

[2]  Zhenguo Chen.  Data Mining Based on Clonal Selection Wavelet Network , 2007 .

[3]  L. M. Sa de Souza.  FT-CoWiseNets: A Fault Tolerance Framework for Wireless Sensor Networks , 2007 .

[4]  L.M. Sa de Souza.  FT-CoWiseNets: A Fault Tolerance Framework for Wireless Sensor Networks , 2007, 2007 International Conference on Sensor Technologies and Applications (SENSORCOMM 2007).

[5]  Kenan Xu,et al.  Device Deployment Strategies for Large-scale Wireless Sensor Networks , 2008 .

[6]  Xiang Cao,et al.  Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[7]  Mohammad Al Hasan,et al.  Optimal placement of stereo sensors , 2007, Optim. Lett..

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

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

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

[11]  Jens Peveling.  The K-Neigh Protocol for Symmetric Topology Control in Ad Hoc Networks , 2008 .

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

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

[14]  Morteza Zadimoghaddam,et al.  Minimizing movement , 2007, SODA '07.

[15]  Zhang Xiong,et al.  Research on the Fault Tolerance Deployment in Sensor Networks , 2005, GCC.

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

[17]  Satyajayant Misra,et al.  Constrained Relay Node Placement in Wireless Sensor Networks to Meet Connectivity and Survivability Requirements , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[18]  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).

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

[20]  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..

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

[22]  Hector Garcia-Molina,et al.  Elections in a Distributed Computing System , 1982, IEEE Transactions on Computers.

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

[24]  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).

[25]  Anxiao Jiang,et al.  Separability and topology control of quasi unit disk graphs , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[26]  Robert E. Tarjan,et al.  Augmentation Problems , 1976, SIAM J. Comput..

[27]  Muhammad Farukh Munir,et al.  Increasing Connectivity in Wireless Sensor-Actuator Networks Using Dynamic Actuator Cooperation , 2008, VTC Spring 2008 - IEEE Vehicular Technology Conference.

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

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

[30]  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).

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

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

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

[34]  Hai Liu,et al.  Fault-Tolerant Algorithms/Protocols in Wireless Sensor Networks , 2009, Guide to Wireless Sensor Networks.

[35]  Tao Hu,et al.  Optimal Cluster-Cluster Design for Sensor Network with Guaranteed Capacity and Fault Tolerance , 2007, Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007).

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

[37]  Mohamed F. Younis,et al.  Strategies and techniques for node placement in wireless sensor networks: A survey , 2008, Ad Hoc Networks.

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

[39]  Xiang-Yang Li,et al.  Fault tolerant deployment and topology control in wireless ad hoc networks , 2004, Wirel. Commun. Mob. Comput..

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

[41]  Wu-chi Feng,et al.  Near Optimal Sensor Selection in the COlumbia RIvEr (CORIE) Observation Network for Data Assimilation Using Genetic Algorithms , 2007, DCOSS.

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

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

[44]  Xiang-Yang Li,et al.  Fault tolerant deployment and topology control in wireless networks , 2003, MobiHoc '03.

[45]  Vana Kalogeraki,et al.  Distributed, Reliable Restoration Techniques using Wireless Sensor Devices , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.

[46]  Weiping Shang,et al.  Algorithms for minimum m-connected k-tuple dominating set problem , 2007, Theor. Comput. Sci..

[47]  Abhishek Kashyap.  Robust design of wireless networks , 2006 .

[48]  Mathew D. Penrose,et al.  On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.

[49]  David C. Moore,et al.  Robust distributed network localization with noisy range measurements , 2004, SenSys '04.

[50]  Satyajayant Misra,et al.  Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[51]  Samir Khuller,et al.  Relay Placement for Higher Order Connectivity in Wireless Sensor Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[52]  Ding-Zhu Du,et al.  On the construction of 2-connected virtual backbone in wireless networks , 2009, IEEE Transactions on Wireless Communications.

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

[54]  James McLurkin,et al.  Analysis and implementation of distributed algorithms for multi-robot systems , 2008 .

[55]  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.

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

[57]  Dong Xuan,et al.  Measuring and guaranteeing quality of barrier-coverage in wireless sensor networks , 2008, MobiHoc '08.

[58]  Chen-Khong Tham,et al.  iMST: A bandwidth-guaranteed topology control algorithm for TDMA-based ad hoc networks with sectorized antennas , 2008, Comput. Networks.

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

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

[61]  D. Tulone,et al.  Revising Quorum Systems for Energy Conservation in Sensor Networks , 2007, International Conference on Wireless Algorithms, Systems and Applications (WASA 2007).

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