메뉴 건너뛰기




Volumn 9, Issue 7, 2010, Pages 2156-2164

On perimeter coverage in wireless sensor networks

Author keywords

minimum cover; perimeter coverage; Sensor network

Indexed keywords

CENTRALIZED ALGORITHMS; DISTRIBUTED ALGORITHM; EXTENSIVE SIMULATIONS; FORMAL PROOFS; MINIMUM COVER; PERFORMANCE IMPROVEMENTS; PERIMETER COVERAGE; SENSOR APPLICATIONS; SENSOR NETWORK APPLICATIONS; SINGLE SENSOR; TARGET OBJECT;

EID: 77954739020     PISSN: 15361276     EISSN: None     Source Type: Journal    
DOI: 10.1109/TWC.2010.07.080817     Document Type: Article
Times cited : (26)

References (27)
  • 3
    • 85029768876 scopus 로고    scopus 로고
    • Coverage in wireless sensor networks
    • M. Ilyas and I. Magboub, editors
    • M. Cardei and J.Wu, "Coverage in wireless sensor networks," Handbook of Sensor Networks, M. Ilyas and I. Magboub, editors, 2004.
    • (2004) Handbook of Sensor Networks
    • Cardei, M.1    Wu, J.2
  • 4
  • 5
    • 0021374353 scopus 로고
    • On a circle-cover minimization problem
    • Feb.
    • C. C. Lee and D. T. Lee, "On a circle-cover minimization problem," Inf. Process. Lett., vol.18, pp. 109-115, Feb. 1984.
    • (1984) Inf. Process. Lett. , vol.18 , pp. 109-115
    • Lee, C.C.1    Lee, D.T.2
  • 6
    • 0023981515 scopus 로고
    • Parallel circle-cover algorithms
    • A. A. Bertossi, "Parallel circle-cover algorithms," Info. Process. Lett., vol.27, pp. 133-139, 1988.
    • (1988) Info. Process. Lett. , vol.27 , pp. 133-139
    • Bertossi, A.A.1
  • 7
    • 0024733821 scopus 로고
    • An optimal algorithm for the minimum circle-cover problem
    • M. Atallah and D. Z. Chen, "An optimal algorithm for the minimum circle-cover problem," Inf. Process. Lett., vol.32, pp. 159-165, 1989.
    • (1989) Inf. Process. Lett. , vol.32 , pp. 159-165
    • Atallah, M.1    Chen, D.Z.2
  • 8
    • 0024880375 scopus 로고
    • Optimal parallel circlecover and independent set algorithms for circular ARC graphs
    • M. S. Yu, C. L. Chen, and R. C. T. Lee, "Optimal parallel circlecover and independent set algorithms for circular ARC graphs," in Proc. International Conf. Parallel Processing, 1989, pp. 126-129.
    • (1989) Proc. International Conf. Parallel Processing , pp. 126-129
    • Yu, M.S.1    Chen, C.L.2    Lee, R.C.T.3
  • 11
    • 0242527323 scopus 로고    scopus 로고
    • Connected sensor cover: Selforganization of senor networks for efficient query execution
    • H. Gupta, S. R. Das, and Q. Gu, "Connected sensor cover: selforganization of senor networks for efficient query execution," in Proc. ACM MobiHoc, 2003.
    • (2003) Proc. ACM MobiHoc
    • Gupta, H.1    Das, S.R.2    Gu, Q.3
  • 12
    • 10744232231 scopus 로고    scopus 로고
    • Energy-efficient area monitoring for sensor networks
    • Feb.
    • J. Carle and D. Simplot-Ryl, "Energy-efficient area monitoring for sensor networks," IEEE Computer, Feb. 2004.
    • (2004) IEEE Computer
    • Carle, J.1    Simplot-Ryl, D.2
  • 15
    • 20844432847 scopus 로고    scopus 로고
    • The coverage problem in a wireless sensor network
    • -, "The coverage problem in a wireless sensor network," Mobile Networks Applications, 2005.
    • (2005) Mobile Networks Applications
  • 16
    • 44949263845 scopus 로고    scopus 로고
    • Energy efficient fractional coverage schemes for low cost wireless sensor networks
    • M. Ye, E. Chan, G. Chen, and J. Wu, "Energy efficient fractional coverage schemes for low cost wireless sensor networks," in Proc. IEEE ICDCSW, 2006.
    • (2006) Proc. IEEE ICDCSW
    • Ye, M.1    Chan, E.2    Chen, G.3    Wu, J.4
  • 17
    • 36348971281 scopus 로고    scopus 로고
    • A trust-based geographical routing scheme in sensor networks
    • K.-S. Hung, K.-S. Lui, and Y.-K. Kwok, "A trust-based geographical routing scheme in sensor networks," in Proc. IEEE WCNC, 2007.
    • (2007) Proc. IEEE WCNC
    • Hung, K.-S.1    Lui, K.-S.2    Kwok, Y.-K.3
  • 18
    • 25844434036 scopus 로고    scopus 로고
    • Node placement for connected coverage in sensor networks
    • K. Kar and S. Banerjee, "Node placement for connected coverage in sensor networks," in Proc. ACM WiOpt, 2003.
    • (2003) Proc. ACM WiOpt
    • Kar, K.1    Banerjee, S.2
  • 19
    • 24044520078 scopus 로고    scopus 로고
    • Improving wireless sensor network lifetime through power aware organization
    • M. Cardei and D.-Z. Du, "Improving wireless sensor network lifetime through power aware organization," in Proc. ACM Wireless Networks, 2005, pp. 333-340.
    • (2005) Proc. ACM Wireless Networks , pp. 333-340
    • Cardei, M.1    Du, D.-Z.2
  • 20
    • 40749141812 scopus 로고    scopus 로고
    • Improving network lifetime using sensors with adjustable sensing range
    • M. Cardei, J. Wu, and M. Lu, "Improving network lifetime using sensors with adjustable sensing range," International J. Sensor Networks, pp. 41-49, 2006.
    • (2006) International J. Sensor Networks , pp. 41-49
    • Cardei, M.1    Wu, J.2    Lu, M.3
  • 22
    • 84893567726 scopus 로고    scopus 로고
    • Boundary coverage and coverage boundary problems in wireless sensor networks
    • Apr.
    • M. K. Watfa and S. Commuri, "Boundary coverage and coverage boundary problems in wireless sensor networks," Int. J. Sensor Networks, Apr. 2007.
    • (2007) Int. J. Sensor Networks
    • Watfa, M.K.1    Commuri, S.2
  • 23
    • 77954722221 scopus 로고    scopus 로고
    • Power conservation approaches to the border coverage problem in wireless sensor networks
    • -, "Power conservation approaches to the border coverage problem in wireless sensor networks," in Proc. International Conf. Wireless Networks (ICWN), 2006.
    • (2006) Proc. International Conf. Wireless Networks (ICWN)
  • 26
    • 51249105532 scopus 로고    scopus 로고
    • Self-orienting wireless multimedia sensor networks for maximizing multimedia coverage
    • May
    • N. Tezcan and W. Wang, "Self-orienting wireless multimedia sensor networks for maximizing multimedia coverage," in Proc. IEEE ICC, May 2008.
    • (2008) Proc. IEEE ICC
    • Tezcan, N.1    Wang, W.2


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