Deploying sensor networks with guaranteed fault tolerance

IEEE/ACM Transactions on Networking

Volumn 18, Issue 1, 2010, Pages 216-228

  Bredin, Jonathan L ^a   Demaine, Erik D ^b   Hajiaghayi, Mohammad Taghi ^c   Rus, Daniela ^b  

^a Department of Psychology   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c AT AND T LABS RESEARCH   (United States)

Author keywords

Approximation algorithms; Augmentation; Graph algorithms; Sensor networks

Indexed keywords

ABSOLUTE MINIMUM; AUGMENTATION; CONNECTED NETWORKS; CONSTANT FACTORS; GRAPH ALGORITHMS; HIGH QUALITY; MAX-FLOW MIN-CUT; MULTI-PATH; NETWORK CAPACITY; NODE FAILURE;

FAULT TOLERANCE; QUALITY ASSURANCE; SENSOR NETWORKS;

APPROXIMATION ALGORITHMS;

EID: 77249088133     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2009.2024941     Document Type: Article

References (60)

1. P. Corke, S. Hrabar, R. Peterson, D. Rus, S. Saripalli, andG. Sukhatme, "Autonomous deployment of a sensor network using an unmanned aerial vehicle," in Proc. 2004 Int. Conf. Robot. Autom., New Orleans, LA, 2004, pp. 3602-3608.
2. P. Corke, S. Hrabar, R. Peterson, D. Rus, S. Saripalli, andG. Sukhatme, "Deployment and connectivity repair of a sensor net with a flying robot," in Proc. 9th Int. Symp. Exper. Robot., Singapore, 2004, pp. 333-342.
3. M. Bahramgiri, M. T. Hajiaghayi, and V. S. Mirrokni, "Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks," WirelessNetw., vol.12, no.2, pp. 179-188,2006.
4. M. T. Hajiaghayi, N. Immorlica, and V. S. Mirrokni, "Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks," IEEE/ACM Trans. Netw., vol.15, no.6, pp. 1345-1358, Dec. 2007.
5. G. H. Lin and G. Xue, "Steiner tree problem with minimum number of Steiner points and bounded edge-length," Inf. Process. Lett., vol.69, no.2, pp. 53-57, 1999.
6. G. Kortsarz and Z. Nutov, "Approximating node connectivity problems via set covers," in Proc. 3rd Int. Workshop Approx. Algor. Combinator. Optimiz. (APPROX), 2000, pp. 194-205.
7. J. Cheriyan, S. Vempala, and A. Vetta, "An approximation algorithm for the minimum-cost fc-vertex connected subgraph," SIAMJ. Comput., vol.32, no.4, pp. 1050-1055, 2003.
8. R. Ramanathan and R. Rosales-Hain, "Topology control of multihop radio networks using transmit power adjustment," in Proc. IEEE IN-FOCOM, Mar. 2000, pp. 404-413.
9. R. Wattenhofer, L. Li, V. Bahl, and Y. M. Wang, "Distributed topology control for power efficient operation in multihop wireless ad hoc networks," in Proc. IEEE INFOCOM, 2001, pp. 1388-1397.
10. L. Li, J. Halpern, V. Bahl, Y. M. Wang, and R. Wattenhofer, "Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks," in Proc. ACM PODC, 2001, pp. 264-273. (Pubitemid 33006687)
11. M. Hajiaghayi, N. Immorlica, and V. S. Mirrokni, "Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks," in Proc. 9th Annu. Int. Conf. Mobile Comput. Netw., 2003, pp. 300-312.
12. E. Lloyd, R. Liu, M. Marathe, R. Ramanathan, and S. Ravi, "Algorithmic aspects of topology control problems for ad hoc networks," in Proc. ACMMobiHoc, 2002, pp. 123-134.
13. D. Blough, M. Leoncini, G. Resta, and P. Santi, "The K-neigh protocol for symmetric topology control in ad hoc networks," in Proc. ACM MobiHoc, Jun. 2003, pp. 141-152.
14. X. Y. Li, W. Z. Song, and Y. Wang, "Efficient topology control for wireless ad hoc networks with non-uniform transmission ranges," Wireless Netw., vol.11, no.3, pp. 255-264, May 2005. (Pubitemid 41217855)
15. X. Y. Li, Y. Wang, P. J. Wan, and C. W. Yi, "Fault tolerant deployment and topology control in wireless ad hoc networks," in Proc. ACM MobiHoc, Jun. 2003, pp. 117-128.
16. N. Li and J. C. Hou, "FLSS: A fault-tolerant topology control algorithm for wireless networks," in Proc. 10th Ann. Int. Conf. Mobile Comput. Netw., 2004, pp. 275-286.
17. D. Chen, D. Z. Du, X. D. Hu, G. H. Lin, L. Wang, and G. Xue, "Approximations for Steiner trees with minimum number of Steiner points," J. Global Optim., vol.18, no.1, pp. 17-33, 2000.
18. K. P. Eswaran and R. E. Tarjan, "Augmentation problems," SIAM J. Comput., vol.5, no.4, pp. 653-665, 1976.
19. D. Du, L.Wang, andB.Xu, "The Euclidean bottleneck Steiner tree and Steiner tree with minimum number of Steiner points," in Computing and Combinatorics (Guilin, 2001), Lecture Notes in Comput. Sci. Berlin, Germany: Springer, 2001, vol.2108, pp. 509-518.
20. J. Pu and Z. Xiong, "Research on the fault tolerance deployment in sensor networks," in Proc. 4th Int. Conf. GCC, Lecture Notes in Comput. Sci., Beijing, China, 2005, vol.3795, pp. 1179-1184.
21. A. Kashyap, "Robust design of wireless networks," Ph.D. dissertation, Univ. Maryland, College Park, 2006.
22. A. Kashyap, S. Khuller, and M. A. Shayman, "Relay placement for higher order connectivity in wireless sensor networks," in Proc. IEEE INFOCOM, 2006, pp. 1-12.
23. X. Han, X. Cao, E. L. Lloyd, and C.-C. Shen, "Fault-tolerant relay node placement in heterogeneous wireless sensor networks," in Proc. IEEE INFOCOM, Anchorage, AK, May 2007, pp. 1667-1675.
24. W. Zhang, G. Xue, and S. Misra, "Fault-tolerant relay node placement in wireless sensor networks: Problems and algorithms," in Proc. IEEE INFOCOM, Anchorage, AK, May 2007, pp. 1649-1657.
25. W. Shang, P. Wan, F. Yao, and X. Hu, "Algorithms for minimum m-connected A'-tuple dominating set problem," Theor. Comput. Sci, vol.381, no.1-3, pp. 241-247, 2007.
26. E. D. Demaine, M. T. Hajiaghayi, H. Mahini, A. S. Sayedi-Roshkhar, S. Oveisgharan, and M. Zadimoghaddam, "Minimizing movement," in Proc. 18th Annu. ACM-SIAM SODA, New Orleans, LA, Jan. 2007, pp. 258-267.
27. B. Zeng, J. Wei, and T. Hu, "Optimal cluster-cluster design for sensor network with guaranteed capacity and fault tolerance," in Proc. 8th ACIS Int. Conf. Software Eng., Artif Intell, Netw. Parallel/Distrib. Comput., Qingdao, China, 2007, pp. 288-293.
28. X. T. Dang, S. Frolov, N. Bulusu, W. c. Feng, and A. M. Baptista, "Near optimal sensor selection in the columbia river (corie) observation network for data assimilation using genetic algorithms," in Proc. 3rd IEEE Int. Conf. DCOSS, Lecture Notes in Comput. Sci., Santa Fe, NM, Jun. 2007, vol.4549, pp. 253-266.
29. D. Tulone and E. D. Demaine, "Revising quorum systems for energy conservation in sensor networks," in Proc. Int. Conf. WASA, Chicago, IL, Aug. 2007, pp. 147-157.
30. Y. Drougas and V. Kalogeraki, "Distributed, reliable restoration techniques using wireless sensor devices," in Proc. 21th IPDPS, Long Beach, CA, Mar. 2007.
31. L. Moreira Sá de Souza, "FT-CoWiseNets: A fault tolerance framework for wireless sensor networks," in Proc. Int. Conf. SensorComm, Oct. 2007, pp. 289-294.
32. Z. Yu and J. Wang, "Fault-tolerant sensor coverage for achieving wanted coverage lifetime with minimum cost," in Proc. Int. Conf. WASA 2007, 2007, pp. 95-102.
33. A. Chen, T. H. Lai, and D. Xuan, "Measuring and guaranteeing quality of barrier-coverage in wireless sensor networks," in Proc. ACM MobiHoc, Hong Kong, China, 2008, pp. 421-430.
34. F. Wang, M. T. Thai, and D.-Z. Du, "On the construction of 2-con-nected virtual backbone in wireless networks," IEEE Trans. Wireless Commun., vol.8, no.3, pp. 1230-1237, Mar. 2009.
35. K. Xu, "Device deployment strategies for large-scale wireless sensor networks," Ph.D. dissertation, Queen's Univ., Kingston, ON, Canada, 2008.
36. M. A. Hasan, K. K. Ramachandran, and J. E. Mitchell, "Optimal placement of stereo sensors," Optimiz. Lett., vol.2, no.1, pp. 99-111, Jan. 2008.
37. M. F. Munir and F. Filali, "Increasing connectivity in wireless sensor-actuator networks using dynamic actuator cooperation," in Proc. VTC, May 2008, pp. 203-207.
38. S. Misra, S. D. Hong, G. Xue, and J. Tang, "Constrained relay node placement in wireless sensor networks to meet connectivity and survivability requirements," in Proc. IEEE INFOCOM, Apr. 2008, pp. 281-285.
39. C.-W. Ang and C.-K. Tham, "IMST: A bandwidth-guaranteed topology control algorithm for tdma-based ad hoc networks with sectorized antennas," Comput. Netw., vol.52, no.9, pp. 1675-1692, 2008.
40. A. Efrat, S. P. Fekete, P. R. Gaddehosur, J. S. B. Mitchell, V. Pol-ishchuk, and J. Suomela, "Improved approximation algorithms for relay placement," in Proc. 16th Annu. ESA, Lecture Notes in Comput. Sci., Karlsruhe, Germany, Sep. 2008, vol.5193, pp. 356-367.
41. G. V. Yee, B. Shucker, J. Dunn, A. Sheth, and R. Han, "Just-in-time sensor networks," in Proc. 3rd Workshop EmNets, Cambridge, MA, May 2006 [Online. Available: http://www.eecs.harvard.edu/emnets
42. M. F. Younis and K. Akkaya, "Strategies and techniques for node placement in wireless sensor networks: A survey," Ad Hoc Netw., vol.6, no.4, pp. 621-655, 2008.
43. H. Liu, A. Nayak, and I. Stojmenovic, "Fault tolerant algorithms/protocols in wireless sensor networks," in Guide to Wireless Sensor Networks, S. Misra, I. Woungang, and S. C. Misra, Eds. New York: Springer-Verlag, 2009, pp. 261-292.
44. D. M. Blough, M. Leoncini, G. Resta, and P. Santi, "On the symmetric range assignment problem in wireless ad hoc networks," in Proc. 2nd IFIP Int. Conf. TCS, 2002, pp. 71-82.
45. G. Calinescu, I. L. Mandoiu, and A. Zelikovsky, "Symmetric connectivity with minimum power consumption in radio networks," Proc. 17th IFIP World Comput. Congress, pp. 119-130, 2002.
46. L. M. Kirousis, E. Kranakis, D. Krizanc, and A. Pelc, "Power consumption in packet radio networks," Theoret. Comput. Sci., vol.243, no.1-2, pp. 289-305, 2000.
47. J. D. McLurkin, "Analysis and implementation of distributed algorithms for multi-robot systems," Ph.D. dissertation, Mass. Inst. Technol., Cambridge, 2008.
48. A. Frank and E. Tardos, "An application of submodular flows," Linear Algebra Appl, vol.114/115, pp. 329-348, 1989.
49. S. Khuller and B. Raghavachari, "Improved approximation algorithms for uniform connectivity problems," J. Algor., vol.21, no.2, pp. 434-450, 1996.
50. H. N. Gabow, "A representation for crossing set families with applications to submodular flow problems," in Proc. 4th Annu. ACM-SIAM Symp. Discrete Algor., Austin, TX, New York, 1993, pp. 202-211.
51. H. Garcia-Molina, "Elections in a distributed computing system," IEEE Trans. Comput., vol.C-31, no.1, pp. 48-59, Jan. 1982.
52. D. Bertsekas, Network Optimization: Continuous and Discrete Models. Nashua, NH: Athena Scientific, 1998.
53. D. Moore, J. Leonard, D. Rus, and S. Teller, "Robust distributed network localization with noisy range measurements," in Proc. 2nd Int. Conf. Embedded Netw. Sens. Syst., New York, 2004, pp. 50-61.
54. V. Isler, S. Kannan, and K. Daniilidis, "Sampling based sensor-network deployment," in Proc. IEEE/RSJInt. Conf. Intell. Robots Syst., Sendai, Japan, Sep. 2004, pp. 172-177.
55. M. D. Penrose, "On k-connectivity for a geometric random graph," Random Struct. Algorithms, vol.15, no.2, pp. 145-164, 1999.
56. G. Kortsarz, R. Kraughgamer, and J. L. Lee, "Hardness of approximation for vertex-connectivity network-design problems," in Proc. 5th Int. Workshop Approx. Algor. Combinator. Optim. (APPROX), 2002, pp. 185-199.
57. S. Arora, "Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems," J. ACM, vol.45, no.5, pp. 753-782, 1998.
58. J. S. B. Mitchell, "Guillotine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geometric TSP A'-MST, and related problems," SIAM J. Comput., vol.28, no.4, pp. 1298-1309, 1999.
59. A. Czumaj and A. Lingas, "A polynomial time approximation scheme for Euclidean minimum cost A'-connectivity," in Automata, Languages and Programming, Lecture Notes in Comput. Sci. Aalborg, Berlin, Germany: Springer, 1998, vol.1443, pp. 682-694.
60. J. Chen, A. Jiang, I. A. Kanj, G. Xia, and F. Zhang, "Separability and topology control of quasi unit disk graphs," in Proc. IEEE INFOCOM, May 2007, pp. 2225-2233.