Fault-tolerant relay deployment for k node-disjoint paths in wireless sensor networks

IFIP Wireless Days

Volumn 1, Issue 1, 2011, Pages

  Sitanayah, Lanny ^a   Brown, Kenneth N ^a   Sreenan, Cormac J ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

network deployment planning; node disjoint paths; relay placement; wireless sensor networks

Indexed keywords

ALTERNATIVE ROUTES; DEPLOYMENT PLANNING; FAULT-TOLERANT; INITIAL DESIGN; NETWORK DEPLOYMENT; NODE-DISJOINT PATHS; OFF-LINE ALGORITHM; PHYSICAL NETWORK; RELAY NODE; RELAY NODE PLACEMENT; RELAY PLACEMENT; RELIABLE DELIVERY; TOPOLOGY DESIGN; WIRELESS SENSOR;

ALGORITHMS; ELECTRIC NETWORK TOPOLOGY; TOPOLOGY;

SENSOR NODES;

EID: 84856317491     PISSN: 21569711     EISSN: 2156972X     Source Type: Conference Proceeding    
DOI: 10.1109/WD.2011.6098176     Document Type: Conference Paper

References (16)

1. D. Torrieri, "Algorithms for Finding an Optimal Set of Short Disjoint Paths in a Communication Network," IEEE Transactions on Communications, vol. 40, no. 11, pp. 1698-1702, 1992.
2. T. Feo and M. Resende, "Greedy Randomized Adaptive Search Procedures,"Journal of Global Optimization, vol. 6, pp. 109-133, 1995.
3. B. Hao, J. Tang, and G. Xue, "Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Formulation and Approximation," in Proc. Workshop High Performance Switching and Routing (HPSR'04), 2004, pp. 246-250.
4. J. Bredin, E. Demaine, M. Hajiaghayi, and D. Rus, "Deploying Sensor Networks with Guaranteed Capacity and Fault Tolerance," in Proc. 6th ACM Int'l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc'05), 2005, pp. 309-319.
5. J. Pu, Z. Xiong, and X. Lu, "Fault-Tolerant Deployment with k-connectivity and Partial k-connectivity in Sensor Networks," Wireless Communications and Mobile Computing, vol. 9, no. 7, pp. 909-919, 2008.
6. A. Kashyap, S. Khuller, and M. Shayman, "Relay Placement for Fault Tolerance in Wireless Networks in Higher Dimensions," Computational Geometry, 2010.
7. X. Han, X. Cao, E. Lloyd, and C. Shen, "Fault-tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks," IEEE Trans. Mobile Computing, vol. 9, no. 5, pp. 643-656, 2010.
8. W. Zhang, G. Xue, and S. Misra, "Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms," in Proc. 26th Ann. IEEE Conf. Computer Communications (INFOCOM'07), 2007, pp. 1649-1657.
9. S. Misra, S. Hong, G. Xue, and J. Tang, "Constrained Relay Node Placement in Wireless Sensor Networks to Meet Connectivity and Survivability Requirements," in Proc. 27th Ann. IEEE Conf. Computer Communications (INFOCOM'08), 2008, pp. 281-285.
10. R. Bhandari, "Optimal Physical Diversity Algorithms and Survivable Networks," in Proc. 2nd IEEE Symp. Computers and Communications (ISCC'97), 1997, pp. 433-441.
11. L. Ford and D. Fulkerson, Flows in Networks. Princeton, University Press, 1962.
12. J. Kleinberg and E. Tardos, Algorithm Design. Addison-Wesley, 2011.
13. S. Martins, P. Pardalos, M. Resende, and C. Ribeiro, "Greedy Randomized Adaptive Search Procedures for the Steiner Problem in Graphs," in Randomization Methods in Algorithmic Design, ser. DIMACS Series on Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1999, vol. 43, pp. 133-145.
14. L. Sitanayah, K. Brown, and C. Sreenan, "Relay Node Placement for k Node-Disjoint Paths in Constrained Wireless Sensor Network Deployment Planning," Dept. of Computer Science, University College Cork, Tech. Rep. UCC-CS-2011-07-17, Jul. 2011.
15. C. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ: Prentice Hall, 1982.
16. R. Ravi and D. Williamson, "An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems," Algorithmica, vol. 18, no. 1, pp. 21-43, 1997.