• Publication
  • 2012
  • Issue No. 8 - Aug.
  • Abstract - Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Computational Complexity and Efficient Approximations
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Computational Complexity and Efficient Approximations
Aug. 2012 (vol. 11 no. 8)
pp. 1399-1411
Guoliang Xue, Arizona State University, Tempe
Xi Fang, Arizona State University, Tempe
Satyajayant Misra, New Mexico State University, Las Cruces
Dejun Yang, Arizona State University, Tempe
Junshan Zhang, Arizona State University, Tempe
In wireless sensor networks, relay node placement has been proposed to improve energy efficiency. In this paper, we study two-tiered constrained relay node placement problems, where the relay nodes can be placed only at some prespecified candidate locations. To meet the connectivity requirement, we study the connected single-cover problem where each sensor node is covered by a base station or a relay node (to which the sensor node can transmit data), and the relay nodes form a connected network with the base stations. To meet the survivability requirement, we study the 2-connected double-cover problem where each sensor node is covered by two base stations or relay nodes, and the relay nodes form a 2-connected network with the base stations. We study these problems under the assumption that R \ge 2r > 0, where R and r are the communication ranges of the relay nodes and the sensor nodes, respectively. We investigate the corresponding computational complexities, and propose novel polynomial time approximation algorithms for these problems. Specifically, for the connected single-cover problem, our algorithms have {\cal O}(1)-approximation ratios. For the 2-connected double-cover problem, our algorithms have {\cal O}(1)-approximation ratios for practical settings and {\cal O}(\ln n)-approximation ratios for arbitrary settings. Experimental results show that the number of relay nodes used by our algorithms is no more than twice of that used in an optimal solution.

[1] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "Wireless Sensor Networks: A Survey," Computer Networks, vol. 38, pp. 393-422, 2002.
[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.
[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.
[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.
[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.
[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.
[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.
[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.
[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.
[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.
[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.

Index Terms:
Relays,Approximation algorithms,Approximation methods,Base stations,Wireless sensor networks,Steiner trees,connectivity and survivability.,Relay node placement,wireless sensor networks
Citation:
Guoliang Xue, Xi Fang, Satyajayant Misra, Dejun Yang, Junshan Zhang, "Two-Tiered Constrained Relay Node Placement in Wireless Sensor Networks: Computational Complexity and Efficient Approximations," IEEE Transactions on Mobile Computing, vol. 11, no. 8, pp. 1399-1411, Aug. 2012, doi:10.1109/TMC.2011.126
Usage of this product signifies your acceptance of the Terms of Use.