메뉴 건너뛰기




Volumn 1, Issue , 2013, Pages 521-526

K-coverage in regular deterministic sensor deployments

Author keywords

[No Author keywords available]

Indexed keywords

DATA GATHERING; ENVIRONMENTAL MONITORING; LOWER BOUNDS; OBJECT TRACKING; RANDOM DEPLOYMENT; SENSOR DENSITY; SENSOR DEPLOYMENT; UPPER BOUND;

EID: 84881106371     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISSNIP.2013.6529844     Document Type: Conference Paper
Times cited : (9)

References (19)
  • 2
    • 32644446747 scopus 로고    scopus 로고
    • Energy-efficient coverage problems in wireless ad-hoc sensor networks
    • M. Cardei and J. Wu, "Energy-efficient coverage problems in wireless ad-hoc sensor networks," Computer Communications, vol. 29, no. 4, pp. 413-420, 2006.
    • (2006) Computer Communications , vol.29 , Issue.4 , pp. 413-420
    • Cardei, M.1    Wu, J.2
  • 6
    • 0035424017 scopus 로고    scopus 로고
    • Location systems for ubiquitous computing
    • J. Hightower and G. Borriella, "Location systems for ubiquitous computing," IEEE Computer, vol. 34, no. 8, pp. 57-66, 2001.
    • (2001) IEEE Computer , vol.34 , Issue.8 , pp. 57-66
    • Hightower, J.1    Borriella, G.2
  • 7
    • 85032751970 scopus 로고    scopus 로고
    • Detection, classification, and tracking of targets
    • D. Li, K. D. Wong, Y. H. Hu, and A. M. Sayeed, "Detection, classification, and tracking of targets," IEEE Signal Processing Magazine, vol. 19, no. 2, pp. 17-29, 2002.
    • (2002) IEEE Signal Processing Magazine , vol.19 , Issue.2 , pp. 17-29
    • Li, D.1    Wong, K.D.2    Hu, Y.H.3    Sayeed, A.M.4
  • 9
    • 39049146704 scopus 로고    scopus 로고
    • Is deterministic deployment worse than random deployment for wireless sensor networks?
    • H. Zhang and J. C. Hou, "Is deterministic deployment worse than random deployment for wireless sensor networks?" in IEEE INFOCOM, 2006, pp. 1-13.
    • (2006) IEEE INFOCOM , pp. 1-13
    • Zhang, H.1    Hou, J.C.2
  • 10
    • 20844432847 scopus 로고    scopus 로고
    • The coverage problem in a wireless sensor network
    • C.-F. Huang and Y.-C. Tseng, "The coverage problem in a wireless sensor network," Mobile Networks and Applications, vol. 10, pp. 519-528, 2005.
    • (2005) Mobile Networks and Applications , vol.10 , pp. 519-528
    • Huang, C.-F.1    Tseng, Y.-C.2
  • 11
    • 43949127767 scopus 로고    scopus 로고
    • On k-coverage in a mostly sleeping sensor network
    • S. Kumar, T. H. Lai, and J. Balogh, "On k-coverage in a mostly sleeping sensor network," Wireless Networks, vol. 14, no. 3, pp. 277-294, 2008.
    • (2008) Wireless Networks , vol.14 , Issue.3 , pp. 277-294
    • Kumar, S.1    Lai, T.H.2    Balogh, J.3
  • 13
    • 70350244868 scopus 로고    scopus 로고
    • On the connected k-coverage problem in heterogeneous sensor nets: The curse of randomness and heterogeneity
    • H. M. Ammari and J. Giudici, "On the connected k-coverage problem in heterogeneous sensor nets: The curse of randomness and heterogeneity," in IEEE International Conference on Distributed Computing Systems, 2009, pp. 265-272.
    • (2009) IEEE International Conference on Distributed Computing Systems , pp. 265-272
    • Ammari, H.M.1    Giudici, J.2
  • 14
    • 33747624071 scopus 로고    scopus 로고
    • Integrated coverage and connectivity configuration for energy conservation in sensor networks
    • G. Xing, X. Wang, Y. Zhang, C. Lu, R. Pless, and C. Gill, "Integrated coverage and connectivity configuration for energy conservation in sensor networks," ACM Transactions on Sensor Networks, vol. 1, no. 1, pp. 36-72, 2005.
    • (2005) ACM Transactions on Sensor Networks , vol.1 , Issue.1 , pp. 36-72
    • Xing, G.1    Wang, X.2    Zhang, Y.3    Lu, C.4    Pless, R.5    Gill, C.6
  • 15
    • 34548297823 scopus 로고    scopus 로고
    • Randomized k-coverage algorithms for dense sensor networks
    • M. Hefeeda and M. Bagheri, "Randomized k-coverage algorithms for dense sensor networks," in IEEE INFOCOM, 2007, pp. 2376-2380.
    • (2007) IEEE INFOCOM , pp. 2376-2380
    • Hefeeda, M.1    Bagheri, M.2
  • 17
    • 69949146819 scopus 로고    scopus 로고
    • Optimal 3-coverage with minimum separation requirements for ubiquitous computing environments
    • J.-E. Kim, J. Han, and C.-G. Lee, "Optimal 3-coverage with minimum separation requirements for ubiquitous computing environments," Mobile Networks and Applications, vol. 14, no. 5, pp. 556-570, 2009.
    • (2009) Mobile Networks and Applications , vol.14 , Issue.5 , pp. 556-570
    • Kim, J.-E.1    Han, J.2    Lee, C.-G.3
  • 19
    • 0000288208 scopus 로고
    • The number of circles covering a set
    • R. Kershner, "The number of circles covering a set," American Journal of Mathematics, vol. 61, pp. 665-671, 1939.
    • (1939) American Journal of Mathematics , vol.61 , pp. 665-671
    • Kershner, R.1


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