메뉴 건너뛰기




Volumn 10, Issue 11, 2011, Pages 1534-1545

Sweep coverage with mobile sensors

Author keywords

DSWEEP; dynamic coverage; mobile sensors; Sweep coverage

Indexed keywords

APPROXIMATION RATIOS; BEST EFFORT; CENTRALIZED ALGORITHMS; COVERAGE PROBLEM; DSWEEP; DYNAMIC COVERAGE; EXTENSIVE SIMULATIONS; MOBILE SENSORS; NONLOCALITIES; NP-HARD; POINTS OF INTEREST; SWEEP ALGORITHMS; SWEEP COVERAGE; TIME VARIANT;

EID: 80053118305     PISSN: 15361233     EISSN: None     Source Type: Journal    
DOI: 10.1109/TMC.2010.237     Document Type: Article
Times cited : (133)

References (36)
  • 1
    • 80053122231 scopus 로고    scopus 로고
    • "GreenOrbs," http://www.greenorbs.org, 2011.
    • (2011) GreenOrbs
  • 2
    • 80053103436 scopus 로고    scopus 로고
    • "Robocar," http://www.esi.ust.hk/projects.html, 2011.
    • (2011) Robocar
  • 3
    • 80053115854 scopus 로고    scopus 로고
    • "Simbad," http://simbad.sourceforge.net, 2011.
    • (2011) Simbad
  • 5
    • 37749040165 scopus 로고    scopus 로고
    • Reliable density estimates for achieving coverage and connectivity in thin strips of finite length
    • P. Balister, B. Bollobas, A. Sarkar, and S. Kumar, "Reliable Density Estimates for Achieving Coverage and Connectivity in Thin Strips of Finite Length," Proc. ACM MobiCom, 2007.
    • (2007) Proc. ACM MobiCom
    • Balister, P.1    Bollobas, B.2    Sarkar, A.3    Kumar, S.4
  • 9
    • 24044520078 scopus 로고    scopus 로고
    • Improving wireless sensor network lifetime through power aware organization
    • DOI 10.1007/s11276-005-6615-6
    • M. Cardei and D.-Z. Du, "Improving Wireless Sensor Network Lifetime through Power Aware Organization," ACM Wireless Networks, vol. 11, pp. 333-340, 2005. (Pubitemid 41217860)
    • (2005) Wireless Networks , vol.11 , Issue.3 , pp. 333-340
    • Cardei, M.1    Du, D.-Z.2
  • 10
    • 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," J. Computer Comm. Sensor Networks, vol. 29, pp. 413-420, 2005.
    • (2005) J. Computer Comm. Sensor Networks , vol.29 , pp. 413-420
    • Cardei, M.1    Wu, J.2
  • 11
    • 37749004173 scopus 로고    scopus 로고
    • Designing localized algorithms for barrier coverage
    • A. Chen, S. Kumar, and T.H. Lai, "Designing Localized Algorithms for Barrier Coverage," Proc. ACM MobiCom, 2007.
    • (2007) Proc. ACM MobiCom
    • Chen, A.1    Kumar, S.2    Lai, T.H.3
  • 12
    • 0035616724 scopus 로고    scopus 로고
    • Coverage for robotics-a survey of recent results
    • H. Choset, "Coverage for Robotics-A Survey of Recent Results," Annals of Math. and Artificial Intelligence, vol. 31, pp. 113-126, 2001.
    • (2001) Annals of Math. and Artificial Intelligence , vol.31 , pp. 113-126
    • Choset, H.1
  • 13
    • 0003522092 scopus 로고
    • Worst-Case analysis of a new heuristic for the travelling salesman problem
    • Carnegie Mellon Univ.
    • N. Christofides, "Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem," Technical Report 388, Carnegie Mellon Univ., 1976.
    • (1976) Technical Report 388
    • Christofides, N.1
  • 21
    • 11244289227 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," Proc. ACM MobiCom, 2004.
    • (2004) Proc. ACM MobiCom
    • Kumar, S.1    Lai, T.H.2    Balogh, J.3
  • 24
    • 29844435167 scopus 로고    scopus 로고
    • Mobility improves coverages of sensor networks
    • B. Liu, P. Brass, and O. Dousse, "Mobility Improves Coverages of Sensor Networks," Proc. ACM MobiHoc, 2005.
    • (2005) Proc. ACM MobiHoc
    • Liu, B.1    Brass, P.2    Dousse, O.3
  • 28
    • 44449122353 scopus 로고    scopus 로고
    • Exploiting subgraph structure in multi-robot path planning
    • M.R.K. Ryan, "Exploiting Subgraph Structure in Multi-Robot Path Planning," J. Artificial Intelligence Research, vol. 31, pp. 497-542, 2008. (Pubitemid 351761995)
    • (2008) Journal of Artificial Intelligence Research , vol.31 , pp. 497-542
    • Ryan, M.R.K.1
  • 30
    • 13944269967 scopus 로고    scopus 로고
    • Clock synchronization for wireless sensor networks: A survey
    • DOI 10.1016/j.adhoc.2005.01.002, PII S1570870505000144
    • B. Sundararaman, U. Buy, and A.D. Kshemkalyani, "Clock Synchronization in Wireless Sensor Networks: A Survey," Ad-Hoc Networks, vol. 3, pp. 281-323, May 2005. (Pubitemid 40266053)
    • (2005) Ad Hoc Networks , vol.3 , Issue.3 , pp. 281-323
    • Sundararaman, B.1    Buy, U.2    Kshemkalyani, A.D.3
  • 31
    • 0032473780 scopus 로고    scopus 로고
    • Coordinated path planning for multiple robots
    • PII S092188909700033X
    • P. Svestka and M.H. Overmars, "Coordinated Path Planning for Multiple Robots," Robotics and Autonomous Systems, vol. 23, pp. 125-152, 1998. (Pubitemid 128379468)
    • (1998) Robotics and Autonomous Systems , vol.23 , Issue.3 , pp. 125-152
    • Svestka, P.1    Overmars, M.H.2
  • 32
    • 0003902865 scopus 로고    scopus 로고
    • Epidemic routing for partially connected ad hoc networks
    • Duke Univ.
    • A. Vahdat and D. Becker, "Epidemic Routing for Partially Connected Ad hoc Networks," Technical Report CS-200006, Duke Univ., 2000.
    • (2000) Technical Report CS-200006
    • Vahdat, A.1    Becker, D.2
  • 34
    • 0042014539 scopus 로고    scopus 로고
    • Sensor deployment and target localization based on virtual forces
    • G. Wang, G. Cao, and T.L. Porta, "Sensor Deployment and Target Localization Based on Virtual Forces," Proc. IEEE INFOCOM, 2003.
    • (2003) Proc. IEEE INFOCOM
    • Wang, G.1    Cao, G.2    Porta, T.L.3
  • 36
    • 37749014967 scopus 로고    scopus 로고
    • Trade-Offs between mobility and density for coverage in wireless sensor networks
    • W. Wang, V. Srinivasan, and K.C. Chua, "Trade-Offs between Mobility and Density for Coverage in Wireless Sensor Networks," Proc. ACM MobiCom, 2007.
    • (2007) Proc. ACM MobiCom
    • Wang, W.1    Srinivasan, V.2    Chua, K.C.3


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