Two-tiered constrained relay node placement in wireless sensor networks: Computational complexity and efficient approximations

IEEE Transactions on Mobile Computing

Volumn 11, Issue 8, 2012, Pages 1399-1411

  Yang, Dejun ^a   Misra, Satyajayant ^b   Fang, Xi ^a   Xue, Guoliang ^a   Zhang, Junshan ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

^b New Mexico State University   (United States)

Author keywords

connectivity and survivability; Relay node placement; wireless sensor networks

Indexed keywords

APPROXIMATION RATIOS; CANDIDATE LOCATIONS; COMMUNICATION RANGE; CONNECTED NETWORKS; CONNECTIVITY AND SURVIVABILITY; OPTIMAL SOLUTIONS; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; RELAY NODE; RELAY NODE PLACEMENT; TRANSMIT DATA;

APPROXIMATION ALGORITHMS; BASE STATIONS; COMPUTATIONAL COMPLEXITY; ENERGY EFFICIENCY; WIRELESS SENSOR NETWORKS;

SENSOR NODES;

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

References (36)

1. I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "Wireless Sensor Networks: A Survey," Computer Networks, vol. 38, pp. 393-422, 2002. (Pubitemid 34181630)
2. J. Bredin, E. Demaine, M. Hajiaghayi, and D. Rus, "Deploying Sensor Networks with Guaranteed Capacity and Fault Tolerance," Proc. Sixth ACM Int'l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc '05), pp. 309-319, 2005. (Pubitemid 43037606)
3. J. Bredin, E. Demaine, M. Hajiaghayi, and D. Rus, "Deploying Sensor Networks with Guaranteed Fault Tolerance," IEEE/ACM Trans. Networking, vol. 18, no. 1, pp. 216-228, Feb. 2010.
4. P. Carmi and M.J. Katz, "Power Assignment in Radio Networks with Two Power Levels," Algorithmica, vol. 47, pp. 183-201, 2007. (Pubitemid 46227254)
5. P. Cheng, C.N. Chuah, and X. Liu, "Energy-Aware Node Placement in Wireless Sensor Networks," Proc. IEEE Global Telecomm. Conf. (GlobeCom '04), pp. 3210-3214, 2004. (Pubitemid 40610928)
6. X. Cheng, D.Z. Du, L. Wang, and B. Xu, "Relay Sensor Placement in Wireless Sensor Networks," J. Wireless Comm. and Networking, 2007.
7. F. Claude, R. Dorrigiv, S. Durocher, and R. Fraser, "Practical Discrete Unit Disk Cover Using an Exact Line-Separable Algorithm," Proc. 20th Int'l Symp. Algorithms and Computation (ISAAC '09), pp. 45-54, 2009.
8. T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms, second ed. MIT Press and McGraw-Hill, 2001.
9. A. Efrat Sándor, P. Fekete, P. Gaddehosur, J. Mitchell, V. Polishchuk, and J. Suomela, "Improved Approximation Algorithms for Relay Placement," Proc. 16th Ann. European Symp. Algorithms (ESA '08), pp. 356-367, 2008.
10. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H Freeman and Co., 1979.
11. G. Gupta and M. Younis, "Fault Tolerant Clustering of Wireless Sensor Networks," Proc. IEEE Wireless Comm. and Networking (WCNC), pp. 1579-1584, 2003.
12. X. Han, X. Cao, E.L. Lloyd, and C.-C. Shen, "Fault-Tolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks," Proc. IEEE INFOCOM, pp. 1667-1675, 2007. (Pubitemid 47334395)
13. B. Hao, J. Tang, and G. Xue, "Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Formulation and Approximation," Proc. Workshop High Performance Switching and Routing (HPSR), pp. 246-250, 2004.
14. W.B. Heinzelman, A.P. Chandrakasan, and H. Balakrishnan, "An Application-Specific Protocol Architecture for Wireless Microsensor Networks," IEEE Trans. Wireless Comm., vol. 1, no. 4, pp. 660-670, Oct. 2002. (Pubitemid 44934253)
15. D.S. Hochbaum, "Approximating Covering and Packing Problems: Set Cover, Vertex Cover, Independent Set, and Related Problems," Approximation Algorithms for NP-Hard Problems, D.S. Hochbaum ed. PWS Publishing Co., pp. 94-143, 1996.
16. Y.T. Hou, Y. Shi, and H.D. Sherali, "On Energy Provisioning and Relay Node Placement for Wireless Sensor Networks," IEEE Trans. Wireless Comm., vol. 4, no. 5, pp. 2579-2590, Sept. 2005. (Pubitemid 41729764)
17. F.K. Hwang, D.S. Richards, and P. Winter, "Annals of Discrete Mathematics," The Steiner Tree Problem, 1992.
18. A. Kashyap, S. Khuller, and M. Shayman, "Relay Placement for Higher Order Connectivity in Wireless Sensor Networks," Proc. IEEE INFOCOM, 2006.
19. L.T. Kou, G. Markowsky, and L. Berman, "A Fast Algorithm for Steiner Trees," Acta Informatica, vol. 15, pp. 141-145, 1981.
20. Q. Li, J. Aslam, and D. Rus, "Online Power-Aware Routing in Wireless Ad-Hoc Networks," Proc. ACM MobiCom, pp. 97-107, 2001. (Pubitemid 33006707)
21. G. Lin and G. Xue, "Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-Length," Information Processing Letters, vol. 69, pp. 53-57, 1999.
22. H. Liu, P.J. Wan, and X.H. Jia, "Fault-Tolerant Relay Node Placement in Wireless Sensor Networks," Proc. Int'l Computing and Combinatorics Conf. (COCOON), pp. 230-239, 2005. (Pubitemid 41450203)
23. E. Lloyd and G. Xue, "Relay Node Placement in Wireless Sensor Networks," IEEE Trans. Computers, vol. 56, no. 1, pp. 134-138, Jan. 2007.
24. W. Maass, "On the Complexity of Nonconvex Covering," SIAM J. Computing, vol. 15, pp. 453-467, 1986.
25. S. Misra, S. Hong, G. Xue, and J. Tang, "Constrained Relay Node Placement in Wireless Sensor Networks: Formulation and Approximations," IEEE/ACM Trans. Networking, vol. 18, no. 2, pp. 434-447, Apr. 2010.
26. N. Mustafa and S. Ray, "PTAS for Geometric Hitting Set Problems via Local Search," Proc. 25th Ann. Symp. Computational Geometry (SCG '09), pp. 17-22, 2009.
27. J. Pan, Y.T. Hou, L. Cai, Y. Shi, and S.X. Shen, "Topology Control for Wireless Sensor Networks," Proc. ACM MobiCom, pp. 286-299, 2003.
28. S. Rajagopalan and V. Vazirani, "Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs," SIAM J. Computing, vol. 28, pp. 525-540, 1998.
29. R. Ravi and D.P. Williamson, "An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems," Algorithmica, vol. 18, pp. 21-43, 1997.
30. R. Ravi and D.P. Williamson, "Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems," Algorithmica, vol. 34, pp. 98-107, 2002.
31. G. Robins and A. Zelikovsky, "Tighter Bounds for Graph Steiner Tree Approximation," SIAM J. Discrete Math., vol. 19, pp. 122-134, 2005.
32. A. Srinivas, G. Zussman, and E. Modiano, "Mobile Backbone Networks-Construction and Maintenance," Proc. Seventh ACM Int'l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc '06), pp. 166-177, 2006.
33. D.B. West, Introduction to Graph Theory. Prentice Hall, 1996.
34. K. Xu, H. Hassanein, G. Takahara, and Q. Wang, "Relay Node Deployment Strategies in Heterogeneous Wireless Sensor Networks: Multiple-Hop Communication Case," Proc. IEEE Second Ann. Comm. Soc. Conf. Sensor and Ad Hoc Comm. and Networks (SECON '05), pp. 575-585, 2005. (Pubitemid 44910461)
35. O. Younis and S. Fahmy, "Distributed Clustering for Ad-Hoc Sensor Networks: A Hybrid, Energy-Efficient Approach," Proc. IEEE INFOCOM, pp. 269-640, 2004.
36. W. Zhang, G. Xue, and S. Misra, "Fault-Tolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms," Proc. IEEE INFOCOM, pp. 1649-1657, 2007. (Pubitemid 47334393)