IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v5y2009i5p619-643.html
   My bibliography  Save this article

An Enhanced CPA Algorithm for Real-Time Target Tracking in Wireless Sensor Networks

Author

Listed:
  • Qing Yang
  • Alvin Lim
  • Kenan Casey
  • Raghu-Kisore Neelisetti

Abstract

Real-time tracking of moving targets using wireless sensor networks has been a challenging problem because of the high velocity of the targets and the limited resources of the sensors. CPA (closest point of approach) algorithms are appropriate for tracking fast-moving targets since the tracking error is roughly inversely proportional to the square root of the target velocity. However, this approach requires a specific node configuration with reference to the target trajectory which may not always be possible in randomly deployed sensor networks. Moreover, our mathematical analysis of the original CPA algorithm shows that it suffers from huge localization errors due to inaccuracies in sensor location and measured CPA times. To address these issues, we propose an enhanced CPA (ECPA) algorithm which requires only five sensors around the target to achieve the reliability and efficiency we want for computing the bearing of the target trajectory, the relative position between the sensors and the trajectory, and the velocity of the target. To validate the ECPA algorithm, we designed and implemented this algorithm over an actual data-centric acoustic sensor network as well as simulating it in an NS-2 simulator. The results of our field experiments and simulations show that we can achieve our goals of detecting the target and predicting its location, velocity and direction of travel with reasonable accuracy.

Suggested Citation

  • Qing Yang & Alvin Lim & Kenan Casey & Raghu-Kisore Neelisetti, 2009. "An Enhanced CPA Algorithm for Real-Time Target Tracking in Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 5(5), pages 619-643, October.
  • Handle: RePEc:sae:intdis:v:5:y:2009:i:5:p:619-643
    DOI: 10.1080/15501320802581318
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1080/15501320802581318
    Download Restriction: no

    File URL: https://libkey.io/10.1080/15501320802581318?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:5:y:2009:i:5:p:619-643. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.