메뉴 건너뛰기




Volumn , Issue , 2011, Pages 25-34

Constrained relay node placement in energy harvesting wireless sensor networks

Author keywords

constant approximation algorithm; Energy harvesting; relay node placement; wireless sensor networks

Indexed keywords

CANDIDATE LOCATIONS; CONSTANT APPROXIMATION ALGORITHMS; LOW APPROXIMATION; NP-HARD; POLYNOMIAL-TIME; RELAY NODE; RELAY NODE PLACEMENT; WIRELESS SENSOR;

EID: 83355164796     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MASS.2011.137     Document Type: Conference Paper
Times cited : (37)

References (34)
  • 2
    • 29844456163 scopus 로고    scopus 로고
    • Deploying sensor networks with guaranteed capacity and fault tolerance
    • J. Bredin, E. Demaine, M. Hajiaghayi, and D. Rus. Deploying sensor networks with guaranteed capacity and fault tolerance. In ACM MOBICOM, pages 309-319, 2005.
    • (2005) ACM MOBICOM , pp. 309-319
    • Bredin, J.1    Demaine, E.2    Hajiaghayi, M.3    Rus, D.4
  • 4
    • 18144379839 scopus 로고    scopus 로고
    • Energy-aware node placement in wireless sensor networks
    • P. Cheng, C.N. Chuah, and X. Liu. Energy-aware node placement in wireless sensor networks. In IEEE GLOBECOM, pages 3210-3214, 2004.
    • (2004) IEEE GLOBECOM , pp. 3210-3214
    • Cheng, P.1    Chuah, C.N.2    Liu, X.3
  • 5
    • 67749130854 scopus 로고    scopus 로고
    • Relay sensor placement in wireless sensor networks
    • X. Cheng, D.Z. Du, L. Wang, and B. Xu. Relay sensor placement in wireless sensor networks. ACM/Springer WINET, 14(3):425-443, 2007.
    • (2007) ACM/Springer WINET , vol.14 , Issue.3 , pp. 425-443
    • Cheng, X.1    Du, D.Z.2    Wang, L.3    Xu, B.4
  • 8
    • 74549153144 scopus 로고    scopus 로고
    • Steady and fair rate allocation for rechargeable sensors in perpetual sensor networks
    • ACM
    • K. Fan, Z. Zheng, and P. Sinha. Steady and fair rate allocation for rechargeable sensors in perpetual sensor networks. In ACM SenSys, pages 239-252. ACM, 2008.
    • (2008) ACM SenSys , pp. 239-252
    • Fan, K.1    Zheng, Z.2    Sinha, P.3
  • 9
    • 84947242444 scopus 로고    scopus 로고
    • A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity
    • Integer Programming and Combinatorial Optimization 8th International IPCO Conference Utrecht, The Netherlands, June 13-15, 2001 Proceedings
    • L. Fleischer. A 2-approximation for minimum cost 0, 1, 2 vertex connectivity. In Integer Programming and Combinatorial Optimization (IPCO), pages 115-129, 2001. (Pubitemid 33291955)
    • (2001) LECTURE NOTES IN COMPUTER SCIENCE , Issue.2081 , pp. 115-129
    • Fleischer, L.1
  • 10
    • 84907695140 scopus 로고    scopus 로고
    • Fault tolerant clustering of wireless sensor networks
    • G. Gupta and M. Younis. Fault tolerant clustering of wireless sensor networks. In IEEE WCNC, pages 1579-1584, 2003.
    • (2003) IEEE WCNC , pp. 1579-1584
    • Gupta, G.1    Younis, M.2
  • 11
    • 34548317469 scopus 로고    scopus 로고
    • Fault-tolerant relay node placement in heterogeneous wireless sensor networks
    • X. Han, X. Cao, E.L. Lloyd, and C.-C. Shen. Fault-tolerant relay node placement in heterogeneous wireless sensor networks. In IEEE INFOCOM, pages 1667-1675, 2007.
    • (2007) IEEE INFOCOM , pp. 1667-1675
    • Han, X.1    Cao, X.2    Lloyd, E.L.3    Shen, C.-C.4
  • 12
    • 2942525470 scopus 로고    scopus 로고
    • Fault-tolerant relay node placement in wireless sensor networks: Formulation and approximation
    • B. Hao, J. Tang, and G. Xue. Fault-tolerant relay node placement in wireless sensor networks: formulation and approximation. In IEEE HPSR, pages 246-250, 2004.
    • (2004) IEEE HPSR , pp. 246-250
    • Hao, B.1    Tang, J.2    Xue, G.3
  • 13
    • 33845480083 scopus 로고    scopus 로고
    • Prolonging sensor network lifetime with energy provisioning and relay node placement
    • Y.T. Hou, Y. Shi, H.D. Sherali, and S.F. Midkiff. Prolonging sensor network lifetime with energy provisioning and relay node placement. In IEEE SECON, pages 295-304, 2005.
    • (2005) IEEE SECON , pp. 295-304
    • Hou, Y.T.1    Shi, Y.2    Sherali, H.D.3    Midkiff, S.F.4
  • 16
    • 39049124783 scopus 로고    scopus 로고
    • Relay placement for higher order connectivity in wireless sensor networks
    • A. Kashyap, S. Khuller, and M. Shayman. Relay placement for higher order connectivity in wireless sensor networks. In IEEE INFOCOM, pages 1-12, 2006.
    • (2006) IEEE INFOCOM , pp. 1-12
    • Kashyap, A.1    Khuller, S.2    Shayman, M.3
  • 17
    • 34147107399 scopus 로고    scopus 로고
    • Constructing a wireless sensor network to fully cover critical grids by deploying minimum sensors on grid points is np-complete
    • W. C. Ke, B. H. Liu, and M. J. Tsai. Constructing a wireless sensor network to fully cover critical grids by deploying minimum sensors on grid points is np-complete. IEEE Trans. on Computers, 56:710-715, 2007.
    • (2007) IEEE Trans. on Computers , vol.56 , pp. 710-715
    • Ke, W.C.1    Liu, B.H.2    Tsai, M.J.3
  • 20
    • 0032755118 scopus 로고    scopus 로고
    • Steiner tree problem with minimum number of steiner points and bounded edge-length
    • G. Lin and G. Xue. Steiner tree problem with minimum number of steiner points and bounded edge-length. Information Processing Letters, 69:53-57, 1999.
    • (1999) Information Processing Letters , vol.69 , pp. 53-57
    • Lin, G.1    Xue, G.2
  • 22
    • 26844474666 scopus 로고    scopus 로고
    • Fault-tolerant relay node placement in wireless sensor networks
    • Computing and Combinatorics: 11th Annual International Conference, COCOON 2005. Proceedings
    • H. Liu, P.J. Wan, and X.H. Jia. Fault-tolerant relay node placement in wireless sensor networks. LNCS, 3595:230-239, 2005. (Pubitemid 41450203)
    • (2005) Lecture Notes in Computer Science , vol.3595 , pp. 230-239
    • Liu, H.1    Wan, P.-J.2    Jia, X.3
  • 23
    • 85008060351 scopus 로고    scopus 로고
    • Relay node placement in wireless sensor networks
    • E. Lloyd and G. Xue. Relay node placement in wireless sensor networks. IEEE Transactions on Computers, 56:134-138, 2007.
    • (2007) IEEE Transactions on Computers , vol.56 , pp. 134-138
    • Lloyd, E.1    Xue, G.2
  • 24
    • 51349128745 scopus 로고    scopus 로고
    • Constrained relay node placement in wireless sensor networks to meet connectivity and survivability requirements
    • April
    • S. Misra, S. Hong, G. Xue, and J. Tang. Constrained relay node placement in wireless sensor networks to meet connectivity and survivability requirements. In INFOCOM'08, pages 281-285, April 2008.
    • (2008) INFOCOM'08 , pp. 281-285
    • Misra, S.1    Hong, S.2    Xue, G.3    Tang, J.4
  • 25
    • 77951115837 scopus 로고    scopus 로고
    • Constrained relay node placement in wireless sensor networks: Formulation and approximations
    • S. Misra, S. Hong, G. Xue, and J. Tang. Constrained relay node placement in wireless sensor networks: Formulation and approximations. IEEE/ACM Transactions on Networking, 18(2):434-448, 2010.
    • (2010) IEEE/ACM Transactions on Networking , vol.18 , Issue.2 , pp. 434-448
    • Misra, S.1    Hong, S.2    Xue, G.3    Tang, J.4
  • 26
    • 1542358975 scopus 로고    scopus 로고
    • Topology control for wireless sensor networks
    • J. Pan, Y.T. Hou, L. Cai, Y. Shi, and S.X. Shen. Topology control for wireless sensor networks. In Mobicom, pages 286-299, 2003.
    • (2003) Mobicom , pp. 286-299
    • Pan, J.1    Hou, Y.T.2    Cai, L.3    Shi, Y.4    Shen, S.X.5
  • 27
    • 0347669560 scopus 로고    scopus 로고
    • An approximation algorithm for minimum-cost vertex-connectivity problems
    • R. Ravi and D. Williamson. An approximation algorithm for minimum-cost vertex-connectivity problems. Algorithmica, 18:21-43, 1997.
    • (1997) Algorithmica , vol.18 , pp. 21-43
    • Ravi, R.1    Williamson, D.2
  • 28
    • 0011588974 scopus 로고    scopus 로고
    • Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems
    • R. Ravi and D. Williamson. Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems. Algorithmica, 34:98-107, 2002.
    • (2002) Algorithmica , vol.34 , pp. 98-107
    • Ravi, R.1    Williamson, D.2
  • 29
    • 33644608040 scopus 로고    scopus 로고
    • Tighter bounds for graph steiner tree approximation
    • G. Robins and A. Zelikovsky. Tighter bounds for graph steiner tree approximation. SIAM J. on Disc. Math., 19:122-134, 2005.
    • (2005) SIAM J. on Disc. Math. , vol.19 , pp. 122-134
    • Robins, G.1    Zelikovsky, A.2
  • 31
    • 33748037385 scopus 로고    scopus 로고
    • Mobile backbone networks-construction and maintenance
    • A. Srinivas, G. Zussman, and E. Modiano. Mobile backbone networks-construction and maintenance. In Mobihoc, pages 166-177, 2006.
    • (2006) Mobihoc , pp. 166-177
    • Srinivas, A.1    Zussman, G.2    Modiano, E.3
  • 32
    • 51249102238 scopus 로고    scopus 로고
    • Design, modeling, and capacity planning for micro-solar power sensor networks
    • J. Taneja, J. Jeong, and D. Culler. Design, modeling, and capacity planning for micro-solar power sensor networks. In IEEE IPSN, pages 407-418, 2008.
    • (2008) IEEE IPSN , pp. 407-418
    • Taneja, J.1    Jeong, J.2    Culler, D.3
  • 33
    • 83355165552 scopus 로고    scopus 로고
    • Constrained relay node placement in wireless sensor networks to meet connectivity and survivability requirements
    • D. Yang, S. Misra, X. Fang, G. Xue, and J. Zhang. Constrained relay node placement in wireless sensor networks to meet connectivity and survivability requirements. In SECON, 2010.
    • (2010) SECON
    • Yang, D.1    Misra, S.2    Fang, X.3    Xue, G.4    Zhang, J.5
  • 34
    • 34548357224 scopus 로고    scopus 로고
    • Fault-tolerant relay node placement in wireless sensor networks: Problems and algorithms
    • W. Zhang, G. Xue, and S. Misra. Fault-tolerant relay node placement in wireless sensor networks: problems and algorithms. In IEEE INFOCOM, pages 1649-1657, 2007.
    • (2007) IEEE INFOCOM , pp. 1649-1657
    • Zhang, W.1    Xue, G.2    Misra, S.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.