메뉴 건너뛰기




Volumn 5258 LNCS, Issue , 2008, Pages 188-199

Convex combination approximation for the min-cost WSN point coverage problem

Author keywords

Approximation algorithm; LP rounding; Minimum set multicover; Point coverage; Sensor deployment

Indexed keywords

GENETIC ALGORITHMS; WIRELESS SENSOR NETWORKS;

EID: 56749183701     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-88582-5_20     Document Type: Conference Paper
Times cited : (13)

References (9)
  • 1
    • 85029768876 scopus 로고    scopus 로고
    • Coverage in Wireless Sensor Networks
    • Ilyas, M, Magboub, I, eds, CRC Press, Boca Raton
    • Cardei, M., Wu, J.: Coverage in Wireless Sensor Networks. In: Ilyas, M., Magboub, I. (eds.) Handbook of Sensor Networks, CRC Press, Boca Raton (2004)
    • (2004) Handbook of Sensor Networks
    • Cardei, M.1    Wu, J.2
  • 2
    • 0036933529 scopus 로고    scopus 로고
    • Grid coverage for surveillance and target location in distributed sensor networks
    • Chakrabarty, K., Iyengar, S.S., Qi, H., Cho, E.: Grid coverage for surveillance and target location in distributed sensor networks. IEEE Trans. on Comput. 51(12), 1448-1453 (2002)
    • (2002) IEEE Trans. on Comput , vol.51 , Issue.12 , pp. 1448-1453
    • Chakrabarty, K.1    Iyengar, S.S.2    Qi, H.3    Cho, E.4
  • 3
    • 0002472851 scopus 로고    scopus 로고
    • Approximating covering and packing problems: Set cover, vertex cover, independent set, and related problems
    • Hochbaum, D, ed, PWS Publishing Company
    • Hochbaum, D.: Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems. In: Hochbaum, D. (ed.) Approximation Algorithms for NP-Hard Problems, PWS Publishing Company (1997)
    • (1997) Approximation Algorithms for NP-Hard Problems
    • Hochbaum, D.1
  • 4
    • 0032107972 scopus 로고    scopus 로고
    • Primal-dual RNC approximation algorithms for set cover and covering integer programs
    • Rajagopalan, S., Vazirani, V.V.: Primal-dual RNC approximation algorithms for set cover and covering integer programs. SIAM J. on Computing 28, 526-541 (1999)
    • (1999) SIAM J. on Computing , vol.28 , pp. 526-541
    • Rajagopalan, S.1    Vazirani, V.V.2
  • 5
    • 33646598513 scopus 로고    scopus 로고
    • Algorithms for wireless sensor networks
    • Sahni, S., Xu, X.: Algorithms for wireless sensor networks. Intl. Jr. on Distr. Sensor Networks 1(1), 35-56 (2005)
    • (2005) Intl. Jr. on Distr. Sensor Networks , vol.1 , Issue.1 , pp. 35-56
    • Sahni, S.1    Xu, X.2
  • 7
    • 33646575568 scopus 로고    scopus 로고
    • Efficient point coverage in wireless sensor networks
    • Wang, J., Zhong, N.: Efficient point coverage in wireless sensor networks. Journal of Combinatorial Optimization 11, 291-305 (2006)
    • (2006) Journal of Combinatorial Optimization , vol.11 , pp. 291-305
    • Wang, J.1    Zhong, N.2
  • 8
    • 85086483563 scopus 로고    scopus 로고
    • Minimum-cost sensor arrangement for achieving wanted coverage lifetime
    • in press
    • Wang, J., Zhong, N.: Minimum-cost sensor arrangement for achieving wanted coverage lifetime. International Journal on Sensor Networks (in press)
    • International Journal on Sensor Networks
    • Wang, J.1    Zhong, N.2
  • 9
    • 46849111811 scopus 로고    scopus 로고
    • Reliable sensor arrangement for achieving wanted coverage lifetime with minimum cost
    • Chicago, August, IEEE Computer Society Press, Los Alamitos () 2007
    • Yu, Z., Wang, J.: Reliable sensor arrangement for achieving wanted coverage lifetime with minimum cost. In: Proc. of the 2nd International Conference on Wireless Algorithms, Systems and Applications (WASA 2007), Chicago, August 2007, pp. 95-102. IEEE Computer Society Press, Los Alamitos (2007)
    • (2007) Proc. of the 2nd International Conference on Wireless Algorithms, Systems and Applications (WASA , pp. 95-102
    • Yu, Z.1    Wang, J.2


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