메뉴 건너뛰기




Volumn , Issue , 2007, Pages 68-73

Maximal coverage scheduling in randomly deployed directional sensor networks

Author keywords

[No Author keywords available]

Indexed keywords

SENSOR NETWORKS;

EID: 47749105294     PISSN: 15302016     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPPW.2007.51     Document Type: Conference Paper
Times cited : (66)

References (20)
  • 6
    • 47749095771 scopus 로고    scopus 로고
    • Underground Structure Monitoring with Wireless Sensor Networks
    • USA, April
    • Mo Li and Yunhao Liu, "Underground Structure Monitoring with Wireless Sensor Networks", ACM/IEEE IPSN, USA, April, 2007.
    • (2007) ACM/IEEE IPSN
    • Li, M.1    Liu, Y.2
  • 7
    • 25844504705 scopus 로고    scopus 로고
    • Energy-efficient target coverage in wireless sensor networks
    • M. Cardei, M. T. Thai, Y. Li, and W. Wu, "Energy-efficient target coverage in wireless sensor networks," IEEE Infocom, 2005.
    • (2005) IEEE Infocom
    • Cardei, M.1    Thai, M.T.2    Li, Y.3    Wu, W.4
  • 10
    • 34548314593 scopus 로고    scopus 로고
    • Target-Oriented Scheduling in Directional Sensor Networks
    • Yanli Cai, Wei Lou and Minglu Li, "Target-Oriented Scheduling in Directional Sensor Networks," to appear in IEEE Infocom, 2007.
    • (2007) to appear in IEEE Infocom
    • Cai, Y.1    Lou, W.2    Li, M.3
  • 12
    • 33144487909 scopus 로고    scopus 로고
    • Connected sensor cover: Self-organization of sensor networks for efficient query execution
    • February
    • H. Gupta, Z. Zhou, S. R. Das, and Q. Gu, "Connected sensor cover: Self-organization of sensor networks for efficient query execution," IEEE/ACM Transactions on Networking, vol. 14, no. 1, February 2006.
    • (2006) IEEE/ACM Transactions on Networking , vol.14 , Issue.1
    • Gupta, H.1    Zhou, Z.2    Das, S.R.3    Gu, Q.4
  • 13
    • 47749112262 scopus 로고    scopus 로고
    • Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems. Approximation Algorithms for NP-hard Problems. PWS. 1997.
    • Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems. Approximation Algorithms for NP-hard Problems. PWS. 1997.
  • 14
    • 32944460423 scopus 로고    scopus 로고
    • Coverage by directional sensors in randomly deployed wireless sensor networks
    • Feb
    • J. Ai and A. A. Abouzeid, "Coverage by directional sensors in randomly deployed wireless sensor networks," Journal of Combinatorial Optimization, vol. 11, no. 1, pp. 21-41, Feb. 2006.
    • (2006) Journal of Combinatorial Optimization , vol.11 , Issue.1 , pp. 21-41
    • Ai, J.1    Abouzeid, A.A.2
  • 16
    • 34848862157 scopus 로고    scopus 로고
    • Iso-Map: Energy-Efficient Contour Mapping in Wireless Sensor Networks
    • Canada, June
    • Yunhao Liu and Mo Li, "Iso-Map: Energy-Efficient Contour Mapping in Wireless Sensor Networks", IEEE ICDCS, Canada, June 2007.
    • (2007) IEEE ICDCS
    • Liu, Y.1    Li, M.2
  • 18
    • 11244271384 scopus 로고    scopus 로고
    • Power conservation and quality of surveillance in target tracking sensor networks
    • C. Gui and P. Mohapatra, "Power conservation and quality of surveillance in target tracking sensor networks," ACM MobiCom, 2004.
    • (2004) ACM MobiCom
    • Gui, C.1    Mohapatra, P.2
  • 19
    • 85045636699 scopus 로고    scopus 로고
    • Maintaining sensing coverage and connectivity in large sensor networks
    • H. Zhang and J. C. Hou, "Maintaining sensing coverage and connectivity in large sensor networks," Ad Hoc & Sensor Wireless Networks, 2005.
    • (2005) Ad Hoc & Sensor Wireless Networks
    • Zhang, H.1    Hou, J.C.2


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