ACM Home Page
Please provide us with feedback. Feedback
Multi-target cell tracking based on classic kinetics
Full text PdfPdf (1.29 MB)
Source International Conference On Communications And Mobile Computing archive
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly table of contents
Leipzig, Germany
SESSION: Wireless network applications I table of contents
Pages 1340-1344  
Year of Publication: 2009
ISBN:978-1-60558-569-7
Authors
Lin Fan  Xi'an University of Posts and Telecommunications, Xi'an, China
Zhongmin Wang  Xi'an University of Posts and Telecommunications, Xi'an, China
Hai Wang  Xi'an Jiaotong University, Xi'an, China
Sponsors
ACM: Association for Computing Machinery
: Wiley-Blackwell
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 14,   Downloads (12 Months): 25,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1582379.1582673
What is a DOI?

ABSTRACT

This article did research on multi-target tracking system based on the classic kinetics in Wireless Sensor Networks (WSN), a distributed Cell tracking model is brought up. The whole WSN was layered by Virtual Grid Architecture (VGA)[1][2]. When a target appeared in a grid, local aggregators (LA) aroused all nodes in the eight adjacent grids to compose a Cell to track target. A Cell election rule is proposed: when a target is escaping from the current Cell, based on the classical laws of kinetics and the historical track information, the position and velocity of the target can be estimated when it crossed the edge of Cell and the next Cell can be elected. Multi-Cell sequence can track multitarget concurrently. The concepts of main target and subtarget are introduced. When multi-target were space-time overlapped, a single Cell may have several main targets and sub-targets. The tracking algorithms are designed for them separately. This model can manage the problems like wrong association and missing target. The simulation showed the approach is effective.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
J. Al-Karaki and R. U.-M. A. Kamal. Data aggregation in wireless sensor networks - exact and approximate algorithms. In IEEE Wksp. High Perf. Switching and Routing, Phoenix, USA, April 2004.
 
2
J. N. Al-Karaki and A. E. Kamal. Routing techniques in wireless sensor networks: a survey. IEEE Wireless Communications, 11(6):6--28, January 2004.
 
3
 
4
H. Dai and R. Han. A node-centric load balancing algorithm for wireless sensor networks. In GLOBECOM 2003 - IEEE Global Telecommunications Conference, 2003.
 
5
6
 
7
D. Li, K. Wong, Y. Hu, and A. Sayeed. Detection, classification, and tracking of targets. In IEEE Signal Processing Magazine, volume 19(2), pages 17--30, March 2002.
8
 
9
 
10

Collaborative Colleagues:
Lin Fan: colleagues
Zhongmin Wang: colleagues
Hai Wang: colleagues