Coverage improvement for target tracking in hybrid sensor networks

2010 The 2nd International Conference on Computer and Automation Engineering, ICCAE 2010

Volumn 4, Issue , 2010, Pages 126-130

  Lin, Jenn Wei ^a   Tang, Shih Chieh ^a  

^a FU JEN CATHOLIC UNIVERSITY   (Taiwan)

Author keywords

Coverage; Graph algorithms; Hybrid sensor networks; Monitoring; Target tracking

Indexed keywords

COVERAGE; COVERAGE HOLES; DISTRIBUTED METHODS; FOLLOWING PROBLEM; GRAPH ALGORITHMS; GRID-BASED APPROACH; MAXIMUM COVERAGE; MINIMUM COST FLOW PROBLEM; MOBILE SENSOR NODE; MOBILE TARGETS; NETWORK-BASED; SIMULATION EXPERIMENTS;

COST ACCOUNTING; HYBRID SENSORS; SENSOR NETWORKS; SENSOR NODES; TARGETS; TELECOMMUNICATION EQUIPMENT; WIRELESS NETWORKS;

TARGET TRACKING;

EID: 77952664730     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCAE.2010.5451768     Document Type: Conference Paper

References (13)

1. A.T. Wettergren, "Performance of Search via Track-Before-Detect for Distributed Sensor Networks.", IEEE Trans. Aerospace and Electronic Systems vol. 44, no.1, pp. 314-325, Jan. 2008.
2. Y. Guo and Z. Qu, "Coverage Control for a Mobile Robot Patrolling a Dynamic and Uncertain Environment," Proc. World Congress Intelligent Control and Automation, pp. 4899-4903, June 2004.
3. A. Garg and R. Tamassia, "A New Minimum Cost Flow Algorithm with Applications to Graph Drawing," Proc. 1996 Symp. Graph Drawing (GD '96), pp. 201-216, 1996.
4. Y. Xu, J. Heidemann, and D. Estrin, "Geography Informed Energy Conservation for Ad Hoc Routing," in Proc. ACM Mobile Computing and Networking, pp. 70-84, July 2001.
5. Y. Guo and Z. Qu, "Coverage Control for a Mobile Robot Patrolling a Dynamic and Uncertain Environment," Proc. World Congress on Intelligent Control and Automation, June 2004.
6. T. Sokkalingam, R.K. Ahuja, and J.B. Orlin, "New Polynomial-Time Cycle-Canceling Algorithms for Minimum-Cost Flows," Networks, vol. 36, pp. 53-63, 2000.
7. R. K. Ahuia, T. L. Mananti, and J. B. Orlin, "Network Flows: Theory, Algorithms, and Applications, " Prentice Hall, 1993, 846 pages.
8. G. Wang, G. Cao, P. Berman, and T. F. La Porta, "Bidding Protocols for Deploying Mobile Sensors," IEEE Trans. Mobile Computing, Vol. 6, No. 5, pp. 515-528, May 2007.
9. F. Aurenhammer, "Voronoi Diagrams - A Survey of a Fundamental Geometric Data Structure," ACM Computing Surveys, vol.23, pp. 345-405, 1991.
10. X. Shan, and J. Tan, "Mobile Sensor Deployment for a Dynamic Cluster-based Target Tracking Sensor Network," IEEE/RSJ International Conf. Intelligent Robots and Systems, pp.741-746, 2005.
11. F. Preparata. "Minimum Spanning Circle," in Sleps in Computational Geometry, F. P. Preparata, Ed., University of Illinois, Urbana, 1977.
12. W. Zhang and G. Cao, "DCTC: Dynamic Convoy Tree-Based Collaboration for Target Tracking in Sensor Networks," IEEE Trans. Wireless Communications, vol. 3, no. 5, pp. 1689-1701, 2004.
13. H.W. Kuhn, "The Hungarian Method for the Assignment Problem," Naval Research Logistics Quarterly, vol. 2, pp. 83-97, 1955.