Two-tiered constrained relay node placement in wireless sensor networks: Efficient approximations

SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks

Volumn , Issue , 2010, Pages

  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 DISTANCE; CONNECTED NETWORKS; CONNECTIVITY AND SURVIVABILITY; COVER PROBLEM; ENERGY CONSUMPTION; MULTIHOP TRANSMISSION; NETWORK LIFETIME; OPTIMAL SOLUTIONS; POLYNOMIAL TIME APPROXIMATION ALGORITHMS; RELAY NODE; RELAY NODE PLACEMENT; TRANSMIT DATA;

AD HOC NETWORKS; APPROXIMATION ALGORITHMS; BASE STATIONS; COMMUNICATION; ELECTRIC LOAD FORECASTING; MESH NETWORKING; POLYNOMIAL APPROXIMATION; SENSOR NETWORKS; SENSOR NODES; TELECOMMUNICATION EQUIPMENT;

WIRELESS SENSOR NETWORKS;

EID: 77955115187     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SECON.2010.5508241     Document Type: Conference Paper

References (32)

1. I.F. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cayirci; Wireless sensor networks: a survey; COMNET; Vol. 38(2002), pp. 393-422.
2. J. Bredin, E. Demaine, M. Hajiaghayi and D. Rus; Deploying sensor networks with guaranteed capacity and fault tolerance; Mobihoc'05; pp. 309-319.
3. D. Chen, D.Z. Du, X.D. Hu, G. Lin, L.Wang and G. Xue; Approximations for Steiner trees with minimum number of Steiner points; Journal of Global Optimization; Vol. 18(2000), pp. 17-33.
4. X. Cheng, D.Z. Du, L. Wang and B. Xu; Relay sensor placement in wireless sensor networks; ACM/Springer WINET'07;.
5. F. Claude, R. Dorrigiv, S. Durocher and R. Fraser; Practical discrete unit disk cover using an exact line-separable algorithm; ISAAC'09; pp. 45-54.
6. T. Cormen, C. Leiserson, R. Rivest and C. Stein; Introduction to Algorithms (2nd ed); MIT Press and McGraw-Hill, 2001.
7. A. Efrat, Śandor P. Fekete, P. Gaddehosur, J. Mitchell, V. Polishchuk and J. Suomela; Improved Approximation Algorithms for Relay Placement; ESA'08; pp.356-367.
8. L. Fleischer; A 2-Approximation for minimum cost {0, 1, 2} vertex connectivity; IPCO'01; pp. 115-129.
9. M.R. Garey and D.S. Johnson; Computers and Intractability: A Guide to the Theory of NP-Completeness; W.H Freeman and Co., 1979.
10. G. Gupta and M. Younis; Fault tolerant clustering of wireless sensor networks; WCNC'03, pp. 1579-1584.
11. X. Han, X. Cao, E.L. Lloyd and C.-C. Shen; Fault-tolerant relay node placement in heterogeneous wireless sensor networks; Infocom'07, pp. 1667-1675.
12. B. Hao, J. Tang and G. Xue; Fault-tolerant relay node placement in wireless sensor networks: formulation and approximation; HPSR'04; pp. 246-250.
13. Y.T. Hou, Y. Shi, H.D. Sherali and S.F. Midkiff; Prolonging sensor network lifetime with energy provisioning and relay node placement; Secon'05; pp. 295-304.
14. F.K. Hwang, D.S. Richards and P. Winter; The Steiner Tree Problem; Annals of Discrete Mathematics, 1992.
15. A. Kashyap, S. Khuller and M. Shayman; Relay placement for higher order connectivity in wireless sensor networks; Infocom'06.
16. L.T. Kou, G. Markowsky and L. Berman; A fast algorithm for Steiner trees; Acta Informatica; Vol. 15(1981); pp. 141-145.
17. D. Lichtenstein; Planar formulae and their uses; SIAM Journal on Computing; Vol. 11(1982), pp. 329-343.
18. G. Lin and G. Xue; Steiner tree problem with minimum number of Steiner points and bounded edge-length; Information Processing Letters; Vol. 69(1999), pp. 53-57.
19. H. Liu, P.J. Wan and X.H. Jia; Fault-tolerant relay node placement in wireless sensor networks; LNCS; Vol. 3595(2005), pp. 230-239.
20. E. Lloyd and G. Xue; Relay node placement in wireless sensor networks; IEEE Transactions on Computers; Vol. 56(2007), pp. 134-138.
21. S. Misra, S. Hong, G. Xue and J. Tang; Constrained relay node placement in wireless sensor networks to meet connectivity and survivability requirements; Infocom'08.
22. N. Mustafa and S. Ray; PTAS for geometric hitting set problems via local search; SCG'09; pp. 17-22.
23. J. Pan, Y.T. Hou, L. Cai, Y. Shi, S.X. Shen; Topology control for wireless sensor networks; Mobicom'03, pp. 286-299.
24. S. Rajagopalan and V. Vazirani; Primal-Dual RNC approximation algorithms for set cover and covering integer programs; SIAM Journal on Computing; Vol. 28(1998), pp. 525-540.
25. R. Ravi and D.P. Williamson; An approximation algorithm for minimum-cost vertex-connectivity problems; Algorithmica;Vol.18(1997), pp.21-43.
26. R. Ravi and D.P. Williamson; Erratum: an approximation algorithm for minimum-cost vertex-connectivity problems; Algorithmica; Vol. 34(2002), pp.98-107.
27. G. Robins and A. Zelikovsky; Tighter bounds for graph Steiner tree approximation; SIAM J. on Disc. Math.; Vol. 19(2005), pp. 122-134.
28. A. Srinivas, G. Zussman, and E. Modiano; Mobile backbone networks- Construction and maintenance, Mobihoc'06, pp. 166-177.
29. V. Vazirani, Chapter 2, Approximation Algorithms, Springer-Verlag, 2001.
30. D.B. West, Introduction to Graph Theory, Prentice Hall, 1996.
31. K. Xu, H. Hassanein, G. Takahara and Q. Wang; Relay node deployment strategies in heterogeneous wireless sensor networks: multiple-hop communication case; Secon'05, pp. 575-585.
32. W. Zhang, G. Xue, and S. Misra; Fault-tolerant relay node placement in wireless sensor networks: problems and algorithms; Infocom'07; pp.1649-1657.