
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Guoliang Xue, Xi Fang, Satyajayant Misra, Dejun Yang, Junshan Zhang, "TwoTiered Constrained Relay Node Placement in Wireless Sensor Networks: Computational Complexity and Efficient Approximations," IEEE Transactions on Mobile Computing, vol. 11, no. 8, pp. 13991411, Aug., 2012.  
BibTex  x  
@article{ 10.1109/TMC.2011.126, author = {Guoliang Xue and Xi Fang and Satyajayant Misra and Dejun Yang and Junshan Zhang}, title = {TwoTiered Constrained Relay Node Placement in Wireless Sensor Networks: Computational Complexity and Efficient Approximations}, journal ={IEEE Transactions on Mobile Computing}, volume = {11}, number = {8}, issn = {15361233}, year = {2012}, pages = {13991411}, doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2011.126}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Mobile Computing TI  TwoTiered Constrained Relay Node Placement in Wireless Sensor Networks: Computational Complexity and Efficient Approximations IS  8 SN  15361233 SP1399 EP1411 EPD  13991411 A1  Guoliang Xue, A1  Xi Fang, A1  Satyajayant Misra, A1  Dejun Yang, A1  Junshan Zhang, PY  2012 KW  Relays KW  Approximation algorithms KW  Approximation methods KW  Base stations KW  Wireless sensor networks KW  Steiner trees KW  connectivity and survivability. KW  Relay node placement KW  wireless sensor networks VL  11 JA  IEEE Transactions on Mobile Computing ER   
[1] I.F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E. Cayirci, "Wireless Sensor Networks: A Survey," Computer Networks, vol. 38, pp. 393422, 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. 309319, 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. 216228, Feb. 2010.
[4] P. Carmi and M.J. Katz, "Power Assignment in Radio Networks with Two Power Levels," Algorithmica, vol. 47, pp. 183201, 2007.
[5] P. Cheng, C.N. Chuah, and X. Liu, "EnergyAware Node Placement in Wireless Sensor Networks," Proc. IEEE Global Telecomm. Conf. (GlobeCom '04), pp. 32103214, 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 LineSeparable Algorithm," Proc. 20th Int'l Symp. Algorithms and Computation (ISAAC '09), pp. 4554, 2009.
[8] T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms, second ed. MIT Press and McGrawHill, 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. 356367, 2008.
[10] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness. 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. 15791584, 2003.
[12] X. Han, X. Cao, E.L. Lloyd, and C.C. Shen, "FaultTolerant Relay Node Placement in Heterogeneous Wireless Sensor Networks," Proc. IEEE INFOCOM, pp. 16671675, 2007.
[13] B. Hao, J. Tang, and G. Xue, "FaultTolerant Relay Node Placement in Wireless Sensor Networks: Formulation and Approximation," Proc. Workshop High Performance Switching and Routing (HPSR), pp. 246250, 2004.
[14] W.B. Heinzelman, A.P. Chandrakasan, and H. Balakrishnan, "An ApplicationSpecific Protocol Architecture for Wireless Microsensor Networks," IEEE Trans. Wireless Comm., vol. 1, no. 4, pp. 660670, Oct. 2002.
[15] D.S. Hochbaum, "Approximating Covering and Packing Problems: Set Cover, Vertex Cover, Independent Set, and Related Problems," Approximation Algorithms for NPHard Problems, D.S. Hochbaum ed. PWS Publishing Co., pp. 94143, 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. 25792590, 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. 141145, 1981.
[20] Q. Li, J. Aslam, and D. Rus, "Online PowerAware Routing in Wireless AdHoc Networks," Proc. ACM MobiCom, pp. 97107, 2001.
[21] G. Lin and G. Xue, "Steiner Tree Problem with Minimum Number of Steiner Points and Bounded EdgeLength," Information Processing Letters, vol. 69, pp. 5357, 1999.
[22] H. Liu, P.J. Wan, and X.H. Jia, "FaultTolerant Relay Node Placement in Wireless Sensor Networks," Proc. Int'l Computing and Combinatorics Conf. (COCOON), pp. 230239, 2005.
[23] E. Lloyd and G. Xue, "Relay Node Placement in Wireless Sensor Networks," IEEE Trans. Computers, vol. 56, no. 1, pp. 134138, Jan. 2007.
[24] W. Maass, "On the Complexity of Nonconvex Covering," SIAM J. Computing, vol. 15, pp. 453467, 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. 434447, 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. 1722, 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. 286299, 2003.
[28] S. Rajagopalan and V. Vazirani, "PrimalDual RNC Approximation Algorithms for Set Cover and Covering Integer Programs," SIAM J. Computing, vol. 28, pp. 525540, 1998.
[29] R. Ravi and D.P. Williamson, "An Approximation Algorithm for MinimumCost VertexConnectivity Problems," Algorithmica, vol. 18, pp. 2143, 1997.
[30] R. Ravi and D.P. Williamson, "Erratum: An Approximation Algorithm for MinimumCost VertexConnectivity Problems," Algorithmica, vol. 34, pp. 98107, 2002.
[31] G. Robins and A. Zelikovsky, "Tighter Bounds for Graph Steiner Tree Approximation," SIAM J. Discrete Math., vol. 19, pp. 122134, 2005.
[32] A. Srinivas, G. Zussman, and E. Modiano, "Mobile Backbone NetworksConstruction and Maintenance," Proc. Seventh ACM Int'l Symp. Mobile Ad Hoc Networking and Computing (MobiHoc '06), pp. 166177, 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: MultipleHop Communication Case," Proc. IEEE Second Ann. Comm. Soc. Conf. Sensor and Ad Hoc Comm. and Networks (SECON '05), pp. 575585, 2005.
[35] O. Younis and S. Fahmy, "Distributed Clustering for AdHoc Sensor Networks: A Hybrid, EnergyEfficient Approach," Proc. IEEE INFOCOM, pp. 269640, 2004.
[36] W. Zhang, G. Xue, and S. Misra, "FaultTolerant Relay Node Placement in Wireless Sensor Networks: Problems and Algorithms," Proc. IEEE INFOCOM, pp. 16491657, 2007.