Fault-tolerant relay node placement in heterogeneous wireless sensor networks

IEEE Transactions on Mobile Computing

Volumn 9, Issue 5, 2010, Pages 643-656

  Han, Xiaofeng ^a   Cao, Xiang ^a   Lloyd, Errol L ^a   Shen, Chien Chung ^a  

^a Institute University of Delaware Newark   (United States)

Author keywords

Approximation algorithms.; Heterogeneous wireless sensor networks; Relay node placement

Indexed keywords

COMMUNICATION PATH; FAULT-TOLERANT; HETEROGENEOUS WIRELESS SENSOR NETWORKS; HIGHER DIMENSIONS; HIGHER NETWORKS; NETWORK CONNECTIVITY; NP-HARD; PERFORMANCE RATIO; RELAY NODE; RELAY NODE PLACEMENT; TRANSMISSION RADIUS; VERTEX DISJOINT PATHS; WIRELESS COMMUNICATIONS; WIRELESS SENSOR NODE;

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; ELECTRIC NETWORK SYNTHESIS; FAULT TOLERANCE; HEURISTIC ALGORITHMS; PHOTOVOLTAIC EFFECTS; QUALITY ASSURANCE; SENSOR NETWORKS; SENSOR NODES; TELECOMMUNICATION EQUIPMENT;

WIRELESS SENSOR NETWORKS;

EID: 77949875456     PISSN: 15361233     EISSN: None     Source Type: Journal    
DOI: 10.1109/TMC.2009.161     Document Type: Article

References (19)

1. G. Lin and G. Xue, "Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-Length," Information Proces ing Letters, vol.69, no.2, pp. 53-57, Jan. 1999.
2. A. Frank and E. Tardos, "An Application of Submodular Flows," Linear Algebra Application, vol.243, nos. 1/2, pp. 329-348, 1989.
3. M. Younis and K. Akkaya, "Strategies and Techniques for Node Placement in Wireless Sensor Networks," Ad Hoc Networks, vol.6, no.4, pp. 621-655, June 2008.
4. I. Akyildiz, D. Pompili, and T. Melodia, "Underwater Acoustic Sensor Networks: Research Challenges," Ad Hoc Networks, vol.3, no.3, pp. 257-279, Mar. 2005.
5. D. Chen, D. Du, X. Hu, G. Lin, L. Wang, and G. Xue, "Approximations for Steiner Trees with Minimum Number of Steiner Points," J. Global Optimization, vol.18, no.1, pp. 17-33, 2000.
6. E.L. Lloyd and G. Xue, "Relay Node Placement in Wireless Sensor Networks," IEEE Trans. Computers, vol.56, no.1, pp. 134-138, Jan. 2007.
7. J.L. Bredin, E.D. Demaine, M. Hajiaghayi, and D. Rus, "Deploying Sensor Networks with Guaranteed Capacity and Fault Tolerance," Proc. ACM MobiHoc, pp. 309-319, 2005.
8. A. Kashyap, S. Khuller, and M. Shayman, "Relay Placement for Higher Order Connectivity in Wireless Sensor Networks," Proc. IEEE INFOCOM, pp. 1-12, Apr. 2006.
9. J. Tang, B. Hao, and A. Sen, "Relay Node Placement in Large Scale Wireless Sensor Networks," Computer Comm., vol.29, no.4, pp. 490-501, Feb. 2006.
10. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.
11. W. Zhang, G. Xue, and S. Misra, "Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algo rithms," Proc. IEEE INFOCOM, pp. 1649-1657, 2007.
12. G. Kortsarz1, R. Krauthgamer, and J.R. Lee, "Hardness of Approximation for Vertex-Connectivity Network Design Problems," SIAM J. Computing, vol.33, no.3, pp. 704-720, 2004.
13. X. Cheng, D. Du, L. Wang, and B. Xu, "Relay Sensor Placement in Wireless Sensor Networks," Wireless Networks, vol.14, no.3, pp. 347-355, June 2008.
14. "Qualnet Simulator," Scalable Network Technologies, Inc., http://www.scalable-networks.com, 2008.
15. R. Ravi and D.P. Williamson, "An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems," Proc. ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 332-341, 1995.
16. R. Ravi and D.P. Williamson, "An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems," Algorithmica, vol.34, pp. 98-107, 2002.
17. G. Kortsarz1 and Z. Nutov, "Approximating Node Connectivity Problems via Set Covers," Algorithmica, vol.37, pp. 75-92, 2003.
18. J. Cheriyan, S. Vempala, and A. Vetta, "Approximation Algorithms for Minimum-Cost K-Vertex Connected Subgraphs," Proc. 34th Ann. ACM Symp. Theory of Computing, pp. 306-312, 2002.
19. N. Li and J.C. Hou, "Flss: A Fault-Tolerant Topology Control Algorithm for Wireless Networks," Proc. ACM MobiCom, pp. 275-286, 2004.