Relay placement for higher order connectivity in wireless sensor networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2006, Pages

  Kashyap, Abhishek ^a   Khuller, Samir ^b   Shayman, Mark ^a  

^a UNIVERSITY OF MARYLAND   (United States)

^b Institute of Advanced Computer Science   (United States)

Author keywords

Approximation algorithms; Fault tolerant topology design; Relay placement; Sensor networks

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTER SYSTEM RECOVERY; PROBLEM SOLVING; RELAY CONTROL SYSTEMS; TRANSMITTERS; TREES (MATHEMATICS);

EUCLIDEAN METRICS; MINIMUM DEGREE MINIMUM SPANNING TREE; RELAY PLACEMENT;

WIRELESS SENSOR NETWORKS;

EID: 39049124783     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2006.273     Document Type: Conference Paper

References (27)

1. G. Gupta and M. Younis, "Fault-tolerant clustering of wireless sensor networks," IEEE WCNC, pp. 1579-1584, 2003.
2. _, "Load-balanced clustering of wireless sensor networks," IEEE Intl. conf. on Comm., pp. 1848-1852, 2003.
3. J. Pan, Y. T. Hou, L. Cai, Y. Shi, and S. X. Shen, "Topology control for wireless sensor networks," IEEE/ACM Mobicom, pp. 286-299, 2003.
4. B. Hao, J. Tang, and G. Xue, "Fault-tolerant relay node placement in wireless sensor networks: Formulation and approximation," IEEE Workshop on High Performance Switching and Routing, pp. 246-250, 2004.
5. H. Liu, P. Wan, and X. Jia, "Fault-tolerant relay node placement in wireless sensor networks," International Computing and Combinatorics Conference (COCOON), 2005.
6. G.-H. Lin and L. Wang, "Steiner tree problem with minimum number of steiner points and bounded edge-length," Information Processing Letters, vol. 69, pp. 53-57, 1999.
7. I. Mǎndoiu and A. Zelikovsky, "A note on the mst heuristic for bounded edge-length steiner trees with minimum number of steiner points," Information Processing Letters, vol. 75(4), pp. 165-167, 2000.
8. 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," Theoretical Computer Science, vol. 262, pp. 83-99, 2001.
9. X. Cheng, D.-Z. Du, L. Wang, and B. Xu, "Relay sensor placement in wireless sensor networks," ACM Winet, 2004.
10. P. Gupta and P. R. Kumar, "Critical power for asymptotic connectivity in wireless networks," Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H Fleming, W. M. McEneaney, G. Yin, and Q. Zhang (Eds.), 1998.
11. C. Bettstetter, "On the connectivity of ad hoc networks," The Computer Journal, vol. 47(4), pp. 432-447, 2004.
12. X.-Y. Li, P.-J. Wan, Y. Wang, and C-W. Yi, "Fault tolerant deployment and topology control in wireless networks," IEEE/ACM MobiHoc, pp. 117-128, 2003.
13. M. Garey and D. Johnson, Computers and Intractability: A guide to the theory of NP-Completeness. Freeman and Company, 1979.
14. S. Khuller and U. Vishkin, "Biconnectivity approximations and graph carvings," Journal of the ACM, vol. 41(2), pp. 214-235, 1994.
15. H. N. Gabow, "A matroid approach to finding edge connectivity and packing arborescences," IEEE Annual Symposium on Foundations of Computer Science, pp. 812-822, 1991.
16. E. L. Lawler, Combinatorial optimization: Networks and matroids. Holt, Rinehart and Winston, New York, 1976.
17. A. Frank, "A weighted matroid intersection algorithm," Journal of Algorithms, vol. 2, pp. 328-336, 1981.
18. J. Roskind and R. E. Tarjan, "A note on finding minimum-cost edgedisjoint spanning trees," Mathematics of Operations Research, vol. 10(4), pp. 701-708, 1985.
19. C. Monma and S. Suri, "Transitions in geometric minimum spanning tree," Discrete and Computational Geometry, vol. 8, pp. 265-293, 1992.
20. S. Khuller and B. Raghavachari, "Improved approximation algorithms for uniform connectivity problems," Journal of Algorithms, vol. 21(2), pp. 434-450, 1996.
21. G. Kortsarz and Z. Nutov, "Approximating node connectivity problems via set covers," Algorithmica, vol. 37, pp. 75-92, 2003.
22. A. Frank and E. Tardos, "An application of submodular flows," Linear Algebra and its Applications, vol. 114/115, pp. 320-348, 1989.
23. G. Robins and J. S. Salowe, "Low-degree minimum spanning trees," Discrete Computational Geometry, vol. 14, pp. 151-165, 1995.
24. E. Arkin, E. Demaine, and J. Mitchell, "The puddle-jumper problem," Personal Communication, 2005.
25. J. M. Steele, "Growth rates of euclidian minimal spanning trees with power weighted edges," The Annals of Probability, vol. 16(4), pp. 1767-1787, 1988.
26. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to algorithms, 2nd ed. The MIT Press, 2001.
27. Concorde, http://www.tsp.gatech.edu/concorde.html.