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

A Minimalist Path Detection Approach for Wireless Sensor Networks

Author

Listed:
  • Mohsen Sharifi
  • Ali Aminfar
  • Elnaz Abdollahzadeh

Abstract

Most object tracking techniques find the exact locations of an object, while many other applications are only interested in the object's path rather than its locations. This provides an opportunity to reduce the existing tracking methods' resource usage by only focusing on the path detection. Taking advantage of this opportunity, this article presents two new minimalist approaches for accurately detecting unknown available passages in a sensor field without requiring the exact locations of the objects. In the first approach, each sensor sends its own location to a base station when it senses an object of interest. The base station uses b-spline curves to build the object's path online. Since each sensor sends its location data just once per new path, the first approach is a minimalist approach. The second approach is offline and uses non-uniform rational b-spline (NURBS) curves. Since NURBS needs weighted locations, each sensor sends its own location in addition to the number of times it has sensed an object based on the object's weight. Using the same simulation models, both approaches greatly reduce power consumption and improve the accuracy of the computed paths. The NURBS approach has proved to be robust on false alarms and improves the accuracy of path detection up to 95 percent, which is very close to detecting the object's actual path.

Suggested Citation

  • Mohsen Sharifi & Ali Aminfar & Elnaz Abdollahzadeh, 2009. "A Minimalist Path Detection Approach for Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 5(5), pages 576-595, October.
  • Handle: RePEc:sae:intdis:v:5:y:2009:i:5:p:576-595
    DOI: 10.1080/15501320802300198
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/15501320802300198?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:576-595. 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.