메뉴 건너뛰기




Volumn 63, Issue 12, 2014, Pages 2933-2947

Approximation algorithms for 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

WIRELESS SENSOR NETWORKS;

EID: 84910047503     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2013.171     Document Type: Article
Times cited : (56)

References (37)
  • 3
    • 0006687948 scopus 로고    scopus 로고
    • Approximations for Steiner trees with minimum number of Steinerpoints
    • D. Chen, D. Z. Du, X. D. Hu, G. Lin, L. Wang, and G. Xue, "Approximations for Steiner trees with minimum number of Steinerpoints," J. Global Optim., vol. 18, pp. 17-33, 2000.
    • (2000) J. Global Optim. , vol.18 , pp. 17-33
    • Chen, D.1    Du, D.Z.2    Hu, X.D.3    Lin, G.4    Wang, L.5    Xue, G.6
  • 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, vol. 14, no. 3, pp. 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
    • K. Fan, Z. Zheng, and P. Sinha, "Steady and fair rate allocation for rechargeable sensors in perpetual sensor networks," in Proc. ACM SenSys, 2008, pp. 239-252.
    • Proc. ACM SenSys, 2008 , pp. 239-252
    • Fan, K.1    Zheng, Z.2    Sinha, P.3
  • 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 Proc. IEEE High Perform. Switching Routing (HPSR), 2004, pp. 246-250.
    • Proc. IEEE High Perform. Switching Routing (HPSR), 2004 , pp. 246-250
    • Hao, B.1    Tang, J.2    Xue, G.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. Comput., vol. 56, pp. 710- 715, 2007.
    • (2007) IEEE Trans. Comput. , vol.56 , pp. 710-715
    • Ke, W.C.1    Liu, B.H.2    Tsai, M.J.3
  • 18
    • 34250246836 scopus 로고
    • A fast algorithm for Steiner trees
    • L. T. Kou, G. Markowsky, and L. Berman, "A fast algorithm for Steiner trees," Acta Informatica, vol. 15, pp. 141-145, 1981.
    • (1981) Acta Informatica , vol.15 , pp. 141-145
    • Kou, L.T.1    Markowsky, G.2    Berman, L.3
  • 19
    • 0002794707 scopus 로고
    • Planar formulae and their uses
    • D. Lichtenstein, "Planar formulae and their uses," SIAM J. Comput., vol. 11, pp. 329-343, 1982.
    • (1982) SIAM J. Comput. , vol.11 , pp. 329-343
    • Lichtenstein, D.1
  • 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," Inf. Process. Lett., vol. 69, pp. 53-57, 1999.
    • (1999) Inf. Process. Lett. , vol.69 , pp. 53-57
    • Lin, G.1    Xue, G.2
  • 22
    • 26844474666 scopus 로고    scopus 로고
    • Fault-tolerant relay node placement in wireless sensor networks
    • H. Liu, P. J. Wan, and X. H. Jia, "Fault-tolerant relay node placement in wireless sensor networks," LNCS, vol. 3595, pp. 230-239, 2005.
    • (2005) LNCS , vol.3595 , pp. 230-239
    • Liu, H.1    Wan, P.J.2    Jia, X.H.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 Trans. Comput., vol. 56, pp. 134-138, 2007.
    • (2007) IEEE Trans. Comput. , vol.56 , pp. 134-138
    • Lloyd, E.1    Xue, G.2
  • 24
    • 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 Trans. Netw., vol. 18, no. 2, pp. 434-448, 2010.
    • (2010) IEEE/ACM Trans. Netw. , vol.18 , Issue.2 , pp. 434-448
    • Misra, S.1    Hong, S.2    Xue, G.3    Tang, J.4
  • 27
    • 0000126694 scopus 로고
    • Fast approximation algorithms for fractional packing and covering problems
    • S. A. Plotkin, D. B. Shmoys, and E. Tardos, "Fast approximation algorithms for fractional packing and covering problems," J. Math. Oper. Res., vol. 20, no. 2, pp. 257-301, 1995.
    • (1995) J. Math. Oper. Res. , vol.20 , Issue.2 , pp. 257-301
    • Plotkin, S.A.1    Shmoys, D.B.2    Tardos, E.3
  • 28
    • 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, vol. 18, pp. 21-43, 1997.
    • (1997) Algorithmica , vol.18 , pp. 21-43
    • Ravi, R.1    Williamson, D.2
  • 29
    • 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, vol. 34, pp. 98-107, 2002.
    • (2002) Algorithmica , vol.34 , pp. 98-107
    • Ravi, R.1    Williamson, D.2
  • 30
    • 33644608040 scopus 로고    scopus 로고
    • Tighter bounds for graph Steiner tree approximation
    • G. Robins and A. Zelikovsky, "Tighter bounds for graph Steiner tree approximation," SIAM J. Disc. Math., vol. 19, pp. 122-134, 2005.
    • (2005) SIAM J. Disc. Math. , vol.19 , pp. 122-134
    • Robins, G.1    Zelikovsky, A.2
  • 32
    • 3242765057 scopus 로고    scopus 로고
    • Data MULEs: Modeling and analysis of a three-tier architecture for sparse sensor networks
    • R. Shah, S. Roy, S. Jain, and W. Brunette, "Data MULEs: Modeling and analysis of a three-tier architecture for sparse sensor networks," Ad Hoc Netw., vol. 1, no. 23, pp. 215-233, 2003.
    • (2003) Ad Hoc Netw. , vol.1 , Issue.23 , pp. 215-233
    • Shah, R.1    Roy, S.2    Jain, S.3    Brunette, W.4
  • 36
    • 84863455619 scopus 로고    scopus 로고
    • Two-tiered constrained relay node placement in wireless sensor networks: Computational complexity and efficient approximations
    • D. Yang, S. Misra, X. Fang, G. Xue, and J. Zhang, "Two-tiered constrained relay node placement in wireless sensor networks: Computational complexity and efficient approximations," IEEE Trans. Mobile Comput., vol. 11, no. 8, pp. 1399-1411, 2012.
    • (2012) IEEE Trans. Mobile Comput. , vol.11 , Issue.8 , pp. 1399-1411
    • Yang, D.1    Misra, S.2    Fang, X.3    Xue, G.4    Zhang, J.5
  • 37
    • 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 Proc. IEEE Conf. Comput. Commun. (INFOCOM), 2007, pp 1649-1657.
    • Proc. IEEE Conf. Comput. Commun. (INFOCOM), 2007 , pp. 1649-1657
    • Zhang, W.1    Xue, G.2    Misra, S.3


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