Conference Paper

Tracking moving targets in a smart sensor network

Dept. of ECECS, Cincinnati Univ., OH, USA
DOI: 10.1109/VETECF.2003.1286181 Conference: Vehicular Technology Conference, 2003. VTC 2003-Fall. 2003 IEEE 58th, Volume: 5
Source: IEEE Xplore

ABSTRACT Networks of small, densely distributed wireless sensor nodes are capable of solving a variety of collaborative problems such as monitoring and surveillance. We develop a simple algorithm that detects and tracks a moving target, and alerts sensor nodes along the projected path of the target. The algorithm involves only simple computation and localizes communication only to the nodes in the vicinity of the target and its projected course. The algorithm is evaluated on a small-scale testbed of Berkeley motes using a light source as the moving target. The performance results are presented emphasizing the accuracy of the technique, along with a discussion about our experience in using such a platform for target tracking experiments.

0 Bookmarks
 · 
60 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: Target localization and tracking have been an important fundamental technology in wireless sensor networks. Distance irrelevant localization algorithm is one of the most popular methods in target localization application. This kind of algorithm mostly locates a target by getting the target's approximate area and calculating its centroid. Because of the large calculating quantity and bad real-time capability of the traditional methods in solving the centroid of irregular approximate area, a universal Adaptive grid Division (AID) method was proposed. By grid dividing and scanning towards the WSNs deploying area, a target approximate area was got and the localization precision was adaptively adjusted according to the grid granularity. The results of experiment showed that AID had a higher real-time capability under similar precision with traditional methods.
    Computer Science and Network Technology (ICCSNT), 2012 2nd International Conference on; 01/2012
  • [Show abstract] [Hide abstract]
    ABSTRACT: Target localization is one of the most important and fundamental issues in wireless sensor networks (WSNs). Because of its special topology structure, grid-based wireless sensor networks have a great advantage in target localization. In this paper, firstly, we analyze the uncertain area founded by the topology structure of single-level grid-deployed networks. A double-level grid-based localization method is proposed, which is theoretical and practical. We consider the computational complexity of the algorithm and define its localization error in both single-level and double-level grid-deployed networks. Simulation results reveal the general rule between different factors and their influences on location accuracy, which is meaningful to the real application of our method. The results prove that double-level grid-based localization method can not only keep location precision to a certain extent, but is also real-time and practical.
    Sensors, 2012 IEEE; 01/2012
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We revisit the classic object tracking problem with a novel and effective, yet straightforward distributed solution for resource-lean devices. The difficulty of object tracking lies in the mismatch between the limited computational capacity of typical sensor nodes and the processing requirements of typical tracking algorithms. In this paper, we introduce an in-network system for tracking mobile objects using resource-lean sensors. The system is based on a distributed, dynamically-scoped tracking algorithm which alters the event detection region and reporting rate based on object speed. A leader node records the detected samples across the event region and estimates the object's location in situ. We study the performance of our tracking implementation on an 80-node test bed. The results show that it achieves high performance, even for very fast objects, and is readily implemented on resource-lean sensors. While the area is well-studied, the unique combination of algorithmic features represents a significant addition to the literature.
    DCOSS 2014; 05/2014

Full-text

Download
0 Downloads
Available from